login
a(n) = googolplex (mod n).
3

%I #13 Feb 16 2025 08:32:45

%S 0,0,1,0,0,4,4,0,1,0,1,4,3,4,10,0,1,10,9,0,4,12,13,16,0,16,10,4,24,10,

%T 5,0,1,18,25,28,10,28,16,0,1,4,24,12,10,36,9,16,4,0,1,16,46,10,45,32,

%U 28,24,48,40,47,36,46,0,55,34,10,52,13,60,45,64,1,10,25,28,67,16,52,0

%N a(n) = googolplex (mod n).

%C A googolplex is 10^(10^100). a(n) = 0 iff n = 2^a * 5^b, a, b >= 0 (A003592).

%H Daniel Starodubtsev, <a href="/A067007/b067007.txt">Table of n, a(n) for n = 1..10000</a>

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Googolplex.html">Googolplex</a>

%t Table[ PowerMod[10, 10^100, n], {n, 2, 50}]

%Y Cf. A066298.

%K nonn,changed

%O 1,6

%A _Ed Pegg Jr_, Nov 20 2002

%E Edited by _Robert G. Wilson v_, Nov 23 2002