31: Difference between revisions

From Number
No edit summary
Line 23: Line 23:
==Prime-generating polynomials==
==Prime-generating polynomials==


Below are some polynomials that give prime numbers for small input values, which give the value 23 for suitable input choice.
Below are some polynomials that give prime numbers for small input values, which give the value 31 for suitable input choice.


{| class="sortable" border="1"
{| class="sortable" border="1"
! Polynomial !! Degree !! Some values for which it generates primes !! Input value <math>n</math> at which it generates 23
! Polynomial !! Degree !! Some values for which it generates primes !! Input value <math>n</math> at which it generates 31
|-
|-
| <math>n^2 - n + 11</math> || 2 || all numbers 1-10, because 11 is one of the [[lucky numbers of Euler]]. || 5
| <math>n^2 - n + 11</math> || 2 || all numbers 1-10, because 11 is one of the [[lucky numbers of Euler]]. || 5
|}
|}

Revision as of 21:53, 15 January 2012

This article is about a particular natural number.|View all articles on particular natural numbers

Summary

Factorization

The number is a prime number.

Properties and families

Property or family Parameter values First few numbers Proof of satisfaction/membership/containment
prime number 11th prime number 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, [SHOW MORE]View list on OEIS divide and check
Mersenne number , i.e., plug and check
Mersenne prime (both a Mersenne number and a prime number)
regular prime 10th regular prime (note that 2 is neither a regular nor an irregular prime) 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41, 43, 47, 53, 61, [SHOW MORE]View list on OEIS

Prime-generating polynomials

Below are some polynomials that give prime numbers for small input values, which give the value 31 for suitable input choice.

Polynomial Degree Some values for which it generates primes Input value at which it generates 31
2 all numbers 1-10, because 11 is one of the lucky numbers of Euler. 5