Related papers: Fermat Numbers: Pseudoprimality and Primality Cons…

In this manuscript we provide necessary and sufficient conditions for the $\textnormal{weak}(1,p)$ boundedness, $1< p<\infty,$ of discrete Fourier multipliers (Fourier multipliers on $\mathbb{Z}^n$). Our main goal is to apply the results…

Primitive roots of 1 mod p^k (k>2 and odd prime p) are sought, in cyclic units group G_k = A_k B_k mod p^k, coprime to p, of order (p-1)p^{k-1}. 'Core' subgroup A_k has order p-1 independent of k, and p+1 generates 'extension' subgroup B_k…

We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…

A subset $M \subset \textbf{R}^3$ is called a \emph{basic subset}, if for any funciton $f \colon M \to \textbf{R}$ there exist such functions $f_1; f_2; f_3 \colon \textbf{R} \to \textbf{R}$ that $f(x_1, x_2, x_3) = f_1(x_1) + f_2(x_2) +…

For a given testing problem, let $U_1,...,U_n$ be individually valid and conditionally on the data i.i.d.\ P-variables (often called P-values). For example, the data could come in groups, and each $U_i$ could be based on subsampling just…

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

For n>1, let G(n)=\sigma(n)/(n log log n), where \sigma(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satisfying G(N) \ge \max(G(N/p),G(aN)), for all prime…

A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main ingredients in several known proofs. Then we give an…

In this work, we provide a validity condition for the normal form transformation to remove the non-resonant cubic terms in the $\beta$-FPUT system. We show that for a wave field with random phases, the normal form transformation is valid by…

Possible parameter values in a random sampling model are shown by definition to have uniform base-rate prior probabilities. This allows a frequentist posterior probability distribution to be calculated for such possible parameter values…

A regular language $L$ is said to be prime, if it is not the product of two non-trivial languages. Martens et al. settled the exact complexity of deciding primality for deterministic finite automata in 2010. For finite languages, Mateescu…

We define and study a transform whose iterates bring to the fore interesting relations between Pisot numbers and primes. Although the relations we describe are general, they take a particular form in the Pisot limit points. We give three…

In the paper one proves a necessary condition for divisibility of integral elements by the powers of prime divisor of unramifed prime ideal and gives its application to a simple proof of Fermat's Last Theorem.

We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…

The famous irreducibility criteria of Sch\"onemann-Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper we provide several irreducibility criteria of…

In this paper, we study primeness and pseudo primeness of p-adic meromorphic functions. We also consider left (resp. right ) primeness of these functions. We give, in particular, sufficient conditions for a meromorphic function to satisfy…

In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…

We prove a general version of the classical Perron-Frobenius convergence property for reducible matrices. We then apply this result to reducible substitutions and use it to produce limit frequencies for factors and hence invariant measures…

A nonnegative integer is called a fertility number if it is equal to the number of preimages of a permutation under West's stack-sorting map. We prove structural results concerning permutations, allowing us to deduce information about the…

We seek simple conditions on a pair of labeled posets that determine when the difference of their $(P,\omega)$-partition enumerators is $F$-positive, i.e., positive in Gessel's fundamental basis. This is a quasisymmetric analogue of the…