benchmarks.wiki / Public workspace

MATH / Suppose that *(n) = left{ n-2, n+2, 2n, frac{n}{2} right}. For example, *(6) = {4, 8, 12, 3}. For how many distinct integers n does *(n) have exactly three distinct elements?

Problem

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

problem

Suppose that $*(n) = \left\{ n-2, n+2, 2n, \frac{n}{2} \right\}$. For example, $*(6) = \{4, 8, 12, 3\}$. For how many distinct integers nn does $*(n)$ have exactly three distinct elements?
Plain-text mathematical notation (without MathML)
Suppose that $*(n) = \left\{ n-2, n+2, 2n, \frac{n}{2} \right\}$. For example, $*(6) = \{4, 8, 12, 3\}$. For how many distinct integers n does $*(n)$ have exactly three distinct elements?
Original LaTeX notation
Suppose that $*(n) = \left\{ n-2, n+2, 2n, \frac{n}{2} \right\}$. For example, $*(6) = \{4, 8, 12, 3\}$. For how many distinct integers $n$ does $*(n)$ have exactly three distinct elements?

level

Level 5

type

Counting & Probability

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