document.write( "Question 389515: Let a_n = 11...1 with 3^n digits. Prove that a_n is divisible by 3a_(n-1). \n" ); document.write( "
Algebra.Com's Answer #276061 by richard1234(7193)\"\" \"About 
You can put this solution on YOUR website!
We have\r
\n" ); document.write( "\n" ); document.write( "\"a%5B0%5D+=+1\"
\n" ); document.write( "\"a%5B1%5D+=+111\"
\n" ); document.write( "\"a%5B2%5D+=+111111111\", etc.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Proceed by induction. The base case n = 1 works, as 111 is divisible by 3. \r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "For some \"k+%3E=+0\",\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%5D+=+%2810%5E%283%5Ek%29+-+1%29%2F9\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Then, for k+1,\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+%2810%5E%283%5E%28k%2B1%29%29+-+1%29%2F9\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "It suffices to show that \"a%5Bk%2B1%5D%2F%283a%5Bk%5D%29\" is an integer. Substituting \"a%5Bk%2B1%5D%7D%7D+and+%7B%7B%7Ba%5Bk%5D\", we obtain:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"%2810%5E%283%5E%28k%2B1%29%29+-+1%29%2F%283%2A%2810%5E%283%5Ek%29-1%29%29\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Letting \"z+=+10%5E%283%5Ek%29-1\", we have\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Rearrange the terms:\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The last term is equivalent to the numerator in the fraction we wish to prove is an integer. Therefore, we can substitute this expression and obtain\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"%28z%5E3+-+3%2A%2810%5E%283%5Ek%29%29%2Az%29%2F3z\" (we are trying to prove this is an integer for all k)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Cancel out z from both sides to get\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"%28z%5E2+-+3%2A%2810%5E%283%5Ek%29%29%29%2F3\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "It now suffices to prove that the numerator is divisible by 3, which happens if and only if \"z%5E2\" is divisible by 3. However, we already know that \"z+=+10%5E%283%5Ek%29+-+1\" which is divisible by 3, since all powers of 10 are 1 modulo 3 (therefore subtracting 1 makes it 0 mod 3, i.e. divisible by 3). Hence, the expression is an integer, and we are done.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "This is a somewhat lengthy proof, but rigorous proofs are sometimes more efficient and strong in terms of explaining their points. You'll definitely see proofs like this in contests like USAMO, IMO, and Putnam.
\n" ); document.write( "
\n" );