Hyperexponentiation

Problem Statement

The hyperexponentiation or tetration of a number $a$ by a positive integer $b$, denoted by $a\mathbin{\uparrow \uparrow}b$ or $^b a$, is recursively defined by:

$a \mathbin{\uparrow \uparrow} 1 = a$,
$a \mathbin{\uparrow \uparrow} (k+1) = a^{(a \mathbin{\uparrow \uparrow} k)}$.

Thus we have e.g. $3 \mathbin{\uparrow \uparrow} 2 = 3^3 = 27$, hence $3 \mathbin{\uparrow \uparrow} 3 = 3^{27} = 7625597484987$ and $3 \mathbin{\uparrow \uparrow} 4$ is roughly $10^{3.6383346400240996 \cdot 10^{12}}$.

Find $(3^N \mathbin{\uparrow \uparrow} 3^N) \bmod 10^{16}$.

Submit Answers

You need to submit in the format: "N:problem(N)", possibly with multiple values at once, separated by commas, with $N$ between $1$ and $100$.

Top Users

🥇 liuguangxi
100.00 (100)
🥈 shs10978
100.00 (100)
🥉 Nondegon
100.00 (100)
4 icy
100.00 (100)
5 CandynightJ
1.00 (1)
6 jonnytang
1.00 (1)
7 mmtg
1.00 (1)

Data

Stats

Your submissions will appear here

Recent Submissions

1
Nondegon
$g(100)$, $16$ digits 2 weeks ago
2
Nondegon
$g(99)$, $16$ digits 2 weeks ago
3
Nondegon
$g(98)$, $16$ digits 2 weeks ago
4
Nondegon
$g(97)$, $16$ digits 2 weeks ago
5
Nondegon
$g(96)$, $16$ digits 2 weeks ago