This is the problem which i'm currently stuck on, and I've been told to use principles based on mod, congruence equations and Fermat's theorum:

Show that 27 * 23^n + 17 * 10^2n is divisible by 11 for all positive integersn

Printable View

- Oct 10th 2007, 07:09 PMedwardteo.368Congruences
This is the problem which i'm currently stuck on, and I've been told to use principles based on mod, congruence equations and Fermat's theorum:

Show that 27 * 23^n + 17 * 10^2n is divisible by 11 for all positive integers*n* - Oct 10th 2007, 08:51 PMSoroban
Hello, edwardteo.368!

Quote:

Show that is divisible by 11 for all positive integers

Let:

We have: .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

Therefore, is a multiple of 11.

- Oct 10th 2007, 08:59 PMedwardteo.368
thnx for the help