Related papers: Primitive prime divisors in zero orbits of polynom…

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

Let $\theta$ be an algebraic integer and $f(x)=x^{n}+ax^{n-1}+bx+c$ be the minimal polynomial of $\theta$ over the rationals. Let $K=\mathbb{Q}(\theta)$ be a number field and $\mathcal{O}_{K}$ be the ring of integers of $K.$ In this…

In this article, we disprove a conjecture of F. Alarc\'on and D. Anderson and give a complete classification of the prime ideals in the one variable polynomial semiring with coefficients in Boolean semifield. We group the prime ideals of…

Suppose that $G$ is a finite solvable group and $V$ is a finite, faithful and completely reducible $G$-module. Let $N$ be a nilpotent subgroup of $G$, then there exits $v \in V$ such that $|\bC_N(v)| \leq (|N|/p)^{1/p}$, where $p$ is the…

We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary…

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

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.

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having…

In this note we describe a method for finding prime numbers as fixed points of particularly simple sequences. Some basic calculations show that success rates for identifying primes this way are over 99.9%. In particular, it seems that the…

Let $q=p^k$ be a prime power, let $n\geq2$ be an integer and let $\mathbb{F}_{q^n}$ be a finite field. It is shown that the set of primitive normal elements is a Salem set. Furthermore, it is proved that this set is strongly equidistributed…

We denote $\mathcal{P}$ = $\{P(x)|$ $P(n) \mid n!$ for infinitely many $n\}$. This article identifies some polynomials that belong to $\mathcal{P}$. Additionally, we also denote $P^+(m)$ as the largest prime factor of $m$. Then, a…

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

In this paper, we study the critical orbit of a post-critically finite polynomial of the form $f_{c,d}(x) = x^d+c \in \mathbb{C}[x]$. We discover that in many cases the orbit elements satisfy some strong arithmetic properties. It is well…

We discuss analogues of the prime number theorem for a hyperbolic rational map f of degree at least two on the Riemann sphere. More precisely, we provide counting estimates for the number of primitive periodic orbits of f ordered by their…

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

The purpose of this note is to suggest an analogue for genus 2 curves of part of Gross and Zagier's work on elliptic curves. Experimentally, for genus 2 curves with CM by a quartic CM field K, it appears that primes dividing the…