Is 5 5 5 5 2 2 2 2 + 2 2 2 2 5 5 5 5 divisible by 7? Show your reasoning.
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.
Good question. Reasoning answer.
Let N = 5 5 5 5 2 2 2 2 + 2 2 2 2 5 5 5 5 . Note that 5 5 5 5 m o d 7 = 4 and 2 2 2 2 m o d 7 = 3 .
N ( ≡ ( 5 5 5 1 + 4 ) 2 2 2 2 + ( 2 2 1 9 + 3 ) 5 5 5 5 ) (mod 7) ≡ ( 4 2 2 2 2 + 3 5 5 5 5 ) (mod 7) ≡ ( 4 3 × 7 4 0 + 2 + 3 3 × 1 8 5 1 + 2 ) (mod 7) ≡ ( 6 4 7 4 0 × 4 2 + 2 7 1 8 5 1 × 3 2 ) (mod 7) ≡ ( ( 6 3 + 1 ) 7 4 0 × 1 6 + ( 2 8 − 1 ) 1 8 5 1 × 9 ) (mod 7) ≡ ( 1 7 4 0 × 2 + ( − 1 ) 1 8 5 1 × 2 ) (mod 7) ≡ 2 − 2 ≡ 0 (mod 7)
Yes , N is divisible by 7.
Problem Loading...
Note Loading...
Set Loading...
5555^2222 + 2222^5555 = (5555^2222 - 4^2222) + (2222^5555 + 4^5555) - (4^5555 - 4^2222)
The first "term", (5555^2222 - 4^2222), is divisible by 5555 - 4 = 5551 = 7 * 793, since a^n - b^n is always divisible by (a - b).
The second "term", (2222^5555 + 4^5555), is divisible by 2222 + 4 = 2226 = 7 * 318, since a^n + b^n is divisible by (a+b) if n is odd.
And the third term may be written as 4^2222 * (4^3333 - 1) = 4^2222 * (64^1111 - 1), which is clearly divisible by (64 - 1) = 63, and hence by 7 .