benchmarks.wiki / Public workspace
Omni-MATH / Call a sequence of positive integers {a_(n)} good if for any distinct positive integers m,n, one has gcd(m,n)∣a_(m)²+a_(n)² and gcd(a_(m),a_(n))∣m²+n². Call a positive integer a to…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Call a sequence of positive integers good if for any distinct positive integers , one has
Call a positive integer to be -good if there exists a good sequence such that . Does there exists a such that there are exactly -good positive integers?
Plain-text mathematical notation (without MathML)
Call a sequence of positive integers {a_(n)} good if for any distinct positive integers m,n, one has
gcd(m,n)∣a_(m)²+a_(n)² and gcd(a_(m),a_(n))∣m²+n².
Call a positive integer a to be k-good if there exists a good sequence such that a_(k)=a. Does there exists a k such that there are exactly 2019 k-good positive integers?Original LaTeX notation
Call a sequence of positive integers $\{a_n\}$ good if for any distinct positive integers $m,n$, one has
$$\gcd(m,n) \mid a_m^2 + a_n^2 \text{ and } \gcd(a_m,a_n) \mid m^2 + n^2.$$
Call a positive integer $a$ to be $k$-good if there exists a good sequence such that $a_k = a$. Does there exists a $k$ such that there are exactly $2019$ $k$-good positive integers?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