Related papers: On primes p for which d divides ord_p(g)

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

Let $C_n$ be the $n$th Catalan number. We show that the asymptotic density of the set $\{n: C_n \equiv 0 \mod p \}$ is $1$ for all primes $p$, We also show that if $n = p^k -1$ then $C_n \equiv -1 \mod p$. Finally we show that if $n \equiv…

In this note we extend some of the results of a previous paper \url{arXiv:math/0511593} to algebraically closed fields of finite characteristic. In particular, we show that there is an explicit expression in $n$ and $d$ which is divisible…

Let $s\geq 8$ be an integer and $P$ be a set of primes with relative lower density greater than $\sqrt{1-\min\{s,16\}/32}$. We prove that every sufficiently large integer $n\equiv s({\rm mod}24)$ can be represented by a sum of $s$ squares…

Let G be a primitive permutation group on a finite set Omega. Let p^2 divide |G|, for a prime p. We show that when G is solvable, there exists a subset of Omega whose stabilizer S has the property that 1<|S|_p<|G|_p. We offer a counting…

By defining the dimension of natural numbers as the number of prime factors, all natural numbers smaller than 2^(n+1) (n is a natural number) can be classified by their dimensions, and the count of numbers of each dimension gives a…

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of…

Let $p$ be an odd prime number. In this article, we study the number of quadratic residues and non-residues modulo $p$ which are multiples of $2$ or $3$ or $4$ and lying in the interval $[1, p-1]$, by applying the Dirichlet's class number…

The order and disorder of binary representations of the natural numbers < 2^8 is measured using the BiEntropy function. Significant differences are detected between the primes and the non primes. The BiEntropic prime density is shown to be…

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

Given a pair of distinct non-CM normalized eigenforms having integer Fourier coefficients $a_1 (n)$ and $a_2(n)$, we count positive integers $n$ with $(a_1(n), a_2(n))=1$ and make a conjecture about the density of the set of primes $p$ for…

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

In this work, the author shows a sufficient and necessary condition for an integer of the form $(zn-y^n)/(z-y)$ to be divisible by some perfect $mth$ power $p$, where $p$ is an odd prime and $m$ is a positive integer. A constructive method…

We consider the problem of sums of dilates in groups of prime order. We show that given $A\subset \Z{p}$ of sufficiently small density then $$\big| \lambda_{1}A+\lambda_{2}A+...+ \lambda_{k}A \big|…