English
Related papers

Related papers: A note on $n!$ modulo $p$

200 papers

Let $C_n$ be the $n$th Catalan number. We show that the asymptotic density of the set $\{n: C_n \equiv 0 \mod p \}$ is $1$ for all primes $p$, We also show that if $n = p^k -1$ then $C_n \equiv -1 \mod p$. Finally we show that if $n \equiv…

Number Theory · Mathematics 2017-01-12 Rob Burns

Let $\epsilon$ be a fixed positive quantity, $m$ be a large integer, $x_j$ denote integer variables. We prove that for any positive integers $N_1,N_2,N_3$ with $N_1N_2N_3>m^{1+\epsilon},$ the set $$ \{x_1x_2x_3 \pmod m: \quad x_j\in [1,N_j]…

Number Theory · Mathematics 2008-08-11 M. Z. Garaev

We show that if $n\ge n_0$, $b\ge 2$ are integers, $p\ge 7$ is prime and $n!-(b^p-1)/(b-1)\ge 0$, then $n!-(b^p-1)/(b-1) \ge 0.5\log\log n/\log\log\log n$. Further results are obtained, in particular for the case $n!-(b^p-1)/(b-1) < 0$.

Number Theory · Mathematics 2024-11-15 Michael Filaseta , Florian Luca

For A,epsilon>0 and any sufficiently large odd n we show that for almost all k up to n^{1/5-epsilon} there exists a representation n=p1+p2+p3 with primes in residue classes b1,b2,b3 mod k for almost all admissible triplets b1,b2,b3 of…

Number Theory · Mathematics 2007-09-12 Karin Halupczok

We prove that $\mathop{\mathbb{E}}_{m \leq M} \mathop{\mathbb{E}}_{n \leq N} \Lambda(n) \Lambda\bigl(n + \lfloor m^c \rfloor\bigr) = 1 + \rm{O}(\log^{2 - Bc} N)$, where $c > 2$ is a non-integer, $B \geq 3/c$, and $M$ is of order $N^{1/c}…

Number Theory · Mathematics 2024-11-27 Bora Çalım , Ioannis Iakovakis , Sophie Long , Jack Moffatt , Deborah Wooton

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

Number Theory · Mathematics 2023-04-18 Moubariz Z. Garaev , Igor E. Shparlinski

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

Number Theory · Mathematics 2013-01-29 Donald M. Davis

Suppose that $d \in \{ 2, 3, 4, 6 \}$ and $a \in \mathbb{Z}$ with $a\neq -1$ and $a$ is not square. Let $P_{(a,d)}$ be the number of primes $p$ not exceeding $x$ such that $p \equiv 1 \pmod{d}$ and $a^{(p-1)/d} \equiv 1 \pmod{p}$. In this…

Number Theory · Mathematics 2019-06-10 Peng Gao , Liangyi Zhao

Let $m$ be any positive integer and let $\delta_1,\delta_2\in\{1,-1\}$. We show that for some constanst $C_m>0$ there are infinitely many integers $n>1$ with $p_{n+m}-p_n\le C_m$ such that $$\left(\frac{p_{n+i}}{p_{n+j}}\right)=\delta_1\…

Number Theory · Mathematics 2019-09-06 Hao Pan , Zhi-Wei Sun

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

Number Theory · Mathematics 2018-04-04 Emmanuel Lecouturier

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Number Theory · Mathematics 2009-11-06 Roberto Tauraso

For $0\leq \alpha<1$ and prime number $p$ let $L(\alpha,p)$ be the sum of the first $[\alpha p]$ values of Legendre symbol modulo $p$. We study positivity of $L(\alpha,p)$ and prove that for $|\alpha-\frac13|<2\cdot 10^{-6}$ and for…

Number Theory · Mathematics 2021-07-02 Alexander Kalmynin

We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…

Number Theory · Mathematics 2011-05-31 Giovanni Coppola

Kurepa's conjecture states that there is no odd prime $p$ that divides $!p=0!+1!+\cdots+(p-1)!$. We search for a counterexample to this conjecture for all $p<2^{34}$. We introduce new optimization techniques and perform the computation…

Number Theory · Mathematics 2016-07-21 Vladica Andrejić , Milos Tatarevic

We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$

Group Theory · Mathematics 2018-09-05 Paul Bradley

Paul Erdos posed the following question: Is there a prime number $p>5$ such that the residues of $2!$, $3!$,\ldots, $(p-1)!$ modulo $p$ all are distinct? In this short note, we prove that there are no such prime numbers.

Number Theory · Mathematics 2025-05-09 Vyacheslav M. Abramov

In this paper we establish some new supercongruences motivated by the well-known fact $\lim_{n\to\infty}(1+1/n)^n=e$. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{-1/(p+1)}k^{p+1}\equiv 0\ \pmod{p^5}\ \ \ \mbox{and}\ \ \…

Number Theory · Mathematics 2015-02-27 Zhi-Wei Sun

A Lehmer number modulo a prime $p$ is an integer $a$ with $1 \leq a \leq p-1$ whose inverse $\bar{a}$ within the same range has opposite parity. Lehmer numbers that are also primitive roots have been discussed by Wang and Wang in an…

Number Theory · Mathematics 2017-12-13 Stephen D. Cohen , Tim Trudgian

The formula $\lim_{N\to\infty}\sum_{p<N,p,p+2 both prime} \log(p)\log(p+2) = C_2$ is tested on the computer up to $N=2^{40}\approx 1.1\times 10^{12}$ and very good agreement is found.

Number Theory · Mathematics 2007-05-23 Marek Wolf

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

Number Theory · Mathematics 2018-12-06 Gábor Hegedűs