Searcharxiv⌕ Search

arXiv subjects

Randell Heyman

Publications and source records attributed to Randell Heyman.

At least 19 recordsLinked to original sources
arXiv2023

On some floor function sets

Let $X$ be a positive integer and $t$ a real number great than 1. The family of sets $\left\{\big\lfloor\frac{X}{n^t}\big\rfloor ~:~ 1\leq n\leq X\right\}$ have an interesting prime distribution property. We give an exact formula for the cardinality of these sets. We provide an estimate for the cardinality of the set $\left\{\big\lfloor\frac{X}{p}\big\rfloor ~:~ p~ \text{prime},~ p\leq X\right\}$. For positive real $X$, we derive asymptotic formulas for the cardinality of the set $\big\{\lfloor f(n)\rfloor ~:~ 1\leq n\leq X\big\}$ for various sets of functions.

math.NT↗
arXiv2023

Sparse sets that satisfy the prime number theorem

We investigate various sparse sets that satisfy the prime number theorem. The sparsest of these sets, $\{\lfloor x/n^t \rfloor:n \le x\}$, has density approaching $1/x$ as $t$ approaches infinity.

math.NT↗
arXiv2022

Estimates for $k$-dimensional spherical summations of arithmetic functions of the GCD and LCM

Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1^2+\cdots+ n_k^2\le x} F(n_1,\ldots,n_k)$, taken over the $k$-dimensional spherical region $\{(n_1,\ldots,n_k)\in {\Bbb Z}^k: n_1^2+\cdots+ n_k^2\le x\}$, where $F:{\Bbb Z}^k\to {\Bbb C}$ is a given function. In particular, we deduce asymptotic formulas with remainder terms for the spherical summations $\sum_{n_1^2+\cdots+ n_k^2\le x} f((n_1,\ldots,n_k))$ and $\sum_{n_1^2+\cdots+ n_k^2\le x} f([n_1,\ldots,n_k])$, involving the GCD and LCM of the integers $n_1,\ldots,n_k$, where $f:{\Bbb N}\to {\Bbb C}$ belongs to certain classes of functions.

math.NT↗
arXiv2022

Hyperbolic summation for functions of the GCD and LCM of several integers

Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1\cdots n_k\le x} F(n_1,\ldots,n_k)$, taken over the hyperbolic region $\{(n_1,\ldots,n_k)\in {\Bbb N}^k: n_1\cdots n_k\le x\}$, where $F:{\Bbb N}^k\to {\Bbb C}$ is a given function. In particular, we deduce asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{n_1\cdots n_k\le x} f((n_1,\ldots,n_k))$ and $\sum_{n_1\cdots n_k\le x} f([n_1,\ldots,n_k])$, involving the GCD and LCM of the integers $n_1,\ldots,n_k$, where $f:{\Bbb N}\to {\Bbb C}$ belongs to certain classes of functions. Some of our results generalize those obtained by the authors for $k=2$.

math.NT↗
arXiv2021

Primes in floor function sets

Let $x$ be a positive integer. We give an asymptotic formula for the number of primes in the set $\{\fl{x/n}, 1 \le n \le x\}$ and give some related results.

math.NT↗
arXiv2020

On certain sums of arithmetic functions involving the gcd and lcm of two positive integers

We obtain asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{mn\le x} f((m,n))$ and $\sum_{mn\le x} f([m,n])$, where $f$ belongs to certain classes of arithmetic functions, $(m,n)$ and $[m,n]$ denoting the gcd and lcm of the integers $m,n$. In particular, we investigate the functions $f(n)=\tau(n), \log n, \omega(n)$ and $\Omega(n)$. We also define a common generalization of the latter three functions, and prove a corresponding result.

math.NT↗
arXiv2019

Cardinality of a floor function set

Fix a positive integer X. We quantify the cardinality of the set $\{\lfloor X/n \rfloor\}_{n=1}^X$. We discuss restricting the set to those elements that are prime, semiprime or similar.

math.NT↗
arXiv2018

On a sum involving the Euler function

We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the reciprocals of integers.

math.NT↗
arXiv2016

Evaluationally coprime linear polynomials

Two polynomials, $f,g \in \mathbb{Z}[x]$ are evaluationally coprime at x if $\gcd(f(x),g(x))=1$. We give necessary and sufficient conditions for two such linear polynomials to have a positive proportion of evaluated coprime values.

math.NT↗
arXiv2014

Pairwise non-coprimality of triples

We say that $(a_1,...,a_k)$ is pairwise non-coprime if $\gcd(a_i,a_j) \ne 1$ for all $1 \le i <j \le k$. Let $a_1,a_2,a_3$ be positive integers less than $H$. We obtain an asymptotic formula for the number of $(a_1,a_2,a_3)$ that are pairwise non-coprime. The probability that a randomly chosen unbounded positive integer triple is pairwise non-coprime is approximately 17.4%. Let $φ(n)$ be the Euler totient function. We also give an upper bound on the error term in an asymptotic formula for $\sum_{n=1}^H (φ(n)/n)^m$ for $m \ge 2$ and as $H \rightarrow \infty$.

math.NT↗
arXiv2014

Counting tuples restricted by coprimality conditions

Given a set $A=\{(i_1,j_1),\ldots,(i_m,j_m)\}$ we say that $(a_1,\ldots,a_v)$ exhibits pairwise coprimality if $\gcd(a_i,a_j) = 1$ for all $(i,j)\in A$. For a given positive $x$ we give an asymptotic formula for the number of $(a_1,\ldots,a_v)$ with $1 \le a_1,\ldots,a_v \le x$ that exhibit pairwise coprimality. Our error term is better than that of Hu.

math.NT↗
arXiv2014

On the Greatest Common Divisor of Shifted Sets

Given a set of $n$ positive integers $\{a_1, \ldots, a_n\}$ and an integer parameter $H$ we study small additive shifts of its elements by integers $h_i$ with $|h_i| \le H$, $i =1, \ldots, n$, such that the greatest common divisor of $a_1+h_1, \ldots, a_n+h_n$ is very different from that of $a_1, \ldots, a_n$. We also consider a similar problem for the least common multiple.

math.NT↗
arXiv2013

On the number of polynomials of bounded height that satisfy Dumas's criterion

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$ approaches infinity. We also show that, for a fixed degree, the density of Dumas polynomials in all irreducible integer coefficient polynomials is strictly less than 1.

math.NT↗
arXiv2013

On the Number of Eisenstein Polynomials of Bounded Height

We obtain a more precise version of an asymptotic formula of A. Dubickas for the number of monic Eisenstein polynomials of fixed degree $d$ and of height at most $H$, as $H\to \infty$. In particular, we give an explicit bound for the error term. We also obtain an asymptotic formula for arbitrary Eisenstein polynomials of height at most $H$.

math.NT↗