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.
The fact holds ∀ n ∈ N 0 , and it should be specified.
Proof by induction:
For n = 0 , the expression is equal to 9 . Assume 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 satisfies the fact:
5 2 ( n + 1 ) − 6 ( n + 1 ) + 8 = 2 5 ⋅ 5 2 n − 6 n + 2 ≡ ( 1 ) 2 5 ⋅ ( 6 n + 1 ) − 6 n + 2
≡ 7 ( 6 n + 1 ) + 3 n + 2 ≡ 4 2 n + 7 + 3 n + 2 ≡ 4 5 n + 9 ≡ 0 ( m o d 9 ) □