Related papers: Explicit Factorization of Prime Integers in Quarti…

Julia Robinson has given a first-order definition of the rational integers $\mathbb Z$ in the rational numbers $\mathbb Q$ by a formula $(\forall \exists \forall \exists)(F=0)$ where the $\forall$-quantifiers run over a total of 8…

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

Using an elementary identity, we prove that for infinitely many polynomials $P(x)\in \mathbb{Z}[X]$ of fourth degree, the equation $\prod\limits_{k=1}^{n}P(k)=y^2$ has finitely many solutions in $\mathbb{Z}$. We also give an example of a…

For a radical extension K of odd prime degree the ring O_K of integers is constructed as a product of subrings with the following property: for all prime divisors q of the discriminant of O_K there is a q-maximal factor. The discriminant of…

By making use of our generalization of Barrucand and Cohn's theory of principal factorizations in pure cubic fields $\mathbb{Q}(\sqrt[3]{D})$ and their Galois closures $\mathbb{Q}(\zeta_3,\sqrt[3]{D})$ with 3 possible types to pure quintic…

We say that n ideals of algebraic integers in a fixed number ring are k-wise relatively r-prime if any k of them are relatively r-prime. In this article, we provide an exact formula for the probability that n nonzero ideals of algebraic…

We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can…

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

Given a polynomial f(z) = z^d + c over a global field K and a_0 in K, we study the density of prime ideals of K dividing at least one element of the orbit of a_0 under f. The density of such sets for linear polynomials has attracted much…

We investigate the distribution of $\alpha p$ modulo one in quadratic number fields $\mathbb{K}$ with class number one, where $p$ is restricted to prime elements in the ring of integers of $\mathbb{K}$. Here we improve the relevant exponent…

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

Let Fq be the finite field with q elements, and K an algebraic function field over with Fq as its field of constants. Let S be a finite nonempty set of prime divisors over K, and OS be the ring of integers of K attached to S. Let w greater…

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

Already Dedekind and Weber considered the problem of counting integral ideals of norm at most $x$ in a given number field $K$. Here we improve on the existing results in case $K/\mathbb Q$ is abelian and has degree at least four. For these…

Given an odd prime $p$, we provide formulas for the Hensel lifts of polynomial roots modulo $p$, and give an explicit factorization over the ring of formal power series with integer coefficients for certain reducible polynomials whose…

Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…

We give all splitting bi-unitary perfect polynomials over the field $\mathbb{F}_4$ and some splitting ones over $\mathbb{F}_{p^2}$, if $p$ is an odd prime.

Designing a deterministic polynomial time algorithm for factoring univariate polynomials over finite fields remains a notorious open problem. In this paper, we present an unconditional deterministic algorithm that takes as input an…