Related papers: Fermat Numbers: Pseudoprimality and Primality Cons…

In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…

The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown,…

In this article we improve the upper bound for the arithmetic self-intersection number of the dualizing sheaf of the minimal regular model for the Fermat curves $F_p$ of prime exponent.

New formulas for the construction of Pythagorean triples and generalizations to equations of higher powers. Application of formulas to some problems, in particular Fermat's equation with n=4.

This study involves definitions for multiple-counting regular and summation sequences of rho. My paper introduces and proves recurrent relationships for multiple-counting sequences and shows their association with Fermat's little theorem. I…

We introduce a new class of pseudoprimes-so called "overpseudoprimes to base $b$", which is a subclass of strong pseudoprimes to base $b$. Denoting via $|b|_n$ the multiplicative order of $b$ modulo $n$, we show that a composite $n$ is…

In this article an upper bound for the first consecutive zeros of the Fermat quotient is given in terms of the zeros of a Mirimanoff polynomial. This bound is obtained by investigating a relation between these polynomials and the factor…

If $p_k$ is the k-th prime, the Firoozbakht conjecture states that the sequence $(p_k)^{1/k}$ is strictly decreasing. We use the table of first-occurrence prime gaps in combination with known bounds for the prime-counting function to verify…

We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.

In this note we classify the necessary and the sufficient conditions that an index of a superconformal theory in $3\leq d \leq 6$ must obey for the theory to have enhanced supersymmetry. We do that by noting that the index distinguishes a…

We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…

Let $K$ be a number field and $p$ a prime number $\geq 5$. Let us denote by $\mu_p$ the group of the $p$th roots of unity. We define $p$ to be $K$-regular if $p$ does not divide the class number of the field $K(\mu_p)$. Under the assumption…

In this paper, we mainly study metric subregularity for a convex constraint system defined by a convex set-valued mapping and a convex constraint subset. The main work is to provide several primal equivalent conditions for metric…

Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…

Let $x$ and $n$ be positive integers. We prove a non-trivial lower bound for $x$, dependant only on $\omega_n$, the number of distinct prime factors of $x^n-1$. By considering the divisibility of $\varphi \mid x^n-1$ for $\varphi \mid n$,…

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

Let $n\geq 3$ be an integer. Let $F_n$ be the Fermat curve defined by the Fermat equation $x^n+y^n=z^n$. For a curve $C/\mathbb{Q}$, we say an algebraic point $P\in C(\bar{\mathbb{Q}})$ is primitive if the Galois group of the Galois closure…

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…

In this paper we establish some new supercongruences motivated by the well-known fact $\lim_{n\to\infty}(1+1/n)^n=e$. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{-1/(p+1)}k^{p+1}\equiv 0\ \pmod{p^5}\ \ \ \mbox{and}\ \ \…

This paper studies the complexity of determining whether a formula in the modal logics characterizing the nested-simulation semantics is characteristic for some process, which is equivalent to determining whether the formula is satisfiable…