benchmarks.wiki / Public workspace

MATH / If n is an integer, such that 2≤n≤2010, for how many values of n is left(1 + frac 12 right)left(1 + frac 13 right) dotsm left(1 + frac 1n right) equal to a positive integer?

Problem

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

problem

If nn is an integer, such that 2≤n≤20102 \le n \le 2010, for how many values of nn is $\left(1 + \frac 12 \right)\left(1 + \frac 13 \right) \dotsm \left(1 + \frac 1n \right)$ equal to a positive integer?
Plain-text mathematical notation (without MathML)
If n is an integer, such that 2≤n≤2010, for how many values of n is $\left(1 + \frac 12 \right)\left(1 + \frac 13 \right) \dotsm \left(1 + \frac 1n \right)$ equal to a positive integer?
Original LaTeX notation
If $n$ is an integer, such that $2 \le n \le 2010$, for how many values of $n$ is $\left(1 + \frac 12 \right)\left(1 + \frac 13 \right) \dotsm \left(1 + \frac 1n \right)$ equal to a positive integer?

level

Level 3

type

Intermediate Algebra

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

Official source

initial import