MathDB
Combinatorial functional equation

Source: 2024 Taiwan TST Round 3 Independent Study 1-N

April 24, 2024
Taiwan TSTTaiwancombinatoricsFunctional Equations

Problem Statement

For each positive integer kk, define r(k)r(k) as the number of runs of kk in base-22, where a run is a collection of consecutive 00s or consecutive 11s without a larger one containing it. For example, (11100100)2(11100100)_2 has 44 runs, namely 11100100111-00-1-00. Also, r(0)=0r(0) = 0. Given a positive integer nn, find all functions f:ZZf : \mathbb{Z} \rightarrow\mathbb{Z} such that k=02n12r(k)f(k+(1)kx)=(1)x+n for all integer x.\sum_{k=0}^{2^n-1} 2^{r(k)}f(k+(-1)^{k} x)=(-1)^{x+n}\text{ for all integer $x$.}
Proposed by YaWNeeT