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
Follow Math Help Forum on Facebook and Google+
Hello, edwardteo.368! Show that is divisible by 11 for all positive integers Let: We have: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Therefore, is a multiple of 11.
thnx for the help
View Tag Cloud