Related papers: Counting Frobenius Pseudoprimes

Let $0<\lambda\leq1$, $\lambda\notin\left\{\frac24, \frac27, \frac2{10}, \frac2{13}, \ldots\right\}$, be a real and $p$ a prime number, with $[p,p+\lambda p]$ containing at least two primes. Denote by $f_\lambda(p)$ the largest integer…

We introduce a new class of pseudoprimes-so called "overpseudoprimes" which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n, we show that odd number n is overpseudoprime iff value…

We call an integer N>1 primover to base a if it either prime or overpseudoprime to base a. We prove, in particular, that every Fermat number is primover to base 2. We also indicate a simple process of receiving of primover divisors of…

For each integer $s\geq 1$, we present a family of curves that are $\mathbb{F}_q$-Frobenius nonclassical with respect to the linear system of plane curves of degree s. In the case $s = 2$, we give necessary and sufficient conditions for…

We give combinatorial proofs of some enumeration formulas involving labelled threshold, quasi-threshold, loop-threshold and quasi-loop-threshold graphs. In each case we count by number of vertices and number of components. For threshold…

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

Let $E$ be a nonsingular elliptic curve over the rational numbers, and let $\tau^n=p^n+1-\#E(\mathbb{F}_{p^n})$. A result in the current literature claims that the normalized traces of Frobenius…

A Frobenius difference field is an algebraically closed field of characteristic $p>0$, enriched with a symbol for $x \mapsto x^{p^m}$. We study a sentence or formula in the language of fields with a distinguished automorphism, interpreted…

Let $A$ be an abelian variety over $\mathbb{Q}$ of dimension $g$ such that the image of its associated absolute Galois representation $\rho_A$ is open in $\operatorname{GSp}_{2g}(\hat{\mathbb{Z}})$. We investigate the arithmetic of the…

In formal concept analysis, it is well-known that the number of formal concepts can be exponential in the worst case. To analyze the average case, we introduce a probabilistic model for random formal contexts and prove that the average…

This paper develops a compositional vector-based semantics of subject and object relative pronouns within a categorical framework. Frobenius algebras are used to formalise the operations required to model the semantics of relative pronouns,…

Let consider $n$ natural numbers $a\_1 ,\ldots , a\_{n} $. Let $S$ be the numerical semigroup generated by $a\_1 ,\ldots , a\_{n} $. Set $A=K[t^{a\_1}, \ldots , t^{a\_n}]=K[{x\_1}, \ldots , {x\_n}]/I$. The aim of this paper is:…

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the…

The $F$-thresholds are important numerical invariants in prime characteristic, whose existence had been established only under certain assumptions. We show the existence of $F$-thresholds in full generality. We study properties of standard…

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

In the context of the Frobenius coin problem, given two relatively prime positive integers $a$ and $b$, the set of nonrepresentable numbers consists of positive integers that cannot be expressed as nonnegative integer combination of $a$ and…

We survey the classical results on the prime number theorem

Consider a polynomial $f$ defined over a field $k$, the multiplicity is perhaps the most naive measurement of the singularities of $f$. This paper describes the first steps toward understanding a much more subtle measure of singularities…

In this paper, we will give some estimation for the average error of the prime number theorem.