Oct 2026· Communications in Contemporary Mathematics· 0 citations
Abstract
Let [Formula: see text] and [Formula: see text], [Formula: see text]. Let also [Formula: see text].
We prove that every sufficiently large odd integer [Formula: see text] can be represented in the form [Formula: see text] where [Formula: see text] for [Formula: see text], [Formula: see text] for [Formula: see text] and the decimal expansion of [Formula: see text] does not contain the digit [Formula: see text].
Using a transference argument, we obtain an unconditional result and enlarge the admissible range of [Formula: see text] beyond that previously obtained by Maier and Rassias under the Generalized Riemann Hypothesis.
Let [Formula: see text] and [Formula: see text] denote the largest and smallest prime factors of [Formula: see text], respectively. Let [Formula: see text], [Formula: see text]. For sufficiently large [Formula: see text], we show that there exists a strictly positive constant [Formula: see text] such that [Formula: see...
Zhi-Yuan Yang· International Journal of Num...· 0 citations
Let [Formula: see text] be a prime and [Formula: see text] be the polynomial, where [Formula: see text] runs over the quadratic residues modulo [Formula: see text]. In this paper, we establish an explicit formula for evaluating [Formula: see text] at an arbitrary root of unity [Formula: see text] utilizing the special...
Wei Wang· International Journal of Num...· 0 citations
Let [Formula: see text] be a Steinhaus random multiplicative function and let [Formula: see text] be a finite set of integers. We show that convergence of [Formula: see text] to a standard complex normal distribution forces [Formula: see text]. We prove that this zero-density condition is sharp: For most sets [Formula:...
M. Xu· Proceedings of the National...· 0 citations
Let [Formula: see text] be a prime number and [Formula: see text] finite field. Let [Formula: see text] be a finite chain ring, and let [Formula: see text], where [Formula: see text]. and [Formula: see text]. In this paper, we study [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see...
Youssef Ahendouz, I. Akharraz· Discrete Mathematics, Algori...· 0 citations
Let [Formula: see text] be a finite chain with [Formula: see text] elements [Formula: see text], and let [Formula: see text] be the semigroup of all either orientation-preserving or orientation-reversing injective partial transformations of [Formula: see text]. In this paper, for any nonempty subset [Formula: see text]...
De-Biao Li· Asian-European Journal of Ma...· 0 citations
Given any [Formula: see text] define the binomial sum [Formula: see text] A fundamental question regarding the binomial sum is to understand its [Formula: see text]-adic valuation. While the case [Formula: see text] has been completely resolved in recent work, it was conjectured for [Formula: see text] that the valuati...
S. Dhillon, Valentio Iverson, Shanta Laishram· International Journal of Num...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.