English
Related papers

Related papers: Fermat Numbers: Pseudoprimality and Primality Cons…

200 papers

We present a short elementary proof of the well-known criterion for a cubic polynomial to have three real roots. The proof is based on Fermat's approach to calculus for polynomials. This approach illustrates the idea of a derivative…

History and Overview · Mathematics 2026-01-08 A. Skopenkov

Parameter estimates in misspecified models converge to pseudo-true parameter values, which minimize a population objective function. Pseudo-true values often differ from quantities of economic interest, raising questions of how, if at all,…

Econometrics · Economics 2026-04-20 Isaiah Andrews , Harvey Barnhard , Jacob Carlson

Nonlinear pseudo-fermions of degree n (n-pseudo-fermions) are introduced as (pseudo) particles with creation and annihilation operators $a$ and $b$, $b \neq a^\dagger$, obeying the simple nonlinear anticommutation relation $ab + b^n a^n =…

Quantum Physics · Physics 2015-06-04 D. A. Trifonov

The problem of measuring conditional dependence between two random phenomena arises when a third one (a confounder) has a potential influence on the amount of information between them. A typical issue in this challenging problem is the…

Machine Learning · Statistics 2025-03-12 Ferran de Cabrera , Marc Vilà-Insa , Jaume Riba

We prove lower bounds of the form $\gg N/(\log N)^{3/2}$ for the number of primes up to $N$ primitively represented by a shifted positive definite integral binary quadratic form, and under the additional condition that primes are from an…

Number Theory · Mathematics 2025-04-30 Elena Fuchs , Catherine Hsu , James Rickards , Damaris Schindler , Katherine E. Stange

Let $K$ be a totally real number field. For all prime number $p\geq 5$, let us denote by $F_p$ the Fermat curve of equation $x^p+y^p+z^p=0$. Under the assumption that $2$ is totally ramified in $K$, we establish some results about the set…

Number Theory · Mathematics 2019-03-27 Alain Kraus

Here we present an expository, general analysis of valid post-selection or post-regularization inference about a low-dimensional target parameter, $\alpha$, in the presence of a very high-dimensional nuisance parameter, $\eta$, which is…

Statistics Theory · Mathematics 2017-10-03 Victor Chernozhukov , Christian Hansen , Martin Spindler

Let $p$ be a prime. In this paper, we present a detailed $p$-adic analysis to factorials and double factorials and their congruences. We give good bounds for the $p$-adic sizes of the coefficients of the divided universal Bernoulli number…

Number Theory · Mathematics 2013-08-23 Shaofang Hong , Jianrong Zhao , Wei Zhao

For numerical approximation the reformulation of a PDE as a residual minimisation problem has the advantages that the resulting linear system is symmetric positive definite, and that the norm of the residual provides an a posteriori error…

Numerical Analysis · Mathematics 2023-05-29 Harald Monsuur , Rob Stevenson , Johannes Storn

New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…

Number Theory · Mathematics 2011-05-23 H. J. Weber

This paper introduces the notion of pseudo-independence on the sublinear expectation space $(\Omega,\mathcal{F},\mathcal{P})$ via the classical conditional expectation, and the relations between pseudo-independence and Peng's independence…

Probability · Mathematics 2021-06-01 Xinpeng Li

Carmichael showed for sufficiently large $L$, that $F_L$ has at least one prime divisor that is $\pm 1({\rm mod}\, L)$. For a given $F_L$, we will show that a product of distinct odd prime divisors with that congruence condition is a…

Number Theory · Mathematics 2021-05-31 Junhyun Lim , Shaunak Mashalkar , Edward F. Schaefer

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

Number Theory · Mathematics 2022-03-30 Ashwin Sah , Mehtaab Sawhney

This paper presents a new approach to conditional inference, based on the simulation of samples conditioned by a statistics of the data. Also an explicit expression for the approximation of the conditional likelihood of long runs of the…

Applications · Statistics 2012-02-07 Michel Broniatowski , Virgile Caron

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Number Theory · Mathematics 2022-11-15 Joshua Zelinsky

This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…

General Mathematics · Mathematics 2009-01-07 N. A. Carella

There are two basic ways of weakening the definition of the well-known metric regularity property by fixing one of the points involved in the definition. The first resulting property is called metric subregularity and has attracted a lot of…

Optimization and Control · Mathematics 2020-01-22 R. Cibulka , M. Fabian , A. Y. Kruger

This paper has been withdrawn. This paper focuses on the admissibility condition for fractional-order singular system with order $\alpha \in (0,1)$. The definitions of regularity, impulse-free and admissibility are given first, then a…

Systems and Control · Computer Science 2012-12-19 Zhuang Jiao , Yisheng Zhong

Given a first-order sentence, a model-checking computation tests whether the sentence holds true in a given finite structure. Data provenance extracts from this computation an abstraction of the manner in which its result depends on the…

Logic in Computer Science · Computer Science 2017-12-07 Erich Grädel , Val Tannen

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

Number Theory · Mathematics 2017-04-13 Verónica Becher , Sergio A. Yuhjtman
‹ Prev 1 4 5 6 7 8 10 Next ›