Benchmark AI / Public workspace

OlympiadBench / 1736 / Find the least positive integer n for which there exists a set …

Problem

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

answer type

Numerical

is multiple answer

false

language

English

question

Find the least positive integer nn for which there exists a set {s1,s2,,sn}\left\{s_{1}, s_{2}, \ldots, s_{n}\right\} consisting of nn distinct positive integers such that (11s1)(11s2)(11sn)=512010 \left(1-\frac{1}{s_{1}}\right)\left(1-\frac{1}{s_{2}}\right) \ldots\left(1-\frac{1}{s_{n}}\right)=\frac{51}{2010}
Plain-text mathematical notation (without MathML)
Find the least positive integer n for which there exists a set {s₁,s₂,…,s_(n)} consisting of n distinct positive integers such that

(1−(1)/(s₁))(1−(1)/(s₂))…(1−(1)/(s_(n)))=(51)/(2010)
Original LaTeX notation
Find the least positive integer $n$ for which there exists a set $\left\{s_{1}, s_{2}, \ldots, s_{n}\right\}$ consisting of $n$ distinct positive integers such that

$$
\left(1-\frac{1}{s_{1}}\right)\left(1-\frac{1}{s_{2}}\right) \ldots\left(1-\frac{1}{s_{n}}\right)=\frac{51}{2010}
$$

question type

Open-ended

subject

Math

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import