Posted by Maximillion Pegasus on Sunday, August 23, 2009 at 3:19pm.
Show that 27 x 23^n + 17 x 10^2n is divisible by 11 for all positive integers n. I know that modulos should aid in answering this problem,

Mathematics  bobpursley, Sunday, August 23, 2009 at 3:34pm
27= 2 mode 5
23= 2 mode 1
17= 1 mode 6
10^2n= 100^n
100= 1 mode 9
So the problem reduces to
5*1^n+6*1^n
=5+6
=11

Mathematics  bobpursley, Sunday, August 23, 2009 at 3:51pm
oops,typo error.
100=9 mode 1 the rest is correct.
Answer This Question
Related Questions
 discrete math  Find how many positive integers with exactly four decimal digits...
 Easy Math  The number of positive integers that are less than 500 and that are ...
 MATH  Let’s agree to say that a positive integer is primelike if it is not ...
 math  Let’s agree to say that a positive integer is primelike if it is not ...
 Discrete Mathematics  Suppose a0, a1, a2 ,... is a sequence defined recursively...
 Algebra ASAP  so this is a fill in on a worksheet and I am having difficulty as...
 Algebra  GIven any positive integers, show that at least two must exist whose ...
 Algebra  Joe picks 2 distinct numbers from the set of the first 14 positive ...
 Math  Use mathematical induction to prove that 2^(3n)  3^n is divisible by 5 ...
 maths  the non decreasing sequence of odd integers {a1, a2, a3, . . .} = {1,3,...
More Related Questions