Search arXivSearch

arXiv · 2504.19196

On a Generalisation of a Function of Ron Graham's

Abstract

Ron Graham introduced a function, $g(n)$, on the non-negative integers, in the 1986 Issue $3$ Problems column of \textit{Mathematical Magazine}: For each non-negative integer $n$, $g(n)$ is the least integer $s$ so that the integers $n + 1, n + 2, \ldots , s-1, s$ contain a subset of integers, the product of whose members with $n$ is a square. Recently, many results about $g(n)$ were proved in [Kagey and Rajesh, ArXiv:2410.04728, 2024] and they conjectured a characterization of which $n$ satisfied $g(n)=2n$. For $m\geq 2$, they also introduced generalizations of $g(n)$ to $m$-th powers to explore. In this paper, we prove their conjecture and provide some results about these generalisations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sarosh Adenwalla. 2025-05-08. On a Generalisation of a Function of Ron Graham's. https://arxiv.org/abs/2504.19196

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT