English

Pattern formation Statistics on Fermat Quotients

Number Theory 2025-06-24 v1

Abstract

Despite their simple definition as qp(b):=bp11p(modp)\mathfrak{q}_p(b):=\frac{b^{p-1}-1}{p} \pmod p, for 0bp210\le b \le p^2-1 and gcd(b,p)=1\gcd(b,p)=1, and their regular arrangement in a p×(p1)p\times(p-1) Fermat quotient matrix FQM(p)\mathtt{FQM}(p) of integers from [0,p1][0,p-1], Fermat quotients modulo pp are well known for their overall lack of regularity. Here, we discuss this contrasting effect by proving that, on the one hand, any line of the matrix behaves like an analogue of a randomly distributed sequence of numbers, and on the other hand, the spatial statistics of distances on regular NN-patterns confirm the natural expectations.

Keywords

Cite

@article{arxiv.2506.17684,
  title  = {Pattern formation Statistics on Fermat Quotients},
  author = {Cristian Cobeli and Alexandru Zaharescu and Zhuo Zhang},
  journal= {arXiv preprint arXiv:2506.17684},
  year   = {2025}
}

Comments

18 pages, 4 tables, and 4 figures

R2 v1 2026-07-01T03:27:48.512Z