If { a 1 , a 2 , a 3 , … , a n } is a set of real numbers, placed so that a 1 < a 2 < a 3 < ⋯ < a n , its complex power sum is defined as a 1 i + a 2 i 2 + a 3 i 3 + ⋯ + a n i n , where i 2 = − 1 . Let S n be the sum of the complex power sums of all nonempty subsets of { 1 , 2 , … , n } . Given that S 8 = − 1 7 6 − 6 4 i and S 9 = p + q i , where p , q ∈ Z , find ∣ p ∣ + ∣ q ∣ .
Try my set
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Ah, I didn't realize that it was a binomial expansion of ( i + 1 ) 8 . Nice solution!
Problem Loading...
Note Loading...
Set Loading...
S n + 1 has been related to S n . from the definition, S n + 1 − S n is equal to the sum of the complex power sums of all subsets of { 1 , 2 , 3 , . . . , n + 1 } that contain n + 1 . Because n + 1 is the biggest number... S n + 1 − S n = n i + ( 1 i + n i 2 ) + ( 2 i + n i 2 ) + … and so on, also because of the definition given, we get: S n + 1 − S n = S n + ( n + 1 ) i + ( n + 1 ) i ( n i ) + ( n + 1 ) i ( n C 2 ) ( i 2 ) + ⋯ + ( n + 1 ) i ( n C n ) ( i n )
Then, S n + 1 − 2 S n = n i ( 1 + i ) n ) and we get the recursive relation (isn't this recursive) S n + 1 = 2 S n + n i ( 1 + i ) n Put n = 8 and we get: S 9 = 2 S 8 + 9 i ( 1 + i ) 8 S 9 = 2 ( − 1 7 6 − 6 4 i ) + ( 9 i ) 1 6 S 9 = − 3 5 2 − 1 2 8 i + 1 4 4 i S 9 = − 3 5 2 + 1 6 i So, p = − 3 5 2 , q = 1 6 , and then ∣ p ∣ + ∣ q ∣ = 3 6 8 . Sorry for bad writing. Anyone can post a new, better one?
Mod: L A T E X 'ed