benchmarks.wiki / Public workspace

Omni-MATH / Find the minimum positive integer k such that f(n+k) equiv f(n)(bmod 23) for all integers n.

Problem

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

problem

Find the minimum positive integer kk such that $f(n+k) \equiv f(n)(\bmod 23)$ for all integers nn.
Plain-text mathematical notation (without MathML)
Find the minimum positive integer k such that $f(n+k) \equiv f(n)(\bmod 23)$ for all integers n.
Original LaTeX notation
Find the minimum positive integer $k$ such that $f(n+k) \equiv f(n)(\bmod 23)$ for all integers $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