⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ a 1 + a 2 + ⋯ + a 9 = 1 a 1 2 + a 2 2 + ⋯ + a 9 2 = 2 a 1 3 + a 2 3 + ⋯ + a 9 3 = 3 ⋮ a 1 9 + a 2 9 + ⋯ + a 9 9 = 9
Let N be the unique 9-tuple of complex numbers ( a 1 , a 2 , … , a 9 ) that satisfies the system of equations above.
What is the smallest positive value of k such that k × ( a 1 1 0 + a 2 1 0 + ⋯ + a 9 1 0 ) is an integer?
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.
WOAHHHHHHHHHHHHHHHHHHHHHHHHH!!!!!
You are dead on right. I wrote a small piece of code which reverses any given first N newton's identities to obtain the symmetric coefficients, and all of your values for Si's are correct.
Problem Loading...
Note Loading...
Set Loading...
Nope, I insist on doing Newton's sums all the way.
Let:
S 1 = a 1 + a 2 + … + a 9 S 2 = a 1 a 2 + a 1 a 3 + … + a 8 a 9 S 3 = a 1 a 2 a 3 + a 1 a 2 a 4 + … + a 7 a 8 a 9 S 4 = a 1 a 2 a 3 a 4 + a 1 a 2 a 3 a 5 + … + a 6 a 7 a 8 a 9 S 5 = a 1 a 2 a 3 a 4 a 5 + a 1 a 2 a 3 a 4 a 6 + … + a 5 a 6 a 7 a 8 a 9 S 6 = a 1 a 2 a 3 a 4 a 5 a 6 + a 1 a 2 a 3 a 4 a 5 a 7 + … + a 4 a 5 a 6 a 7 a 8 a 9 S 7 = a 1 a 2 a 3 a 4 a 5 a 6 a 7 + a 1 a 2 a 3 a 4 a 5 a 6 a 8 + … + a 3 a 4 a 5 a 6 a 7 a 8 a 9 S 8 = a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 + a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 9 + … + a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 9 S 9 = a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 9
Also, let
P 1 = a 1 + a 2 + … + a 9 P 2 = a 1 2 + a 2 2 + … + a 9 2 P 3 = a 1 3 + a 2 3 + … + a 9 3 ⋮ P 9 = a 1 9 + a 2 9 + … + a 9 9 P 1 0 = a 1 1 0 + a 2 1 0 + … + a 9 1 0
We know that:
P 1 = S 1 P 2 = S 1 P 1 − 2 S 2 P 3 = S 1 P 2 − S 2 P 1 + 3 S 3 P 4 = S 1 P 3 − S 2 P 2 + S 3 P 1 − 4 S 4 P 5 = S 1 P 4 − S 2 P 3 + S 3 P 2 − S 4 P 1 + 5 S 5 P 6 = S 1 P 5 − S 2 P 4 + S 3 P 3 − S 4 P 2 + S 5 P 1 − 6 S 6 P 7 = S 1 P 6 − S 2 P 5 + S 3 P 4 − S 4 P 3 + S 5 P 2 − S 6 P 1 + 7 S 7 P 8 = S 1 P 7 − S 2 P 6 + S 3 P 5 − S 4 P 4 + S 5 P 3 − S 6 P 2 + S 7 P 1 − 8 S 8 P 9 = S 1 P 8 − S 2 P 7 + S 3 P 6 − S 4 P 5 + S 5 P 4 − S 6 P 3 + S 7 P 2 − S 8 P 1 + 9 S 9 P 1 0 = S 1 P 9 − S 2 P 8 + S 3 P 7 − S 4 P 6 + S 5 P 5 − S 6 P 4 + S 7 P 3 − S 8 P 2 + S 9 P 1
Substitute the values one by one:
⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ 1 = S 1 2 = 1 ( 1 ) − 2 S 2 3 = 1 ( 2 ) + 2 1 ( 1 ) + 3 S 3 4 = 1 ( 3 ) + 2 1 ( 2 ) + 6 1 ( 1 ) − 4 S 4 5 = 1 ( 4 ) + 2 1 ( 3 ) + 6 1 ( 2 ) − 2 4 1 ( 1 ) + 5 S 5 6 = 1 ( 5 ) + 2 1 ( 4 ) + 6 1 ( 3 ) − 2 4 1 ( 2 ) − 1 2 0 1 9 ( 1 ) − 6 S 6 7 = 1 ( 6 ) + 2 1 ( 5 ) + 6 1 ( 4 ) − 2 4 1 ( 3 ) − 1 2 0 1 9 ( 2 ) − 7 2 0 1 5 1 ( 1 ) + 7 S 7 8 = 1 ( 7 ) + 2 1 ( 6 ) + 6 1 ( 5 ) − 2 4 1 ( 4 ) − 1 2 0 1 9 ( 3 ) − 7 2 0 1 5 1 ( 2 ) − 5 0 4 0 1 0 9 1 ( 1 ) − 8 S 8 9 = 1 ( 8 ) + 2 1 ( 7 ) + 6 1 ( 6 ) − 2 4 1 ( 5 ) − 1 2 0 1 9 ( 4 ) − 7 2 0 1 5 1 ( 3 ) − 5 0 4 0 1 0 9 1 ( 2 ) − 4 0 3 2 0 7 8 4 1 ( 1 ) + 9 S 9 P 1 0 = 1 ( 9 ) + 2 1 ( 8 ) + 6 1 ( 7 ) − 2 4 1 ( 6 ) − 1 2 0 1 9 ( 5 ) − 7 2 0 1 5 1 ( 4 ) − 5 0 4 0 1 0 9 1 ( 3 ) − 4 0 3 2 0 7 8 4 1 ( 2 ) − 3 6 2 8 8 0 5 6 5 1 9 ( 1 ) S 1 = 1 S 2 = − 2 1 S 3 = 6 1 S 4 = 2 4 1 S 5 = − 1 2 0 1 9 S 6 = 7 2 0 1 5 1 S 7 = − 5 0 4 0 1 0 9 1 S 8 = 4 0 3 2 0 7 8 4 1 S 9 = − 3 6 2 8 8 0 5 6 5 1 9 = 3 6 2 8 8 0 4 0 2 5 0 7 1
Note: I verified that this value is the correct one in its simplest form with the help of WolframAlpha
Now, we are looking for the smallest possible value of k such that k P 1 0 = 3 6 2 8 8 0 4 0 2 5 0 7 1 k is an integer
Obviously, the answer would be 3 6 2 8 8 0
The truth:
Most of us who solved this question didn't actually computed this value. (I probably was the only person who did this, I actually computed this after I solved the question, just to do Newton's sums all the way and because this is the only way I know how to prove my answer)
What I did was, I computed all the way to S 4 , and I then realized that P 1 0 probably was:
P 1 0 = P 1 + 2 ! P 2 + 3 ! P 3 − 4 ! P 4 ± 5 ! a P 5 ± 6 ! b P 6 ± 7 ! c P 7 ± 8 ! d P 8 ± 9 ! e P 9
where a , b , c , d , e are all constants.
I guessed that P 1 0 = 9 ! n , where n and 9 ! are coprime positive integers. Therefore, for k P 1 0 = 9 ! k n to be an integer, the smallest positive value that k can take is probably 9 ! = 3 6 2 8 8 0 . Hopefully, someone else can write a solution which can prove this.