document.write( "Question 1076171: R0: 3,6,9,12,15,18,21,...
\n" );
document.write( "R1: 1,4,7,10,13,16,19,...
\n" );
document.write( "R2: 2,5,8,11,14,17,20,...
\n" );
document.write( "a) Write down an expression for the value of the general term in each of the three prgressions. Show that the integer 1706836 lies in R1. I got R0:3n, R1:3n-2 and R2:3n-1. Then i did 3n-2=1706836 and showed that n=568946, so it lies in R1 and is the 568946th term in the series.
\n" );
document.write( "b) Use the Binomial Theorem to show that if x is a term in R1 or R2 then x^6 is in R1. This is the part i don't know how to work out. \n" );
document.write( "
Algebra.Com's Answer #690841 by KMST(5328)![]() ![]() You can put this solution on YOUR website! a) I agree with your expressions for the the general term in each of the three sequences. \n" ); document.write( "To show if any number belongs to one of them, \n" ); document.write( "I would just add digits, using module 9 clock arithmetic. The number belongs in the sequence that contains the final sum. \n" ); document.write( "If the ending sum is 0, 3, or 6, the number is divisible by 3, and belongs in R0. \n" ); document.write( "If it is 1, 4, or 7, it belongs in R1; if 2,5, or 8, it belongs in R2. \n" ); document.write( "For \n" ); document.write( "the final \n" ); document.write( "The \n" ); document.write( "Then we are left with \n" ); document.write( "when \n" ); document.write( "So, \n" ); document.write( "and that shows that it belongs in R1. \n" ); document.write( " \n" ); document.write( "HOW AND WHY CLOCK ARITHMETIC MOD 9 WORKS: \n" ); document.write( "The sum of the digits of a number divisible by 9 is 9 or a multiple of 9. \n" ); document.write( "As you are adding, \n" ); document.write( "you drop partial sums that are 9, and keep adding the rest of the digits. \n" ); document.write( "Similarly, for any partial two-digit sum, \n" ); document.write( "you replace the sum of the digits for the two-digit partial sum. \n" ); document.write( "At the end, you should have a one-digit final sum from 0 to 8. \n" ); document.write( " \n" ); document.write( "b)The numbers in R1 and R2 are \n" ); document.write( "We could write them all as \n" ); document.write( ". \n" ); document.write( "(If you - or your teacher - do not like that expression, you could use \n" ); document.write( " \n" ); document.write( "and \n" ); document.write( "and write twice as much for your proof). \n" ); document.write( "For \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "It should be obvious that all terms of that sum are multiples of \n" ); document.write( "except that \n" ); document.write( "and that shows that \n" ); document.write( " \n" ); document.write( "If your teacher insisted on seeing the \n" ); document.write( "you would have to write more, starting with getting out \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |