English
Related papers

Related papers: Fermat test with gaussian base and Gaussian pseudo…

200 papers

We show that Wilson's theorem as well as the Wilson quotient can be described by supercongruences modulo any higher prime power involving terms of power sums of Fermat quotients. The new approach uses Bell polynomials and Newton's…

Number Theory · Mathematics 2025-09-08 Bernd C. Kellner

We define a variant of the Miller-Rabin primality test, which is in between Miller-Rabin and Fermat in terms of strength. We show that this test has infinitely many "Carmichael" numbers. We show that the test can also be thought of as a…

Number Theory · Mathematics 2015-12-03 Eric Bach , Rex Fernando

The Euler's totient function $ \varphi(n) $ counts the positive integers up to a given integer $ n$ that are relatively prime to $ n $. We solve a problem due to Lehmer that there is no composite number $ n $ such that $ \varphi(n)\mid n-1…

Number Theory · Mathematics 2019-07-02 Huan Xiao

The problem of simplicity of Fermat number-twins $f_{n}^{\pm}=2^{2^n}\pm3$ is studied. The question for what $n$ numbers $f_{n}^{\pm}$ are composite is investigated. The factor-identities for numbers of a kind $x^2 \pm k $ are found.

General Mathematics · Mathematics 2007-07-09 Boris V. Tarasov

Recent work has shown that one can efficiently learn fermionic Gaussian unitaries, also commonly known as nearest-neighbor matchcircuits or non-interacting fermionic unitaries. However, one could ask a similar question about unitaries that…

Quantum Physics · Physics 2025-06-18 Vishnu Iyer

Lehmer's totient problem asks whether there exists any composite number $n$ such that $\varphi(n) \, \mid \, (n-1)$, where $\varphi$ is Euler totient function. It is known that if any such $n$ exists, it must be Carmichael and $n >…

Number Theory · Mathematics 2021-06-23 Manuel Norman

Gronwall's function $G$ is defined for $n>1$ by $G(n)=\frac{\sigma(n)}{n \log\log n}$ where $\sigma(n)$ is the sum of the divisors of $n$. We call an integer $N>1$ a \emph{GA1 number} if $N$ is composite and $G(N) \ge G(N/p)$ for all prime…

Number Theory · Mathematics 2012-11-13 Geoffrey Caveney , Jean-Louis Nicolas , Jonathan Sondow

Lehmer's totient problem asks if there exist composite integers n satisfying the condition phi(n)|(n-1), (where phi is the Euler-phi function) while Carmichael numbers satisfy the weaker condition lambda(n)|(n-1) (where lambda is the…

Number Theory · Mathematics 2013-07-31 Nathan McNew

This paper provides a proof of a LLT-like test for Fermat numbers, based on the properties of Lucas Sequences and on the method of Lehmer.

Number Theory · Mathematics 2007-05-28 Tony Reix

Fermionic Gaussian operators are foundational tools in quantum many-body theory, numerical simulation of fermionic dynamics, and fermionic linear optics. While their structure is fully determined by two-point correlations, evaluating their…

Quantum Physics · Physics 2025-06-04 M. A. Rajabpour , MirAdel Seifi MirJafarlou , Reyhaneh Khasseh

The Frobenius primality test is based on the properties of the Frobenius automorphism of the quadratic extension of the residue field. Although it is probabilistic, we show that is "very rarely wrong". To date there are no counterexamples…

Number Theory · Mathematics 2020-11-16 Sergei Khashin

Let $G$ be a transitive permutation group on a finite set $\Omega$ and recall that a base for $G$ is a subset of $\Omega$ with trivial pointwise stabiliser. The base size of $G$, denoted $b(G)$, is the minimal size of a base. If $b(G)=2$…

Group Theory · Mathematics 2022-03-17 Timothy C. Burness , Hong Yi Huang

Although a deterministic polytime algorithm for primality testing is now known, the Rabin-Miller randomized test of primality continues being the most efficient and widely used algorithm. We prove the correctness of the Rabin-Miller…

Computational Complexity · Computer Science 2008-11-25 Grzegorz Herman , Michael Soltys

The Modular Group provides simple proofs of Fermat's representations: X^2+Y^2 for primes congruent to 1 (mod 4) and by X^2+3Y^2 for primes congruent to 1 (mod 3)

Number Theory · Mathematics 2021-09-22 Robert J Sibner

Let $K$ be a field whose characteristic is prime to a fixed integer $n$ with $\mu_n \subset K$, and choose $\omega \in \mu_n$ a primitive $n$th root of unity. Denote the absolute Galois group of $K$ by $\operatorname{Gal}(K)$, and the…

Number Theory · Mathematics 2014-02-26 Adam Topaz

In quantum information theory and statistical physics, symmetries of multiple copies, or replicas, of a system play a pivotal role. For unitary ensembles, these symmetries are encoded in the replicated commutant: the algebra of operators…

Quantum Physics · Physics 2026-03-16 Piotr Sierant , Xhek Turkeshi , Poetri Sonya Tarabunga

Compressible models extend the domain of simulable systems in quantum computers, but little is known about their precise limits of applicability. Using the theory of compressible matchgate circuits, we identify a class of quadratic…

Quantum Physics · Physics 2022-07-29 Guillermo Blázquez-Cruz , Pierre-Luc Dallaire-Demers

We study the coupling constant renormalization of gauge theories with an infinite multiplet of fermions, using the zeta function method to make sense of the infinite sums over fermions. If the gauge group K is the maximal compact subgroup…

High Energy Physics - Theory · Physics 2024-03-29 S. G. Rajeev

We determine the sharp asymptotic scale of the probability that two uniformly random permutations are comparable in weak Bruhat order, showing that $\mathbb{P}(\sigma_1 \preceq_W \sigma_2)=\exp\Bigl(\bigl(-\tfrac12+o(1)\bigr)\,n\log…

In the framework of the four dimensional heterotic superstring with free fermions we present a revised version of the rank eight Grand Unified String Theories (GUST) which contain the $SU(3)_H$-gauge family symmetry. We also develop some…

High Energy Physics - Phenomenology · Physics 2019-08-15 A. A. Maslikov , I. A. Naumov , G. G. Volkov