Cramer's conjecture - Revision history

Asdf at 01:10, 20 August 2009

2009-08-20T01:10:57Z

← Older revision		Revision as of 18:10, 19 August 2009
Line 1:		Line 1:
	'''Cramér's conjecture''' asserts that the largest gap between adjacent primes of size N should be <math>O(\log^2 N)</math>. This is compatible with [[Cramer's random model for the primes]], and specifically with the belief that the number of primes in <math>[n,n+\log n]</math> should resemble a Poisson distribution asymptotically.		'''Cramér's conjecture''' asserts that the largest gap between adjacent primes of size N should be <math>O(\log^2 N)</math>. This is compatible with [[Cramer's random model for the primes]], and specifically with the belief that the number of primes in <math>[n,n+\log n]</math> should resemble a Poisson distribution asymptotically.

	If this conjecture is true, one has an easy positive answer to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.		If this conjecture is true, one has an [[An efficient algorithm exists if Cramer's conjecture holds\|easy positive answer]] to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.

	# [[wikipedia:Cramér's_conjecture\|Wikipedia entry on Cramér'~~s_conjecture~~]]		# [[wikipedia:Cramér's_conjecture\|Wikipedia entry on Cramér's conjecture]]

Asdf at 01:05, 20 August 2009

2009-08-20T01:05:05Z

← Older revision		Revision as of 18:05, 19 August 2009
Line 1:		Line 1:
	'''Cramér'~~s_conjecture~~''' asserts that the largest gap between adjacent primes of size N should be <math>O(\log^2 N)</math>. This is compatible with [[Cramer's random model for the primes]], and specifically with the belief that the number of primes in <math>[n,n+\log n]</math> should resemble a Poisson distribution asymptotically.		'''Cramér's conjecture''' asserts that the largest gap between adjacent primes of size N should be <math>O(\log^2 N)</math>. This is compatible with [[Cramer's random model for the primes]], and specifically with the belief that the number of primes in <math>[n,n+\log n]</math> should resemble a Poisson distribution asymptotically.

	If this conjecture is true, one has an easy positive answer to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.		If this conjecture is true, one has an easy positive answer to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.

	# [[wikipedia:Cramér's_conjecture\|Wikipedia entry on Cramér's_conjecture]]		# [[wikipedia:Cramér's_conjecture\|Wikipedia entry on Cramér's_conjecture]]

Asdf at 01:04, 20 August 2009

2009-08-20T01:04:47Z

← Older revision		Revision as of 18:04, 19 August 2009
Line 1:		Line 1:
	~~Cramer~~'~~s conjecture~~ asserts that the largest gap between adjacent primes of size N should be <math>O(\log^2 N)</math>. This is compatible with [[Cramer's random model for the primes]], and specifically with the belief that the number of primes in <math>[n,n+\log n]</math> should resemble a Poisson distribution asymptotically.		'''Cramér's_conjecture''' asserts that the largest gap between adjacent primes of size N should be <math>O(\log^2 N)</math>. This is compatible with [[Cramer's random model for the primes]], and specifically with the belief that the number of primes in <math>[n,n+\log n]</math> should resemble a Poisson distribution asymptotically.

	If this conjecture is true, one has an easy positive answer to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.		If this conjecture is true, one has an easy positive answer to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.

	# [~~http~~:~~//en.wikipedia.org/wiki/Cram%C3%A9r%27s_conjecture~~ Wikipedia entry on ~~Cramer~~'~~s conjecture~~]		# [[wikipedia:Cramér's_conjecture\|Wikipedia entry on Cramér's_conjecture]]

Teorth at 17:45, 8 August 2009

2009-08-08T17:45:52Z

← Older revision		Revision as of 10:45, 8 August 2009
Line 2:		Line 2:

	If this conjecture is true, one has an easy positive answer to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.		If this conjecture is true, one has an easy positive answer to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.

			# [http://en.wikipedia.org/wiki/Cram%C3%A9r%27s_conjecture Wikipedia entry on Cramer's conjecture]

Teorth: New page: Cramer's conjecture asserts that the largest gap between adjacent primes of size N should be $O(\log^2 N)$ . This is compatible with Cramer's random model for the primes, an...

2009-08-08T17:45:31Z

New page: Cramer's conjecture asserts that the largest gap between adjacent primes of size N should be <math>O(\log^2 N)</math>. This is compatible with Cramer's random model for the primes, an...

New page

Cramer's conjecture asserts that the largest gap between adjacent primes of size N should be <math>O(\log^2 N)</math>. This is compatible with [[Cramer's random model for the primes]], and specifically with the belief that the number of primes in <math>[n,n+\log n]</math> should resemble a Poisson distribution asymptotically.

If this conjecture is true, one has an easy positive answer to the [[finding primes]] project in the strongest form; one simply searches an interval of the form <math>[N, N+O(\log^2 N)]</math> for primes, where N is your favourite k-digit number.

Cramer's conjecture - Revision history

Asdf at 01:10, 20 August 2009

Asdf at 01:05, 20 August 2009

Asdf at 01:04, 20 August 2009

Teorth at 17:45, 8 August 2009

Teorth: New page: Cramer's conjecture asserts that the largest gap between adjacent primes of size N should be O(\log^2 N). This is compatible with Cramer's random model for the primes, an...

Teorth: New page: Cramer's conjecture asserts that the largest gap between adjacent primes of size N should be $O(\log^2 N)$ . This is compatible with Cramer's random model for the primes, an...