benchmarks.wiki / Public workspace
Omni-MATH / Let D_(n) be the set of divisors of n. Find all natural n such that it is possible to split D_(n) into two disjoint sets A and G, both containing at least three elements each, such…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Let be the set of divisors of . Find all natural such that it is possible to split into two disjoint sets and , both containing at least three elements each, such that the elements in form an arithmetic progression while the elements in form a geometric progression.
Plain-text mathematical notation (without MathML)
Let D_(n) be the set of divisors of n. Find all natural n such that it is possible to split D_(n) into two disjoint sets A and G, both containing at least three elements each, such that the elements in A form an arithmetic progression while the elements in G form a geometric progression.
Original LaTeX notation
Let $D_n$ be the set of divisors of $n$. Find all natural $n$ such that it is possible to split $D_n$ into two disjoint sets $A$ and $G$, both containing at least three elements each, such that the elements in $A$ form an arithmetic progression while the elements in $G$ form a geometric progression.
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import