Related papers: Counting Frobenius Pseudoprimes

In this paper we obtain lower and upper bounds on the average number of liars for the Quadratic Frobenius Pseudoprime Test of Grantham, generalizing arguments of Erd\H{o}s and Pomerance, and Monier. These bounds are provided for both Jacobi…

The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word ``pseudoprime'' in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas…

Let $K$ be a number field and $r$ an integer. Given an elliptic curve $E$, defined over $K$, we consider the problem of counting the number of degree two prime ideals of $K$ with trace of Frobenius equal to $r$. Under certain restrictions…

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…

For a prime p, we call a positive integer n a Frobenius p-number if there exists a finite group with exactly n subgroups of order p^a for some $a\ge 0$. Extending previous results on Sylow's theorem, we prove in this paper that every…

We establish a necessary condition for pseudoprimality and a sufficient condition for primality of Fermat numbers, based on a congruence involving the exponent $(F_n-1)/4$. Moreover, in connection with P\'epin's primality test, we obtain a…

We show that for large instances the order of magnitude of the expected Frobenius number is (up to a constant depending only on the dimension) given by its lower bound.

At present one can not find a single counterexample to even a simplest version of Frobenius primality test. The assessment of probability of the mistake, presented in [I.B. Damgard and G.S.Frandsen, Journal of Cryptology, 2006] is strongly…

Using an idea of Doug Lind, we give a lower bound for the Perron-Frobenius degree of a Perron number that is not totally-real. As an application, we prove that there are cubic Perron numbers whose Perron-Frobenius degrees are arbitrary…

In this paper, we introduce and study the numerical semigroups generated by $\{a_1, a_2, \ldots \} \subset \mathbb{N}$ such that $a_1$ is the repunit number in base $b > 1$ of length $n > 1$ and $a_i - a_{i-1} = a\, b^{i-2},$ for every $i…

The theory of Frobenius groups with Frobenius complements of even order largely reduces to tractable algebraic number theory. If we consider only Frobenius complements with an upper bound $s$ on the number of distinct primes dividing the…

We describe the average sizes of the set of bad witnesses for a pseudo-primality test which is the product of a multiple-rounds Miller-Rabin test by the Galois test.

Let $K$ be a fixed number field, assumed to be Galois over $\mathbb Q$. Let $r$ and $f$ be fixed integers with $f$ positive. Given an elliptic curve $E$, defined over $K$, we consider the problem of counting the number of degree $f$ prime…

We prove an asymptotic formula for the mean value of Frobenius numbers with three arguments. To prove this we use a new method invented by A. Ustinov, Rodseth's algorithm an bounds for exponential sums.

This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…

We compute the Frobenius number for sequences of triangular and tetrahedral numbers. In addition, we study some properties of the numerical semigroups associated to those sequences.

This article extends the notion of a Frobenius power of an ideal in prime characteristic to allow arbitrary nonnegative real exponents. These generalized Frobenius powers are closely related to test ideals in prime characteristic, and…

Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…

We produce new upper and lower bounds for the s-Frobenius number by relating it to the so called s-covering radius of a certain convex body with respect to a certain lattice; this generalizes a well-known theorem of R. Kannan for the…

In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.