On numbers with missing digits: solvability of the congruence x₁x₂ p
Let \(s\geq2\) and let \(0\in D\) be a set of \(k\leq s-2\) digits in the \(s\)-based number system. Denote by \(K_s^D(N)\) the set of integers \(n\leq N\) having all \(s\)-digits in \(D\). For prime \(p\) and \(\lambda\) prime to \(p\) the author considers the number \(T(M,N,p,\lambda)\) of solutions of the congruence \(x_1x_2\equiv\lambda\pmod p\) with \(M,N\) being large powers of \(s\) and \(x_1\in K_s^D(M)\), \(x_2\in K_s^D(N)\). He shows that it is asymptotic to \[ \tfrac1p\left| K_s^D(M)\right| \left| K_s^D(N)\right| , \] and a similar result holds for the congruence \[ x_0(x_1+\cdots+x_r)\equiv\lambda\pmod p \] in the case when \(D\) is an initial interval. The proofs are only sketched.
- On the multiplicative properties modulo \(m\) of numbers with missing digits
- On arithmetic properties of integers with missing digits. I: Distribution in residue classes
- On numbers with missing digits: an elementary proof of a result of S. V. Konyagin
- Integers With Digits 0 or 1
- On integers with missing digits: sum of digits and distribution in congruence classes
- On arithmetic properties of integers with missing digits. I: Distribution in residue classes
- On the multiplicative properties modulo \(m\) of numbers with missing digits
- Sums of a smooth number and a number with missing digits
- Integers With Digits 0 or 1
- On numbers with missing digits: an elementary proof of a result of S. V. Konyagin
This page was built for publication: On numbers with missing digits: solvability of the congruence \(x_1x_2\equiv \lambda \pmod p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477513)
