Related papers: A primality test for $Kp^\ell - 1$ numbers

In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time…

Let $D$ be a square-free integer other than 1. Let $K$ be the quadratic field ${\mathbb Q}(\sqrt D)$. Let $\delta \in \{1,2\}$ with $\delta=2$ if $D\equiv 1 \pmod 4$. To each prime ideal $\mathcal P$ in $K$ that splits in $K/\mathbb Q$ we…

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…

We give Deterministic Primality tests for large families of numbers. These tests were inspired in the recent and celebrated Agrawal-Kayal-Saxena (AKS) test. The AKS test has proved polynomial complexity O ((log n)^12) and they expect it to…

For an elliptic curve with CM by $K$ defined over its Hilbert class field, $E/H$, we extend Lenstra's finite fields test to generators of norms of certain ideals in $\mathcal{O}_H$, yielding a sufficient $\widetilde{O}(\log^3 N)$ primality…

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

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…

Let $K$ be a number field, and let $G\subset K^\times$ be a finitely generated subgroup. Fix some prime number $\ell$, and consider the set of primes $\mathfrak{p}$ of $K$ satisfying the following property: the reduction of $G$ modulo…

We present an efficient and elementary algorithm for computing the number of primes up to $N$ in $\tilde{O}(\sqrt N)$ time, improving upon the existing combinatorial methods that require $\tilde{O}(N ^ {2/3})$ time. Our method has a similar…

We give a new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary…

Let $K$ be a number field. We present several new finiteness results for isomorphism classes of abelian varieties over $K$ whose $\ell$-power torsion fields are arithmetically constrained for some rational prime $\ell$. Such arithmetic…

Let $a,k\in\mathbb{N}$. For the $k-1$-th iterate of the exponential function $x\mapsto a^x$, also known as tetration, we write \[ ^k a:=a^{a^{.^{.^{.^{a}}}}}. \] In this paper, we show how an efficient algorithm for tetration modulo natural…

We describe a primality test for number $M=(2p)^{2^n}+1$ with odd prime $p$ and positive integer $n$. And we also give the special primality criteria for all odd primes $p$ not exceeding 19. All these primality tests run in polynomial time…

A simple criterion is derived in order that a number sequence ${\cal S}_n$ is a permitted spectrum of a quantized system. The sequence of the prime numbers fulfils the criterion and the corresponding one-dimensional quantum potential is…

We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary. In some cases, the…

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k) denotes the cost of multiplying k-bit integers. This result is due to…

Let $k$ be a field and let $R$ be a countable dimensional prime von Neumann regular $k$-algebra. We show that $R$ is primitive, answering a special case of a question of Kaplansky.

For a prime $\ell$, let $h_\ell(K)$ denote the $\ell$-part of the class number of the number field $K$. We investigate upper bounds for $h_\ell(K)$ when $K$ is quadratic or cubic, particularly in the case in which the discriminant of $K$ is…