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. · Discussion

Discussing 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. · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.