53: Difference between revisions

Latest revision as of 01:22, 23 June 2012

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

The number 53 is a prime number.

Property or family	Parameter values	First few numbers	Proof of satisfaction/membership/containment
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] 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271 View list on OEIS	A natural number $n>1$ is prime if and only if $n$ is not divisible by any prime less than or equal to ${\sqrt {n}}$ . In this case, since ${\sqrt {53}}$ is between 7 and 8, verifying primality requires checking that 53 is not divisible by any prime up to 7, i.e., it is not divisible by 2, 3, 5, or 7.
regular prime		3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41, 43, 47, 53, 61, [SHOW MORE] 71, 73, 79, 83, 89, 97, 107, 109, 113, 127, 137, 139, 151, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 239, 241, 251, 269, 277, 281, 313, 317, 331, 337, 349, 359, 367, 373, 383, 397, 419, 431 View list on OEIS

Item	Value
unique (up to plus/minus and ordering) representation as sum of two squares	$7^{2}+2^{2}$ . Note that existence and uniqueness both follow from it being a prime that is 1 mod 4. This also corresponds to the factorization $53=(7+2i)(7-2i)$ in the ring of Gaussian integers $\mathbb {Z} [i]$ .
representations as sum of three squares (up to ordering and plus/minus equivalence)	$7^{2}+2^{2}+0^{2}$ $6^{2}+4^{2}+1^{2}$

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

Polynomial	Degree	Some values for which it generates primes	Input value $n$ at which it generates 53
$n^{2}-n+11$	2	all numbers 1-10, because 11 is one of the lucky numbers of Euler.	7
$n^{2}-n+41$	2	all numbers 1-40, because 41 is one of the lucky numbers of Euler.	4

@@ Line 9: / Line 9: @@
 ===Properties and families===
-{{fillin}}
+{| class="sortable" border="1"
+! Property or family !! Parameter values !! First few numbers !! Proof of satisfaction/membership/containment
+|-
+| [[satisfies property::prime number]] || || {{#lst:prime number|list}} || {{divide and check up to sqrt}} In this case, since <math>\sqrt{53}</math> is between 7 and 8, verifying primality requires checking that 53 is not divisible by any prime up to 7, i.e., it is not divisible by [[2]], [[3]], [[5]], or [[7]].
+|-
+| [[satisfies property::regular prime]] || || {{#lst:regular prime|list}} ||
+|}
+==Waring representations==
+===Sums of squares===
+{{square sums facts to check against}}
+{| class="sortable" border="1"
+! Item !! Value
+|-
+| unique (up to plus/minus and ordering) representation as sum of two squares || <math>7^2 + 2^2</math>. Note that existence and uniqueness both follow from it being a prime that is 1 mod 4.<br>This also corresponds to the factorization <math>53 = (7 + 2i)(7 - 2i)</math> in the [[ring of Gaussian integers]] <math>\mathbb{Z}[i]</math>.
+|-
+| representations as sum of three squares (up to ordering and plus/minus equivalence) || <math>7^2 + 2^2 + 0^2</math><br><math>6^2 + 4^2 + 1^2</math>
+|}
 ==Prime-generating polynomials==