For any odd natural number n , ( 3 ) 4 n + ( 2 ) 4 n is always divisible by...
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.
Very good solution indeed!! :)
( 3 ) 4 n + ( 2 ) 4 n = 9 n + 4 n = ( 9 + 4 ) ( 9 2 m − 9 2 m − 1 ⋅ 4 + 9 2 m − 2 ⋅ 4 2 − ⋯ + 4 2 m ) = 1 3 ( 9 2 m − 9 2 m − 1 ⋅ 4 + 9 2 m − 2 ⋅ 4 2 − ⋯ + 4 2 m ) Let n = 2 m + 1
Therefore, it is always divisible by 1 3 .
why did you assume n = 2m + 1?
Log in to reply
The problem states that n is odd
Problem Loading...
Note Loading...
Set Loading...
( 3 ) 4 n + ( 2 ) 4 n = 9 n + 4 n
Claim:
a + b ∣ a n + b n when n is odd
Proof:
Since n is odd, write n = 2 k + 1 k ∈ N
a n + b n = a 2 k + 1 + b 2 k + 1 = ( a + b ) ( a 2 k − a 2 k − 1 b + a 2 k − 2 b 2 − … − a b 2 k − 1 + b 2 k )
c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c □
In this case a = 9 and b = 4
9 + 4 ∣ 9 n + 4 n
⟹ 1 3 ∣ 9 n + 4 n