benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let A be a set of integers such that for each integer m, there exists an integer a∈A and positive integer n such that a^{n} equiv m(bmod 100). What is the smallest possible value o…

Problem

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

problem

Let AA be a set of integers such that for each integer mm, there exists an integer a∈Aa \in A and positive integer nn such that $a^{n} \equiv m(\bmod 100)$. What is the smallest possible value of |A||A|?
Plain-text mathematical notation (without MathML)
Let A be a set of integers such that for each integer m, there exists an integer a∈A and positive integer n such that $a^{n} \equiv m(\bmod 100)$. What is the smallest possible value of |A|?
Original LaTeX notation
Let $A$ be a set of integers such that for each integer $m$, there exists an integer $a \in A$ and positive integer $n$ such that $a^{n} \equiv m(\bmod 100)$. What is the smallest possible value of $|A|$?

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

task_id
a59f22f1-0b0d-5680-a4fc-401a103ab691
task_key
test--a59f22f1-0b0d-5680-a4fc-401a103ab691
task_revision_id
1
config / split
/ test

Official source

initial import