benchmarks.wiki / Public workspace

Omni-MATH / For each positive integer k, let t(k) be the largest odd divisor of k. Determine all positive integers a for which there exists a positive integer n, such that all the differences …

Problem

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

problem

For each positive integer k,k, let t(k)t(k) be the largest odd divisor of k.k. Determine all positive integers aa for which there exists a positive integer n,n, such that all the differences t(n+a)−t(n);t(n+a+1)−t(n+1),…,t(n+2a−1)−t(n+a−1)t(n+a)-t(n); t(n+a+1)-t(n+1), \ldots, t(n+2a-1)-t(n+a-1) are divisible by 4. [i]
Plain-text mathematical notation (without MathML)
For each positive integer k, let t(k) be the largest odd divisor of k. Determine all positive integers a for which there exists a positive integer n, such that all the differences

t(n+a)−t(n);t(n+a+1)−t(n+1),…,t(n+2a−1)−t(n+a−1) are divisible by 4.

[i]
Original LaTeX notation
For each positive integer $k,$ let $t(k)$ be the largest odd divisor of $k.$ Determine all positive integers $a$ for which there exists a positive integer $n,$ such that all the differences

\[t(n+a)-t(n); t(n+a+1)-t(n+1), \ldots, t(n+2a-1)-t(n+a-1)\] are divisible by 4.

[i]

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

Official source

initial import