Saved in:
Bibliographic Details
Main Authors: Kagey, Peter, Rajesh, Krishna
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2410.04728
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909346621816832
author Kagey, Peter
Rajesh, Krishna
author_facet Kagey, Peter
Rajesh, Krishna
contents Ron Graham's Sequence is a surprising bijection from non-negative integers to non-negative, non-prime integers that was introduced by Ron Graham in the June 1986 "Problems" column of $\textit{Mathematics Magazine}$, and which later appeared in Problem A2 of the 2013 William Lowell Putnam Mathematical Competition. We describe some properties of this function, give an algorithm for computing its values in pseudo-polynomial time, and prove a 22 year-old conjecture about an upper bound for the function.
format Preprint
id arxiv_https___arxiv_org_abs_2410_04728
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On a Conjecture about Ron Graham's Sequence
Kagey, Peter
Rajesh, Krishna
Number Theory
Combinatorics
05A15
Ron Graham's Sequence is a surprising bijection from non-negative integers to non-negative, non-prime integers that was introduced by Ron Graham in the June 1986 "Problems" column of $\textit{Mathematics Magazine}$, and which later appeared in Problem A2 of the 2013 William Lowell Putnam Mathematical Competition. We describe some properties of this function, give an algorithm for computing its values in pseudo-polynomial time, and prove a 22 year-old conjecture about an upper bound for the function.
title On a Conjecture about Ron Graham's Sequence
topic Number Theory
Combinatorics
05A15
url https://arxiv.org/abs/2410.04728