benchmarks.wiki / Public workspace

Omni-MATH / For positive integers a,b,a↑↑b is defined as follows: a↑↑1=a, and a↑↑b=a^(a↑↑(b−1)) if b>1. Find the smallest positive integer n for which there exists a positive integer a such th…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

For positive integers a,b,a↑↑ba, b, a \uparrow \uparrow b is defined as follows: a↑↑1=aa \uparrow \uparrow 1=a, and a↑↑b=aa↑↑(b−1)a \uparrow \uparrow b=a^{a \uparrow \uparrow(b-1)} if b>1b>1. Find the smallest positive integer nn for which there exists a positive integer aa such that $a \uparrow \uparrow 6 \not \equiv a \uparrow \uparrow 7$ $\bmod n$.
Plain-text mathematical notation (without MathML)
For positive integers a,b,a↑↑b is defined as follows: a↑↑1=a, and a↑↑b=a^(a↑↑(b−1)) if b>1. Find the smallest positive integer n for which there exists a positive integer a such that $a \uparrow \uparrow 6 \not \equiv a \uparrow \uparrow 7$ $\bmod n$.
Original LaTeX notation
For positive integers $a, b, a \uparrow \uparrow b$ is defined as follows: $a \uparrow \uparrow 1=a$, and $a \uparrow \uparrow b=a^{a \uparrow \uparrow(b-1)}$ if $b>1$. Find the smallest positive integer $n$ for which there exists a positive integer $a$ such that $a \uparrow \uparrow 6 \not \equiv a \uparrow \uparrow 7$ $\bmod n$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import