Repeatedly appending any digit to generate composite numbers

DOI10.4169/AMER.MATH.MONTHLY.121.05.416MaRDI QIDQ2928637zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jon Grantham, Witold Jarnicki, J. H. Rickert, Stan Wagon

Publication date 10 November 2014

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.05023

zbMATH Keywords

covering setsprime numbers

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Primes (11A41) Factorization; primality (11A51)

Abstract: We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits such that repeatedly appending {it any} digit yields a composite number.

Recommendations

• Appending digits to generate an infinite sequence of composite numbers
• Primes that become composite after changing an arbitrary digit
• When does appending the same digit repeatedly on the right of a positive integer generate a sequence of composite integers?
• Generating composite sequences by appending digits to special types of integers
• The composite two-step

Cited in

(6)

• The composite two-step
• Digitally delicate primes
• Appending digits to generate an infinite sequence of composite numbers
• When does appending the same digit repeatedly on the right of a positive integer generate a sequence of composite integers?
• Generating composite sequences by appending digits to special types of integers
• Composites that remain composite after changing a digit

This page was built for publication: Repeatedly appending any digit to generate composite numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928637)