Strong arithmetic property of certain Stern polynomials
From MaRDI portal
Abstract: Let be the th Stern polynomial, i.e., the th term of the sequence defined recursively as and for . It is well know that th coefficient in the polynomial counts the number of hyperbinary representations of containing exactly 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 and are fixed and . We prove that for and and for and , there are infinitely many odd numbers satisfying the above congruence. We also present results of some numerical computations.
Recommendations
- Properties of multivariate \(b\)-ary Stern polynomials
- The Leading Coefficients of Stern Polynomials
- q-Stern polynomials as numerators of continued fractions
- Stern polynomials as numerators of continued fractions
- A note on the arithmetic properties of Stern Polynomials
- scientific article; zbMATH DE number 6868097
- Stern polynomials
- Square classes and divisibility properties of Stern polynomials
- Stern polynomials and double-limit continued fractions
- Continued fractions and Stern polynomials
Cited in
(6)- Arithmetic properties of the sequence of degrees of Stern polynomials and related results
- On certain arithmetic properties of Stern polynomials
- Reciprocal Stern polynomials
- Continued fractions and polynomials related to hyperbinary representations
- The modular distribution of Stern's sequence
- A note on the arithmetic properties of Stern Polynomials
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)