\n" );
document.write( "Use mathematical induction to prove each statement is true for all positive integers n:
\n" );
document.write( "5^(n)-1 is divisible by 4
\n" );
document.write( "n^(2)-n is divisible by 2
\n" );
document.write( "==================\r
\n" );
document.write( "\n" );
document.write( "n|d means \"n divides d\"\r
\n" );
document.write( "\n" );
document.write( "n=0:
, 4 | 0
\n" );
document.write( "n=1:
, 4 | 4\r
\n" );
document.write( "\n" );
document.write( "Assume true for n=k: i.e.
|
(hypothesis)\r
\n" );
document.write( "\n" );
document.write( "Let n=k+1:
\n" );
document.write( "
\n" );
document.write( "=
\n" );
document.write( "= 
\n" );
document.write( "=
\r
\n" );
document.write( "\n" );
document.write( "4 |
(by the hypothesis) so
|
as well.\r
\n" );
document.write( "\n" );
document.write( "Therefore,
|
(if 4|P then 4|(P+4))
\n" );
document.write( "and the proof is complete.\r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "======\r
\n" );
document.write( "\n" );
document.write( "The other proof does not require induction
is always even, which is divisible by 2. Follow the steps I did in first problem if you must have a proof by induction (show true for base case, assume hypothesis (n=k), and then show it leads to truth of the step case where n=k+1)\r
\n" );
document.write( "
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "
\n" );
document.write( "