Menu Close

prove-that-6-n-6-mod-10-for-any-n-Z-




Question Number 76228 by arkanmath7@gmail.com last updated on 25/Dec/19
prove that 6^n  ≡ 6 (mod 10), for any n ∈ Z^( +)
provethat6n6(mod10),foranynZ+
Commented by turbo msup by abdo last updated on 25/Dec/19
⇔6^n −6 ≡0[10] ⇔ 10 divide 6^n −6  let x_n =6^n −6  by recurrence  n=1  x_1 =6−6=0  (true)  let suppose  x_n  divided by 10 and  x_(n+1) =6^(n+1) −6 =6^n .6−6  x_n =10k ⇒x_(n+1) =(10k+6)6−6  =6×10k+30 =10(6k+3)≡0[20]
6n60[10]10divide6n6letxn=6n6byrecurrencen=1x1=66=0(true)letsupposexndividedby10andxn+1=6n+16=6n.66xn=10kxn+1=(10k+6)66=6×10k+30=10(6k+3)0[20]
Commented by abdomathmax last updated on 25/Dec/19
x_(n+1) ≡0[10]
xn+10[10]
Answered by Rio Michael last updated on 25/Dec/19
Lets prove by induction.  prove for n=1, 6^1  ≡ 6(mod 10)  as  6−6 = 0∣10  Asume for n = k⇒   6^k  ≡ 6(mod 10) ⇒ 10∣(6^k −6)  10∣(6^k −6) ⇒ ∃ m∈Z : 6^k −6 = 10m  prove for n = k+1   6^(k+1) ≡ 6^k .6^1 ≡ 6(mod 10)  6^k  = 10m + 6  6^(k+1)  ≡ (10m + 6)6  which is a multiple of 6  hence it is true for n = k+1  thus ∀n∈Z^+  6^n ≡6(mod 10)
Letsprovebyinduction.proveforn=1,616(mod10)as66=010Asumeforn=k6k6(mod10)10(6k6)10(6k6)mZ:6k6=10mproveforn=k+16k+16k.616(mod10)6k=10m+66k+1(10m+6)6whichisamultipleof6henceitistrueforn=k+1thusnZ+6n6(mod10)
Commented by arkanmath7@gmail.com last updated on 25/Dec/19
thnx
thnx

Leave a Reply

Your email address will not be published. Required fields are marked *