English
Related papers

Related papers: On special Wieferich's primes

200 papers

Suppose x^m + c*x^n is a permutation polynomial over GF(p), where p>5 is prime, m>n>0, and c is in GF(p)^*. We prove that gcd(m-n,p-1) is not 2 or 4. In the special case that either (p-1)/2 or (p-1)/4 is prime, this was conjectured in a…

Number Theory · Mathematics 2008-06-09 Ariane M. Masuda , Michael E. Zieve

A prime $p$ is a Wolstenholme prime if $\binom{2p}{p}\equiv2$ mod $p^4$, or, equivalently, if $p$ divides the numerator of the Bernoulli number $B_{p-3}$; a Vandiver prime $p$ is one that divides the Euler number $E_{p-3}$. Only two…

Number Theory · Mathematics 2022-03-29 Andrew R. Booker , Shehzad Hathi , Michael J. Mossinghoff , Timothy S. Trudgian

In this short note we construct a spectral, non-tiling set of size $2p$ in $(\mathbb{Z}/p\mathbb{Z})^4$, $p$ odd prime. This example complements a previous counterexample in [arXiv:1509.01090], which existed only for $p \equiv 3 \pmod{4}$.…

Combinatorics · Mathematics 2019-04-30 Sam Mattheus

A recent article of Berndt and Yee found congruences modulo 3^k for certain ratios of Eisenstein series. For all but one of these, we show there are no simple congruences a(pn+c) = 0 modulo p when p>= 13 is prime. This follows from a more…

Number Theory · Mathematics 2009-10-02 Michael Dewar

Let $n$ be a positive integer, $p$ be an odd prime and integers $a,b \not= 0$ with $gcd(a,b)=1$, $p \nmid ab$, and $p|(a^n \pm b^n)$, we prove the identity $$\nu_p(a^n \pm b^n)-\nu_p(n)=\nu_p(a^{p-1}-b^{p-1}).$$ An unintended interesting…

Number Theory · Mathematics 2021-12-09 Kok Seng Chua

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

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie

Let $q$ be a power of a prime number $p$, $\mathbb F_q$ be a finite field with $q$ elements and $\mathcal{G}$ be a subgroup of $(\mathbb F_q,+)$ of order $p$. We give an existence criterion and an algorithm for computing maximally…

Number Theory · Mathematics 2020-11-25 Alex Samuel Bamunoba , Jonas Bergström

We present improved algorithms for computing the left factorial residues $!p=0!+1!+...+(p-1)! \!\mod p$. We use these algorithms for the calculation of the residues $!p\!\mod p$, for all primes $p$ up to $2^{40}$. Our results confirm that…

Number Theory · Mathematics 2020-12-21 Vladica Andrejić , Alin Bostan , Milos Tatarevic

We prove that neither a prime nor {an l-almost prime} number theorem hold in the class of regular Toeplitz subshifts. But, {when a quantitative strengthening of the regularity with respect to the periodic structure involving Euler's totient…

Dynamical Systems · Mathematics 2023-06-22 Krzysztof Frączek , Adam Kanigowski , Mariusz Lemańczyk

Let $S$ denote a set of primes and let $a_1,\ldots,a_m$ be positive distinct integers. We call the $m$-tuple $(a_1,\ldots,a_m)$ an $S$-Diophantine tuple if $a_ia_j+1=s_{i,j}$ are $S$-integers for all $i\not=j$. In this paper, we show that…

Number Theory · Mathematics 2014-07-28 László Szalay , Volker Ziegler

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…

Number Theory · Mathematics 2009-05-21 Konstantine Zelator

We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new $L$-function free proof of Linnik's problem of bounding the least prime $p$ such that $p\equiv a\pmod q$…

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

We consider a variant of a question of N. Koblitz. For an elliptic curve $E/\Q$ which is not $\Q$-isogenous to an elliptic curve with torsion, Koblitz has conjectured that there exists infinitely many primes $p$ such that…

Number Theory · Mathematics 2013-06-14 Kirti Joshi

We show there exist no nontrivial semidualizing modules for nonmodular rings of invariants of order $p^n$ with $p$ a prime.

Commutative Algebra · Mathematics 2014-08-26 William Sanders

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

Number Theory · Mathematics 2016-09-02 Jie Wu , Ping Xi

In this paper, we prove two supercongruences by the Wilf-Zeilberger method. One of them is, for any prime $p>3$, \begin{align*} \sum_{n=0}^{(p-1)/2}\frac{3n+1}{(-8)^n}\binom{2n}n^3\equiv…

Number Theory · Mathematics 2021-11-18 Guo-Shuai Mao

For any prime $p>3$ and $j\in\mathbb{N}$ we construct examples of non-$FSZ_{p^j}$ groups of order $p^{p^j+2j-1}$. In the special case of $j=1$ this yields groups of order $p^{p+1}$, which is the minimum possible order for a non-$FSZ$…

Group Theory · Mathematics 2017-04-19 Marc Keilberg

This note concerns the non-existence of three consecutive powerful numbers. We use Pell equations, elliptic curves, and second-order recurrences to show that there are no such triplets with the middle term a perfect cube and each of the…

Number Theory · Mathematics 2025-03-28 Tsz Ho Chan

This note proves two theorems regarding Fermat-type equation $x^r + y^r = dz^p$ where $r \geq 5$ is a prime. Our main result shows that, for infinitely many integers~$d$, the previous equation has no non-trivial primitive solutions such…

Number Theory · Mathematics 2023-06-13 Nuno Freitas , Filip Najman