benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A positive integer n is loose if it has six positive divisors and satisfies the property that any two positive divisors a<b of n satisfy b≥2a. Compute the sum of all loose positive…

Problem

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

problem

A positive integer nn is loose if it has six positive divisors and satisfies the property that any two positive divisors a<ba<b of nn satisfy b≥2ab \geq 2 a. Compute the sum of all loose positive integers less than 100.
Plain-text mathematical notation (without MathML)
A positive integer n is loose if it has six positive divisors and satisfies the property that any two positive divisors a<b of n satisfy b≥2a. Compute the sum of all loose positive integers less than 100.
Original LaTeX notation
A positive integer $n$ is loose if it has six positive divisors and satisfies the property that any two positive divisors $a<b$ of $n$ satisfy $b \geq 2 a$. Compute the sum of all loose positive integers less than 100.

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
2519c7d7-488b-5e2a-b8c5-d3d41e0274a9
task_key
test--2519c7d7-488b-5e2a-b8c5-d3d41e0274a9
task_revision_id
1
config / split
/ test

Official source

initial import