English
Related papers

Related papers: On the sequence $n! \bmod p$

200 papers

For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Sergei Konyagin , James Maynard , Carl Pomerance , Terence Tao

An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of…

Computational Complexity · Computer Science 2018-11-26 Nicollas M. Sdroievski , Murilo V. G. da Silva , André L. Vignatti

Let $\lambda$ be a fixed integer, $\lambda\ge 2.$ Let $s_n$ be any strictly increasing sequence of positive integers satisfying $s_n\le n^{15/14+o(1)}.$ In this paper we give a version of the large sieve inequality for the sequence…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

Number Theory · Mathematics 2007-05-23 Ernie Croot

A conjecture of Erd\H{o}s states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that,…

Number Theory · Mathematics 2024-02-16 Kaisa Matomäki , Joni Teräväinen

Let $\{\cdot\}$ denote the fractional part and $n \geq 1$ be a fixed integer. In this short note, we show for any prime $p$ the one-to-one correspondence $$\sum_{\nu \geq 1} \left\{\frac{n}{p^\nu}\right\} > 1 \quad \iff \quad p \mid…

Number Theory · Mathematics 2017-08-24 Bernd C. Kellner

Building upon the work of A. Booker and C. Pomerance (2017), we prove that for a prime power $q \geq 7$, every residue class modulo an irreducible polynomial $F \in \mathbb{F}_q[X]$ has a non-constant, square-free representative which has…

Number Theory · Mathematics 2022-01-28 Christian Bagshaw

Let b be an odd integer such that b=+/-1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (p(k)) is a sequence of odd primes, with 0<=k<=q-2 such that p(k)=2p(k-1)+b for all 1<=k<=q-2, then…

Number Theory · Mathematics 2009-08-20 Douglas S. Stones

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

Let $D$ be an open disk of radius $\le 1$ in $\mathbb C$, and let $(\epsilon_n)$ be a sequence of $\pm 1$. We prove that for every analytic function $f: D \to \mathbb C$ without zeros in $D$, there exists a unique sequence $(\alpha_n)$ of…

Number Theory · Mathematics 2012-04-05 Marcin Mazur , Bogdan V. Petrenko

We consider the distribution in residue classes modulo primes $p$ of Euler's totient function $\phi(n)$ and the sum-of-proper-divisors function $s(n):=\sigma(n)-n$. We prove that the values $\phi(n)$, for $n\le x$, that are coprime to $p$…

Number Theory · Mathematics 2021-05-28 Noah Lebowitz-Lockard , Paul Pollack , Akash Singha Roy

We show that for any $\varepsilon > 0$ and a sufficiently large cube-free $q$, any reduced residue class modulo $q$ can be represented as a product of $14$ integers from the interval $[1, q^{1/4e^{1/2} + \varepsilon}]$. The length of the…

Number Theory · Mathematics 2015-05-26 Glyn Harman , Igor E. Shparlinski

Let $q$ be an odd prime and $B = \{b_{j}\}_{j=1}^{l}$ be a finite set of nonzero integers that does not contain a perfect $q^{th}$ power. We show that $B$ has a $q^{th}$ power modulo every prime $p \neq q$ and not dividing $\prod_{b\in B}…

Number Theory · Mathematics 2023-06-19 Bhawesh Mishra

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

Combinatorics · Mathematics 2025-07-29 Christian Krattenthaler , Thomas W. Müller

For a prime $p$ and an integer $u$ with $\gcd(u,p)=1$, we define Fermat quotients by the conditions $$ q_p(u) \equiv \frac{u^{p-1} -1}{p} \pmod p, \qquad 0 \le q_p(u) \le p-1. $$ D. R. Heath-Brown has given a bound of exponential sums with…

Number Theory · Mathematics 2014-02-26 Igor E. Shparlinski

We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+\psi(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound…

Number Theory · Mathematics 2013-11-28 Sergei V. Konyagin , Igor E. Shparlinski

In this article we consider the completely multiplicative sequences $(a_n)_{n \in \mathbf{N}}$ defined on a field $\mathbf{K}$ and satisfying $$\sum_{p| p \leq n, a_p \neq 1, p \in \mathbf{P}}\frac{1}{p}<\infty,$$ where $\mathbf{P}$ is the…

Number Theory · Mathematics 2017-08-16 Shuo Li

This is a survey of a connection between the distribution of certain power residues modulo $p$, $p$ a prime, and relative class numbers. The focus lies on quadratic residues and sixth power residues. Dirichlet's class number formula yields…

Number Theory · Mathematics 2025-09-26 Kurt Girstmair

Denote by $\mathcal{R}_p$ the set of all quadratic residues in $\mathbf{F}_p$ for each prime $p$. A conjecture of A. S\'ark\"ozy asserts, for all sufficiently large $p$, that no subsets $\mathcal{A},\mathcal{B}\subseteq\mathbf{F}_p$ with…

Number Theory · Mathematics 2022-02-08 Yong-Gao Chen , Ping Xi

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

General Mathematics · Mathematics 2019-04-02 N. A. Carella
‹ Prev 1 4 5 6 7 8 10 Next ›