Admin: /* Degree 2 */

2018-12-05T05:49:30Z

Degree 2

← Older revision		Revision as of 05:49, 5 December 2018
Line 37:		Line 37:
	<math>		<math>
	4n^2 + 4n + 59 \qquad 0 \leq n \leq 13		4n^2 + 4n + 59 \qquad 0 \leq n \leq 13
	/math>		</math>

	<math>		<math>
Line 54:		Line 54:
	8n^2 - 488n + 7243 \qquad 0 \leq n \leq 61		8n^2 - 488n + 7243 \qquad 0 \leq n \leq 61
	</math>		</math>


	==Degree 3==		==Degree 3==

Admin at 09:41, 24 July 2017

2017-07-24T09:41:03Z

← Older revision		Revision as of 09:41, 24 July 2017
Line 1:		Line 1:
			{{ConstantsFlag}}

			==Simplest Prime Generating Polynomials==

	The most famous, due to Euler (1772):		The most famous, due to Euler (1772):

Admin: Created page with "The most famous, due to Euler (1772): $n^2 + n + 41 \qquad 0 \leq n \leq 39$ Slightly modified by Legendre (1798): $n^2 - n + 41 \qquad 1 \leq n \leq 40..."$

2017-07-24T09:40:37Z

Created page with "The most famous, due to Euler (1772): <math> n^2 + n + 41 \qquad 0 \leq n \leq 39 </math> Slightly modified by Legendre (1798): <math> n^2 - n + 41 \qquad 1 \leq n \leq 40..."

New page

The most famous, due to Euler (1772):

<math>
n^2 + n + 41 \qquad 0 \leq n \leq 39
</math>

Slightly modified by Legendre (1798):

<math>
n^2 - n + 41 \qquad 1 \leq n \leq 40
</math>

Another simple one due to Legendre was:

<math>
2 n^2 + 29 \qquad 0 \leq n \leq 28
</math>

and yet another by Lengendre:

<math>
n^2 + n + 17 \qquad 0 \leq n \leq 15
</math>

==Degree 2==

These are listed at Wolfram Mathworld's Prime Generating Polynomials page: http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html

<math>
3n^2 + 39n + 37 \qquad 0 \leq n \leq 17
</math>

<math>
4n^2 + 4n + 59 \qquad 0 \leq n \leq 13
/math>

<math>
2n^2 + 11 \qquad 0 \leq n \leq 10
</math>

<math>
7n^2 - 371n + 4871 \qquad 0 \leq n \leq 23
</math>

<math>
6n^2 - 342n + 4903 \qquad 0 \leq n \leq 57
</math>

<math>
8n^2 - 488n + 7243 \qquad 0 \leq n \leq 61
</math>

==Degree 3==

<math>
3n^3 - 183n^2 + 3318n - 18757 \qquad 0 \leq n \leq 46
</math>

==Degree 4==

<math>
n^4 - 97n^3 + 3294n^2 - 45458n + 21358 \qquad 0 \leq n \leq 49
</math>

Prime Generating Polynomials - Revision history

Admin: /* Degree 2 */

Admin at 09:41, 24 July 2017

Admin: Created page with "The most famous, due to Euler (1772): n^2 + n + 41 \qquad 0 \leq n \leq 39 Slightly modified by Legendre (1798): n^2 - n + 41 \qquad 1 \leq n \leq 40..."

Admin: Created page with "The most famous, due to Euler (1772): $n^2 + n + 41 \qquad 0 \leq n \leq 39$ Slightly modified by Legendre (1798): $n^2 - n + 41 \qquad 1 \leq n \leq 40..."$