Benchmark AI / Public workspace

OlympiadBench / 1709 / For each positive integer k, let t(k) be the largest odd divisor of k.…

Problem

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

answer type

Numerical

is multiple answer

true

language

English

question

For each positive integer kk, let t(k)t(k) be the largest odd divisor of kk. Determine all positive integers aa for which there exists a positive integer nn such that all the differences t(n+a)t(n),t(n+a+1)t(n+1),,t(n+2a1)t(n+a1) t(n+a)-t(n), \quad t(n+a+1)-t(n+1), \quad \ldots, \quad t(n+2 a-1)-t(n+a-1) are divisible by 4 .
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 .
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), \quad t(n+a+1)-t(n+1), \quad \ldots, \quad t(n+2 a-1)-t(n+a-1)
$$

are divisible by 4 .

question type

Open-ended

subject

Math

Discussion

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.

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

Official source

initial import