English
Related papers

Related papers: Pattern formation Statistics on Fermat Quotients

200 papers

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

For a fixed integer a>1, we suggest that the probability of nullity of the p-Fermat quotient q(p,a) is much lower than 1/p for any arbitrary large prime number p. For this we use various heuristics, justified by means of numerical…

Number Theory · Mathematics 2021-08-06 Georges Gras

Let $p$ be a prime, and let $n>0$ and $r$ be integers. In this paper we study Fleck's quotient $$F_p(n,r)=(-p)^{-\lfloor(n-1)/(p-1)\rfloor} \sum_{k=r(mod p)}\binom {n}{k}(-1)^k\in Z.$$ We determine $F_p(n,r)$ mod $p$ completely by certain…

Number Theory · Mathematics 2015-06-26 Zhi-Wei Sun , Daqing Wan

We obtain some theoretic and experimental results concerning various properties (the number of fixed points, image distribution, cycle lengths) of the dynamical system naturally associated with Fermat quotients acting on the set $\{0, ...,…

Number Theory · Mathematics 2010-01-25 Alina Ostafe , Igor E. Shparlinski

Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base 2. Recently, Z. H. Sun proved that \sum_{k=1}^{p-1}\frac{1}{k\cdot 2^k}\equiv q_p(2)-\frac{p}{2}q_p(2)^2 \pmod{p^2} which is a generalization of a…

Number Theory · Mathematics 2011-10-20 Romeo Mestrovic

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…

Number Theory · Mathematics 2019-07-10 Zhi-Wei Sun

We prove some polynomial identities from which we deduce congruences modulo $p^2$ for the Fermat quotient $\frac{2^p-2}{p}$ for any odd prime $p$ (Proposition 1 and Theorem 1). These congruences are simpler than the one obtained by…

Number Theory · Mathematics 2023-09-19 Takao Komatsu , B. Sury

Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…

Combinatorics · Mathematics 2024-03-04 Nadav Kohen

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

Applications · Statistics 2016-12-20 Roger Bilisoly

We investigate the $k$-error linear complexity of $p^2$-periodic binary sequences defined from the polynomial quotients (including the well-studied Fermat quotients), which is defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~…

Cryptography and Security · Computer Science 2016-03-15 Zhixiong Chen , Zhihua Niu , Chenhuang Wu

We present some theoretic bounds and algorithms concerning the statistics of different reduction types in the family of Fermat curves $Y^p = X^s(1-X)$, where $p$ is prime and $s =1, ..., p-2$.

Number Theory · Mathematics 2012-12-06 David Harvey , Igor Shparlinski

Let $p$ be an odd prime number. Let $K$ be the $p$-th cyclotomic field and $F$ its maximal real subfield. We give general formulae of the root numbers of the Jacobian varieties of the Fermat curves $X^p+Y^p=\delta$ where $\delta$ is an…

Number Theory · Mathematics 2021-11-30 Jie Shu

For an odd prime $p$ and an integer $w\ge 1$, polynomial quotients $q_{p,w}(u)$ are defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~~ \mathrm{with}~~ 0 \le q_{p,w}(u) \le p-1, ~~u\ge 0, $$ which are generalizations of Fermat…

Number Theory · Mathematics 2014-02-11 Zhixiong Chen , Arne Winterhof

We describe the trace representations of two families of binary sequences derived from Fermat quotients modulo an odd prime $p$ (one is the binary threshold sequences, the other is the Legendre-Fermat quotient sequences) via determining the…

Number Theory · Mathematics 2016-03-15 Zhixiong Chen

We have known that most sequences in $\mathcal{M}=\{1,2,\dots, M\}$ with length $n$ will miss $Me^{-\lambda}$ of the total numbers of $\{1,2,\dots,M\}$ as the ratio $n/M$ tends to $\lambda$. Now we consider a more general case where the…

Number Theory · Mathematics 2020-11-17 Cristian Cobeli , Alexandru Zaharescu

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

We give q-analogues of the following congruences by Z.-W. Sun: \sum_{k=1}^{p-1}\frac{D_k}{k} \equiv -\frac{2^{p-1}-1}{p} \pmod p,\\ \sum_{k=1}^{p-1}\frac{H_k}{k 2^k}\equiv 0 \pmod{p},\quad p\geqslant 5, where p is a prime,…

Number Theory · Mathematics 2013-12-24 Victor J. W. Guo

The Fermat quotient $q_p(a):=(a^{p-1}-1)/p$, for prime $p\nmid a$, and the Wilson quotient $w_p:=((p-1)!+1)/p$ are integers. If $p\mid w_p,$ then $p$ is a Wilson prime. For odd $p,$ Lerch proved that $(\sum_{a=1}^{p-1} q_p(a) - w_p)/p$ is…

Number Theory · Mathematics 2014-12-16 Jonathan Sondow

Let p be a prime, and let n>0 and r be integers. In 1913 Fleck showed that $$F_p(n,r)=(-p)^{-[(n-1)/(p-1)]}\sum_{k=r(mod p)}\binom{n}{k}(-1)^k\in\Z.$$ Nowadays this result plays important roles in many aspects. Recently Sun and Wan…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Let $p\geq 3$ be a prime number. A Fermat curve over $\mathbb{Q}$ of exponent $p$ is defined by an equation of the shape $ax^p+by^p+cz^p=0$, where $a,b,c$ are non-zero rational numbers. We prove in this article that there exist infinitely…

Number Theory · Mathematics 2025-05-14 Alain Kraus
‹ Prev 1 2 3 10 Next ›