My Math Forum Proof by Induction - Divisibility Proofs
 User Name Remember Me? Password

 Algebra Pre-Algebra and Basic Algebra Math Forum

September 19th, 2011, 08:59 AM   #1
Senior Member

Joined: Sep 2011

Posts: 395
Thanks: 0

Proof by Induction - Divisibility Proofs

Q. Prove by induction that... (see attachment)

Notes: For the line beginning "Show that n = k + 1..." I think I may have gone wrong in the calculation here, but I'm not exactly sure.
Thank you.
Attached Images
 photo (2).JPG (196.3 KB, 92 views)

 September 19th, 2011, 09:19 AM #2 Senior Member     Joined: Jul 2010 From: St. Augustine, FL., U.S.A.'s oldest city Posts: 12,204 Thanks: 511 Math Focus: Calculus/ODEs Re: Proof by Induction - Divisibility Proofs We need to prove by induction: $7^{2n+1}+1=8m$ where $n,m\in\mathbb N$ You have already shown the base case $P_1$ is valid. Thus, our induction hypothesis $P_k$ is: $7^{2k+1}+1=8m$ Let's add a multiple of 8 to each side: $$$7^2-1$$7^{2k+1}=8p$ $7^{2k+1}+1+$$7^2-1$$7^{2k+1}=8m+8p$ $7^{2(k+1)+1}+1=8(m+p)$ We have derived $P_{k+1}$ from $P_k$ completing the proof by induction.
 September 19th, 2011, 10:20 AM #3 Senior Member   Joined: Sep 2011 Posts: 395 Thanks: 0 Re: Proof by Induction - Divisibility Proofs Thank you for the help. Much obliged.

 Tags divisibility, induction, proof, proofs

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post jstarks4444 Number Theory 8 October 31st, 2011 02:18 PM bilano99 Algebra 5 September 25th, 2011 08:21 PM bilano99 Algebra 3 September 22nd, 2011 12:50 PM bilano99 Algebra 4 September 21st, 2011 02:47 PM bilano99 Algebra 3 September 15th, 2011 05:40 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top