Content deleted Content added
m templatize refs |
m Open access bot: doi updated in citation with #oabot. |
||
(11 intermediate revisions by 9 users not shown) | |||
Line 1:
{{short description|Result on simultaneous representation of primes by quadratic forms}}
In [[mathematics]], '''Kaplansky's theorem on quadratic forms''' is a result on simultaneous representation of [[Prime number|primes]] by [[quadratic forms]]. It was proved in 2003 by | last = Kaplansky | first = Irving | authorlink = Irving Kaplansky
| doi = 10.1090/S0002-9939-03-07022-9
Line 8 ⟶ 9:
| title = The forms {{math|''x'' + 32''y''<sup>2</sup> and ''x'' + 64''y''^2}} {{sic}}
| volume = 131
| year = 2003
}}.</ref>
==Statement of the theorem==
Kaplansky's theorem states that a prime ''p'' [[Modular arithmetic|congruent to 1 modulo 16]] is representable by both or none of ''x''<sup>2</sup> + 32''y''<sup>2</sup> and ''x''<sup>2</sup> + 64''y''<sup>2</sup>, whereas a prime ''p'' congruent to 9 modulo 16 is representable by exactly one of these quadratic forms.
Line 20 ⟶ 21:
| mr = 1028322
| publisher = John Wiley & Sons
| title = Primes of the form {{math|
| year = 1989}}.</ref>
==Proof==
Kaplansky's proof uses the facts that 2 is a 4th power modulo ''p'' if and only if ''p'' is representable by ''x''<sup>2</sup> + 64''y''<sup>2</sup>, and that −4 is an 8th power modulo ''p'' if and only if ''p'' is representable by ''x''<sup>2</sup> + 32''y''<sup>2</sup>.
==Examples==
*The prime ''p'' = 17 is congruent to 1 modulo 16 and is representable by neither ''x''<sup>2</sup> + 32''y''<sup>2</sup> nor ''x''<sup>2</sup> + 64''y''<sup>2</sup>.
*The prime ''p'' =
*The prime ''p'' =
*The prime ''p'' = 73 is congruent to 9 modulo 16 and is representable by ''x''<sup>2</sup> + 64''y''<sup>2</sup> (since 73 = 3<sup>2</sup> +
▲*The prime ''p'' = 41 is congruent to 9 modulo 16 and is representable by ''x''<sup>2</sup> + 32''y''<sup>2</sup> (since 41 = 3<sup>2</sup> + 32×1<sup>2</sup>), but not by ''x''<sup>2</sup> + 64''y''<sup>2</sup>.
▲*The prime ''p'' = 73 is congruent to 9 modulo 16 and is representable by ''x''<sup>2</sup> + 64''y''<sup>2</sup> (since 73 = 3<sup>2</sup> + 64×1<sup>2</sup>), but not by ''x''<sup>2</sup> + 32''y''<sup>2</sup>.
==Similar results==
Five results similar to Kaplansky's theorem are known:<ref>{{citation▼
▲Five results similar to Kaplansky's theorem are known<ref>{{citation
| last = Brink | first = David
| doi = 10.1016/j.jnt.2008.04.007
Line 48 ⟶ 43:
| title = Five peculiar theorems on simultaneous representation of primes by quadratic forms
| volume = 129
| year = 2009
}}.</ref>
*A prime ''p'' congruent to 1 modulo 20 is representable by both or none of ''x''<sup>2</sup> + 20''y''<sup>2</sup> and ''x''<sup>2</sup> + 100''y''<sup>2</sup>, whereas a prime ''p'' congruent to 9 modulo 20 is representable by exactly one of these quadratic forms.
*A prime ''p'' congruent to 1, 16 or 22 modulo 39 is representable by both or none of ''x''<sup>2</sup> + ''xy'' + 10''y''<sup>2</sup> and ''x''<sup>2</sup> + ''xy'' + 127''y''<sup>2</sup>, whereas a prime ''p'' congruent to 4, 10 or 25 modulo 39 is representable by exactly one of these quadratic forms.
*A prime ''p'' congruent to 1, 16, 26, 31 or 36 modulo 55 is representable by both or none of ''x''<sup>2</sup> + ''xy'' + 14''y''<sup>2</sup> and ''x''<sup>2</sup> + ''xy'' + 69''y''<sup>2</sup>, whereas a prime ''p'' congruent to 4, 9, 14, 34 or 49 modulo 55 is representable by exactly one of these quadratic forms.
*A prime ''p'' congruent to 1, 65 or 81 modulo 112 is representable by both or none of ''x''<sup>2</sup> + 14''y''<sup>2</sup> and ''x''<sup>2</sup> + 448''y''<sup>2</sup>, whereas a prime ''p'' congruent to 9, 25 or 57 modulo 112 is representable by exactly one of these quadratic forms.
*A prime ''p'' congruent to 1 or 169 modulo 240 is representable by both or none of ''x''<sup>2</sup> + 150''y''<sup>2</sup> and ''x''<sup>2</sup> + 960''y''<sup>2</sup>, whereas a prime ''p'' congruent to 49 or 121 modulo 240 is representable by exactly one of these quadratic forms.
Line 63 ⟶ 55:
==Notes==
{{reflist}}
|