Related papers: Popular values of the largest prime divisor functi…

Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of…

By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.

The objective of this paper is to introduce an approach to the study of the nonasymptotic distribution of prime numbers. The natural numbers are represented by theorem 1 in the matrix form ^2N. The first column of the infinite matrix ^2N…

In this note, we represent integers in a type of factoradic notation. Rather than use the corresponding Lehmer code, we will view integers as permutations. Given a pair of integers n and k, we give a formula for n mod k in terms of the…

Let $(p_n)$ denote the sequence of prime numbers, with $2=p_1<p_2<\ldots$. We demonstrate the existence of an irrational number $\alpha$ having the property that the sequence $(\alpha p_n)$ is not well-distributed modulo $1$.

We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…

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…

The prime number 357686312646216567629137 is notable because of the unusual property that it remains prime successively on removing the left digit until there are no remaining digits. We explore here the distributions of the number of left…

Let omega(n) be the number of distinct prime factors dividing n and m > n natural numbers. We calculate a formula showing which prime numbers in which intervals divide a given binomial coefficient. From this formula we get an identity…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

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…

This paper deals with function field analogues of famous theorems of Laudau which counted the number of integers which have $t$ prime factors and R. Hall which researched the distribution of divisors of integers in residue classes.\;We…

A hypothesis is put forward regarding the function $\pi_2(x)$ which describes the distribution of twin primes in the set of natural numbers. The function $\pi_2(x)$ is tested by evaluation and an empirical $\pi_2^{\ast}(x)$ is arrived at,…

Let $P(m)$ denote the greatest prime factor of $m$. For integer $a>1$, M. Ram Murty and S. Wong proved that, under the assumption of the ABC conjecture, $$P(a^n-1)\gg_{\epsilon, a} n^{2-\epsilon}$$ for any $\epsilon>0$. We study analogues…

Let $x>1$ be a large number. This note shows that the largest prime factor of the quadratic product $\prod_{x\leq n\leq 2x}\left(n^2+1 \right)$ satisfies the relation $p \geq x^{3/2}$ as $x$ tends to infinity. This improves the current…

One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results…

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…

Let $\omega^*(n)$ denote the number of divisors of $n$ that are shifted primes, that is, the number of divisors of $n$ of the form $p-1$, with $p$ prime. Studied by Prachar in an influential paper from 70 years ago, the higher moments of…

The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…