Strong arithmetic property of certain Stern polynomials

From MaRDI portal



Abstract: Let Bn(t) be the nth Stern polynomial, i.e., the nth term of the sequence defined recursively as B0(t)=0,B1(t)=1 and B2n(t)=tBn(t),B2n+1(t)=Bn(t)+Bn−1(t) for ninN. It is well know that ith coefficient in the polynomial Bn(t) counts the number of hyperbinary representations of n−1 containing exactly i digits 1. In this note we investigate the existence of odd solutions of the congruence �egin{equation*} B_{n}(t)equiv 1+rtfrac{t^{e(n)}-1}{t-1}pmod{m}, end{equation*} where minNgeq2 and rin0,ldots,m−1 are fixed and e(n)=opdegBn(t). We prove that for m=2 and rin0,1 and for m=3 and r=0, there are infinitely many odd numbers n satisfying the above congruence. We also present results of some numerical computations.












This page was built for publication: Strong arithmetic property of certain Stern polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969030)