Divisible By .....

is always divisible by ?

5 6 8 9

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.

2 solutions

Mathh Mathh
Aug 23, 2014

The fact holds n N 0 \forall n\in\mathbb N_0 , and it should be specified.


Proof by induction:

For n = 0 n=0 , the expression is equal to 9 9 . Assume k k satisfies the given fact. Then we know:

5^{2n}\equiv 6n-8\equiv 6n+1\pmod 9\tag{1}

Now let us prove k + 1 k+1 satisfies the fact:

5 2 ( n + 1 ) 6 ( n + 1 ) + 8 = 25 5 2 n 6 n + 2 ( 1 ) 25 ( 6 n + 1 ) 6 n + 2 5^{2(n+1)}-6(n+1)+8= 25\cdot 5^{2n}-6n+2\stackrel{(1)}\equiv 25\cdot (6n+1) - 6n +2

7 ( 6 n + 1 ) + 3 n + 2 42 n + 7 + 3 n + 2 45 n + 9 0 ( m o d 9 ) \equiv 7(6n+1)+3n+2\equiv 42n+7+3n+2\equiv 45n+9\equiv 0\pmod 9\square

whoa nice solution i just substituted 1

Mardokay Mosazghi - 6 years, 9 months ago

Same method. It's just that the MCQ options have made the question so underrated. Had it been a subjective answer it would have been lvl3 or at least 2.

Satyajit Ghosh - 5 years, 8 months ago
Bhaskar Agrawal
Dec 2, 2014

put value of n =1 then its 5^{2} - 6 + 8 = 27 which is divisible by 9....

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...