benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Define ϕ^(!)(n) as the product of all positive integers less than or equal to n and relatively prime to n. Compute the number of integers 2≤n≤50 such that n divides ϕ^(!)(n)+1.

Problem

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

problem

Define ϕ!(n)\phi^{!}(n) as the product of all positive integers less than or equal to nn and relatively prime to nn. Compute the number of integers 2≤n≤502 \leq n \leq 50 such that nn divides ϕ!(n)+1\phi^{!}(n)+1.
Plain-text mathematical notation (without MathML)
Define ϕ^(!)(n) as the product of all positive integers less than or equal to n and relatively prime to n. Compute the number of integers 2≤n≤50 such that n divides ϕ^(!)(n)+1.
Original LaTeX notation
Define $\phi^{!}(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the number of integers $2 \leq n \leq 50$ such that $n$ divides $\phi^{!}(n)+1$.

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
bcd97221-87cd-5997-b4fa-a3b1d52e1093
task_key
test--bcd97221-87cd-5997-b4fa-a3b1d52e1093
task_revision_id
1
config / split
/ test

Official source

initial import