benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / Let n be the smallest composite number such that it can be written as the product of two positive integers that differ by 10. How many distinct prime factors does n have?

Problem

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

problem

Let nn be the smallest composite number such that it can be written as the product of two positive integers that differ by 10. How many distinct prime factors does nn have?
Plain-text mathematical notation (without MathML)
Let n be the smallest composite number such that it can be written as the product of two positive integers that differ by 10.  How many distinct prime factors does n have?
Original LaTeX notation
Let $n$ be the smallest composite number such that it can be written as the product of two positive integers that differ by 10.  How many distinct prime factors does $n$ have?

level

Level 3

type

Prealgebra

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
f6a8a190-f83f-5bab-a2b5-6af6092512b2
task_key
prealgebra--test--f6a8a190-f83f-5bab-a2b5-6af6092512b2
task_revision_id
1
config / split
prealgebra / test

Official source

initial import