benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let a positive integer n be called a cubic square if there exist positive integers a,b with n=gcd(a²,b³). Count the number of cubic squares between 1 and 100 inclusive.

Problem

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

problem

Let a positive integer nn be called a cubic square if there exist positive integers a,ba, b with n=gcd(a2,b3)n=\operatorname{gcd}\left(a^{2}, b^{3}\right). Count the number of cubic squares between 1 and 100 inclusive.
Plain-text mathematical notation (without MathML)
Let a positive integer n be called a cubic square if there exist positive integers a,b with n=gcd(a²,b³). Count the number of cubic squares between 1 and 100 inclusive.
Original LaTeX notation
Let a positive integer \(n\) be called a cubic square if there exist positive integers \(a, b\) with \(n=\operatorname{gcd}\left(a^{2}, b^{3}\right)\). Count the number of cubic squares between 1 and 100 inclusive.

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
4f5187c4-bb09-58f1-9b29-2e09e3bd9a71
task_key
test--4f5187c4-bb09-58f1-9b29-2e09e3bd9a71
task_revision_id
1
config / split
/ test

Official source

initial import