benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Compute the product of all positive integers b≥2 for which the base b number 111111_(b) has exactly b distinct prime divisors.

Problem

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

problem

Compute the product of all positive integers b≥2b \geq 2 for which the base bb number 111111b111111_{b} has exactly bb distinct prime divisors.
Plain-text mathematical notation (without MathML)
Compute the product of all positive integers b≥2 for which the base b number 111111_(b) has exactly b distinct prime divisors.
Original LaTeX notation
Compute the product of all positive integers $b \geq 2$ for which the base $b$ number $111111_{b}$ has exactly $b$ distinct prime divisors.

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
3681458d-cb86-5173-b24e-eaa6e872cc78
task_key
test--3681458d-cb86-5173-b24e-eaa6e872cc78
task_revision_id
1
config / split
/ test

Official source

initial import