For faster navigation, this Iframe is preloading the Wikiwand page for Grimm's conjecture.

Grimm's conjecture

In number theory, Grimm's conjecture (named after Carl Albert Grimm, 1 April 1926 – 2 January 2018) states that to each element of a set of consecutive composite numbers one can assign a distinct prime that divides it. It was first published in American Mathematical Monthly, 76(1969) 1126-1128.

Formal statement

[edit]

If n + 1, n + 2, ..., n + k are all composite numbers, then there are k distinct primes pi such that pi divides n + i for 1 ≤ i ≤ k.

Weaker version

[edit]

A weaker, though still unproven, version of this conjecture states: If there is no prime in the interval , then has at least k distinct prime divisors.

See also

[edit]

References

[edit]
  • Erdös, P.; Selfridge, J. L. (1971). "Some problems on the prime factors of consecutive integers II" (PDF). Proceedings of the Washington State University Conference on Number Theory: 13–21.
  • Grimm, C. A. (1969). "A conjecture on consecutive composite numbers". The American Mathematical Monthly. 76 (10): 1126–1128. doi:10.2307/2317188. JSTOR 2317188.
  • Guy, R. K. "Grimm's Conjecture." §B32 in Unsolved Problems in Number Theory, 3rd ed., Springer Science+Business Media, pp. 133–134, 2004. ISBN 0-387-20860-7
  • Laishram, Shanta; Murty, M. Ram (2012). "Grimm's conjecture and smooth numbers". The Michigan Mathematical Journal. 61 (1): 151–160. arXiv:1306.0765. doi:10.1307/mmj/1331222852.
  • Laishram, Shanta; Shorey, T. N. (2006). "Grimm's conjecture on consecutive integers". International Journal of Number Theory. 2 (2): 207–211. doi:10.1142/S1793042106000498.
  • Ramachandra, K. T.; Shorey, T. N.; Tijdeman, R. (1975). "On Grimm's problem relating to factorisation of a block of consecutive integers". Journal für die reine und angewandte Mathematik. 273: 109–124. doi:10.1515/crll.1975.273.109.
  • Ramachandra, K. T.; Shorey, T. N.; Tijdeman, R. (1976). "On Grimm's problem relating to factorisation of a block of consecutive integers. II". Journal für die reine und angewandte Mathematik. 288: 192–201. doi:10.1515/crll.1976.288.192.
  • Sukthankar, Neela S. (1973). "On Grimm's conjecture in algebraic number fields". Indagationes Mathematicae (Proceedings). 76 (5): 475–484. doi:10.1016/1385-7258(73)90073-5.
  • Sukthankar, Neela S. (1975). "On Grimm's conjecture in algebraic number fields. II". Indagationes Mathematicae (Proceedings). 78 (1): 13–25. doi:10.1016/1385-7258(75)90009-8.
  • Sukthankar, Neela S. (1977). "On Grimm's conjecture in algebraic number fields-III". Indagationes Mathematicae (Proceedings). 80 (4): 342–348. doi:10.1016/1385-7258(77)90030-0.
  • Weisstein, Eric W. "Grimm's Conjecture". MathWorld.
[edit]
{{bottomLinkPreText}} {{bottomLinkText}}
Grimm's conjecture
Listen to this article

This browser is not supported by Wikiwand :(
Wikiwand requires a browser with modern capabilities in order to provide you with the best reading experience.
Please download and use one of the following browsers:

This article was just edited, click to reload
This article has been deleted on Wikipedia (Why?)

Back to homepage

Please click Add in the dialog above
Please click Allow in the top-left corner,
then click Install Now in the dialog
Please click Open in the download dialog,
then click Install
Please click the "Downloads" icon in the Safari toolbar, open the first download in the list,
then click Install
{{::$root.activation.text}}

Install Wikiwand

Install on Chrome Install on Firefox
Don't forget to rate us

Tell your friends about Wikiwand!

Gmail Facebook Twitter Link

Enjoying Wikiwand?

Tell your friends and spread the love:
Share on Gmail Share on Facebook Share on Twitter Share on Buffer

Our magic isn't perfect

You can help our automatic cover photo selection by reporting an unsuitable photo.

This photo is visually disturbing This photo is not a good choice

Thank you for helping!


Your input will affect cover photo selection, along with input from other users.

X

Get ready for Wikiwand 2.0 🎉! the new version arrives on September 1st! Don't want to wait?