For how many positive integer n ( ≤ 2 0 1 7 ), will S be divisible by 1 9 7 2 ? S = 3 4 5 n + 1 7 9 n − 5 n − 2 6 n + 4 9 3 n
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.
What a great insight and property to use! Can't wait to see the full solution :)
Log in to reply
Solution finished!
Log in to reply
Beautiful :) The part of your solution on its divisibility by 4 is amazing, and it's now clear why n must be odd.
[Not a solution.]
By trying sufficient n , we can conjecture that 1 9 7 2 only divides S if n is odd and ≥ 3 , making the answer 2 2 0 1 7 − 3 + 1 = 1 0 0 8 assuming that our conjecture is in fact true for all such n .
I'm not sure how to prove it, however; I didn't get very far breaking 1 9 7 2 and each term of S down into its prime factors. What's the proof for this, @Áron Bán-Szabó ?
Log in to reply
I started writing the solution, but I have to go now. When I arrive home, I will finish my solution. Until then try to finish my solution ;)
Problem Loading...
Note Loading...
Set Loading...
1 9 7 2 = 2 2 ∗ 1 7 ∗ 2 9 So if a number is divisible by all of the 4 , 1 7 , 2 9 numbers, then it is divisible by 1 9 7 2 .
We wil use that a − b ∣ a n − b n for any a , b , n positive integers.
Divisible by 1 7 :
S = ( 3 4 5 n − 5 n ) + ( 1 7 9 n − 2 6 n ) + 4 9 3 n
Since 3 4 5 − 5 = 3 4 0 1 7 9 − 2 6 = 1 5 3 4 9 3 = 2 0 ∗ 1 7 = 9 ∗ 1 7 = 1 7 ∗ 2 9 ∣ 3 4 5 n − 5 n ∣ 1 7 9 n − 2 6 n ∣ 4 9 3 n S is divisible by 1 7 .
Divisible by 2 9 :
S = ( 3 4 5 n − 2 6 n ) + ( 1 7 9 n − 5 n ) + 4 9 3 n
Since
3 4 5 − 2 6 = 3 1 9 1 7 9 − 5 = 1 7 4 4 9 3 = 1 1 ∗ 2 9 = 6 ∗ 2 9 = 1 7 ∗ 2 9 ∣ 3 4 5 n − 2 6 n ∣ 1 7 9 n − 5 n ∣ 4 9 3 n S is divisbly by 2 9 .
Divisible by 4 :
It is clear that S always divisible by 2 , because the sum of three odd numbers - an even and an odd number = even number. The question is that what is the remainder when it is divided by 4 .
S = ( 4 ∗ 8 6 + 1 ) n + ( 4 5 ∗ 4 − 1 ) n − ( 4 + 1 ) n − ( 6 ∗ 4 + 2 ) n + ( 1 2 3 ∗ 4 + 1 ) n
Note that ( 4 k + l ) n ≡ l n m o d 4 This can be proved using the Binominal theorem. From that ( 4 ∗ 8 6 + 1 ) n ( 4 5 ∗ 4 − 1 ) n ( 4 + 1 ) n ( 6 ∗ 4 + 2 ) n ( 1 2 3 ∗ 4 + 1 ) n ≡ 1 m o d 4 ≡ { If n is odd ⟹ − 1 If n is even ⟹ 1 m o d 4 ≡ 1 m o d 4 ≡ { n = 1 ⟹ 2 n > 1 ⟹ 0 ≡ 1 m o d 4
So the remainders: n = 1 n is odd n > 1 n is even S S S ≡ 2 m o d 4 ≡ 0 m o d 4 ≡ 2 m o d 4
So S will divisible by 1 9 7 2 , if (and only if) n is an odd number, > 1 .
Therefore the answer is 1 0 0 8 .