Related papers: Primitive Divisors in Arithmetic Dynamics

We present a notion of primitive which corresponds exactly with the Riemann integral. We obtain a characterization of the integrability in the sense of Riemann which produces a Fundamental Theorem of Calculus without special assumptions. We…

Let $\al$ and $\be$ be conjugate complex algebraic integers which generate Lucas or Lehmer sequences. We present an algorithm to search for elements of such sequences which have no primitive divisors. We use this algorithm to prove that for…

There are two outstanding questions about division algebras of prime degree $p$. The first is whether they are cyclic, or equivalently crossed products. The second is whether the center, $Z(F,p)$, of the generic division algebra $UD(F,p)$…

Let f : X --> X be a dominant rational map of a projective variety defined over a number field. An important geometric-dynamical invariant of f is its (first) dynamical degree d_f= lim SpecRadius((f^n)^*)^{1/n}. For algebraic points P of X…

Let $\mathbb{K}$ be a number field of degree $n$ over $\mathbb{Q}$. Let $\widehat{\mathbb{A}}$ be the set of integers of $\mathbb{K}$ which are primitive over $\mathbb{Q}$ and $I(\mathbb{K})$ be its index. Gunji and McQuillan defined the…

In this paper, we examine a natural question concerning the divisors of the polynomial x^n-1: "How often does x^n-1 have a divisor of every degree between 1 and n?" In a previous paper, we considered the situation when x^n-1 is factored in…

We introduce the notion of primitive elements in arbitrary truncated $p$-divisible groups. By design, the scheme of primitive elements is finite and locally free over the base. Primitive elements generalize the "points of exact order $N$,"…

The aim of this paper is to provide sufficient conditions for when a polynomial or rational function over a field K is prime using its order of vanishing at infinity and the resultant.

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

We give an elementary proof of a result which is not as well known as it should be: a ring with a specified finite number of zero divisors is finite, with a precise bound on its order.

The arithmetic derivative is a function from the natural numbers to itself that sends all prime numbers to $1$ and satisfies the Leibniz rule. The arithmetic partial derivative with respect to a prime $p$ is the $p$-th component of the…

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

A set is primitive if no element of the set divides another. We consider primitive sets of monic polynomials over a finite field and find natural generalizations of many of the results known for primitive sets of integers. In particular we…

We explicitly describe the splitting of odd integral primes in the radical extension $\mathbb{Q}(\sqrt[n]{a})$, where $x^n-a$ is an irreducible polynomial in $\mathbb{Z}[x]$. Our motivation is to classify common index divisors, the primes…

Let $K$ be a function field over an algebraically closed field $k$ of characteristic $0$, let $\varphi\in K(z)$ be a rational function of degree at least equal to $2$ for which there is no point at which $\varphi$ is totally ramified, and…

Given a function field $K$ and $\phi \in K[x]$, we study two finiteness questions related to iteration of $\phi$: whether all but finitely many terms of an orbit of $\phi$ must possess a primitive prime divisor, and whether the Galois…

This paper is continuation of the paper "Primitive roots in quadratic field". We consider an analogue of Artin's primitive root conjecture for algebraic numbers which is not a unit in real quadratic fields. Given such an algebraic number,…

Given $\mathbb{F}_{q^{n}}$, a field with $q^n$ elements, where $q $ is a prime power and $n$ is positive integer. For $r_1,r_2,m_1,m_2 \in \mathbb{N}$, $k_1,k_2 \in \mathbb{N}\cup \{0\}$, a rational function $F = \frac{F_1}{F_2}$ in…

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

We consider the algorithmic problem of computing a primitive idempotent of a central simple algebra over the field of rational functions over a finite field. The algebra is given by a set of structure constants. The problem is reduced to…