MathDB

6

Part of PEN D Problems

Problems(1)

D 6

Source:

5/25/2007
Show that, for any fixed integer  n≥1, \,n \geq 1,\, the sequence 2,  22,  222,  2222,⋯(modn)2, \; 2^{2}, \; 2^{2^{2}}, \; 2^{2^{2^{2}}}, \cdots \pmod{n} is eventually constant.
modular arithmeticinductionEulersearchCongruences