Grimm's conjecture

In mathematics, specifically in number theory, Grimm's conjecture states that, for every set of consecutive composite numbers, there is an equally sized set of prime numbers, and a bijection that maps each composite in the former set to a prime in the latter set that it is divisible by. It was first proposed by Carl Albert Grimm in 1969.

Though still unproven, the conjecture has been verified for all .

This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.