benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Compute the number of integers n∈{1,2,…,300} such that n is the product of two distinct primes, and is also the length of the longest leg of some nondegenerate right triangle with …

Problem

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

problem

Compute the number of integers n∈{1,2,…,300}n \in\{1,2, \ldots, 300\} such that nn is the product of two distinct primes, and is also the length of the longest leg of some nondegenerate right triangle with integer side lengths.
Plain-text mathematical notation (without MathML)
Compute the number of integers n∈{1,2,…,300} such that n is the product of two distinct primes, and is also the length of the longest leg of some nondegenerate right triangle with integer side lengths.
Original LaTeX notation
Compute the number of integers \(n \in\{1,2, \ldots, 300\}\) such that \(n\) is the product of two distinct primes, and is also the length of the longest leg of some nondegenerate right triangle with integer side lengths.

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
003e8a93-3901-551a-ba47-415a4fadb150
task_key
test--003e8a93-3901-551a-ba47-415a4fadb150
task_revision_id
1
config / split
/ test

Official source

initial import