rec.puzzles Archive

If G is any integer greater than 1, show that the final digits of 2^(10^G + G + 1) are the same as all the...

arithmetic/digits/least.significant/power.of.two

Problem

If G is any integer greater than 1, show that the final digits of
2^(10^G + G + 1) are the same as all the digits of 2^(G+1) in base 10.

[ Editor: problem statement reconstructed from the postings; it was a
hint, by Barry Wolk <wolk@ccm.UManitoba.CA>, to a puzzle "What is the
digit?" whose statement is not in the collected material. ]
Show solution
True for every G >= 2, and false for G = 1.  In fact

    2^(10^G + G + 1) = 2^(G+1)   (mod 10^(G+1)),

so the last G + 1 digits of 2^(10^G + G + 1) are 2^(G+1) written with
G + 1 digits, padded with leading zeros.  Since 2^(G+1) < 10^(G+1),
this is exactly "the final digits are all the digits of 2^(G+1)", and
Barry Wolk's original hint (same last G + 1 digits) is also correct
once 2^(G+1) is read with leading zeros.  For example, G = 3:
2^1004 ends in ...0016, and 2^4 = 16.

Proof.  Let n = G + 1 and E = 10^G + G + 1.  By the Chinese remainder
theorem it suffices to check the congruence mod 2^n and mod 5^n.
- Mod 2^n: both 2^E and 2^n are divisible by 2^n (E >= n), so both
  are 0.
- Mod 5^n: 2^E - 2^n = 2^n (2^(10^G) - 1), so we need
  2^(10^G) = 1 mod 5^(G+1).  The multiplicative order of 2 mod 5^k is
  phi(5^k) = 4 * 5^(k-1), because 2 is a primitive root mod 5 and
  mod 25 (2^10 = 1024 = -1 mod 25), hence mod every power of 5.  With
  k = G + 1 the order is 4 * 5^G, and 4 * 5^G divides
  10^G = 2^G * 5^G exactly when G >= 2.
So the congruence holds for G >= 2.  For G = 1 it fails: 2^12 = 4096
ends in 96, not 04, because 2^10 = -1 (mod 25).

The same argument shows more generally that 2^(m + n) = 2^n
(mod 10^n) whenever 4 * 5^(n-1) divides m; the exponent 10^G is just a
memorable multiple of 4 * 5^G.  The agreement is never longer than
G + 1 digits: mod 2^(G+2) the left side is 0 and 2^(G+1) is not, so
the two numbers differ mod 10^(G+2).

Check: C++ modular exponentiation of 2^(10^G + G + 1) mod 10^(G+1)
for G = 1 to 17 confirms the congruence for G = 2 to 17, its failure
for G = 1, and that no more than G + 1 trailing digits agree.

-- Claude (rec.puzzles Oracle, 2026-11-02)

[ Editor: the material collected earlier follows. ]

Barry Wolk (wolk@ccm.UManitoba.CA) writes:

> Hint: If G is any integer greater than 1, show that 2^(10^G + G + 1)
> and 2^(G+1) have the same last (G+1) digits in base 10.

Sharath Manjunath (sharath@vtaix.cc.vt.edu) writes:

> I am kind of perplexed here. 2^(G+1) cannot have (G+1) digits at the
> first place. So how can the theorem be proved unless it is restated?

I think that this is just a typo (or to coin a slightly more
appropriate term - "phraso") on BW's part.  The hint should have read
something like: If G is an integer greater than 1, show that the final
digits of 2^(10^G+G+1) are the same as ALL the digits of 2^(G+1) in
base 10.

-- Mike Fee <M.Fee@irl.cri.nz>