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

Let $E$ be an elliptic curve defined over a number field $K$. We say that a prime number $p$ is exceptional for $(E,K)$ if $E$ admits a $p$-isogeny defined over $K$. The so-called exceptional set of all such prime numbers is finite if and…

We describe an explicit generalized Lucasian test to determine the primality of numbers $h\cdot2^n\pm1$ when $h\nequiv0\pmod{17}$. This test is by means of fixed seeds which depend only on $h$. In particular when $h=16^m-1$ with $m$ odd,…

For a finite group $G$, let $K(G)$ denote the field generated over $\mathbb{Q}$ by its character values. For $n>24$, G. R. Robinson and J. G. Thompson proved that $$K(A_n)=\mathbb{Q}\left (\{ \sqrt{p^*} \ : \ p\leq n \ {\text{ an odd prime…

Let $\ell$ and $p$ be odd primes. For a positive integer $\mu$ let $k_\mu$ be the ray class field of $k=\mathbb{Q}(e^{2\pi i/\ell})$ modulo $2p^\mu$. We present certain class fields $K_\mu$ of $k$ such that $k_\mu\leq K_\mu\leq k_{\mu+1}$,…

Let $q\geq 1$ be any integer and let $ \epsilon \in [\frac{1}{11}, \frac{1}{2})$ be a given real number. In this short note, we prove that for all primes $p$ satisfying $$ p\equiv 1\pmod{q}, \quad \log\log p > \frac{\log…

The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, \ell. We prove an upper bound of O (n\sqrt{\ell}) for all values of…

After the language of module and theirs morphisms, this short course presents matricial calculus and determinants in a commutative ring as appliction of ``remarquable identities'' in the ring of polynomials with integer coefficients with…

To address the computational issue in empirical likelihood methods with massive data, this paper proposes a grouped empirical likelihood (GEL) method. It divides $N$ observations into $n$ groups, and assigns the same probability weight to…

Let $H(n) = \prod_{p|n}\frac{p}{p-1}$ where $p$ ranges over the primes which divide $n$. It is well known that if $n$ is a primitive non-deficient number, then $H(n) > 2$. We examine inequalities of the form $H(n)> 2 + f(n)$ for various…

Let $\mathbb{Z}^{ab}$ be the ring of integers of $\mathbb{Q}^{ab}$, the maximal abelian extension of $\mathbb{Q}$. We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients,…

We revisit the problem of rigorously and deterministically finding elements of large order in the multiplicative group of integers modulo a natural number $N$. Solving this problem is an essential step in several recent deterministic…

Let $\ell \geq 5$ be a prime and let $N$ be a square-free integer prime to $\ell$. For each prime $p$ dividing $N$, let $a_p$ be either $1$ or $-1$. We give sufficient criteria for the existence of a newform $f$ of weight 2 for…

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…

We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…

This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…

Let $p$ be a prime number and let $K$ be a finite extension of the field $\mathbb{Q}_p$ of $p$-adic numbers. Let $N$ be a fully ramified, elementary abelian extension of $K$. Under a mild hypothesis on the extension $N/K$, we show that…

Let $K=\Bbb Q(\sqrt{-q})$, where $q$ is a prime congruent to $3$ modulo $4$. Let $A=A(q)$ denote the Gross curve. Let $E=A^{(-\beta)}$ denote its quadratic twist, with $\beta=\sqrt{-q}$. The curve $E$ is defined over the Hilbert class field…

Number fields and their rings of integers, which generalize the rational numbers and the integers, are foundational objects in number theory. There are several computer algebra systems and databases concerned with the computational aspects…

Let $K$ be an imaginary quadratic field different from $\mathbb{Q}(\sqrt{-1})$ and $\mathbb{Q}(\sqrt{-3})$. For a positive integer $N$, let $K_\mathfrak{n}$ be the ray class field of $K$ modulo $\mathfrak{n}=N\mathcal{O}_K$. By using the…

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…