PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
near-square prime (Definition)

A near-square prime is a prime number $p$ of the form $n^2 + k$ , with $n$ being any integer and $0 < |k| < |n|$ also an integer. Since for any nonzero real number $x$ it is always the case that $x^2 \geq 0$ , it doesn't matter if $n$ is negative.

5                       149
4         29   53          
3               67   103    
2     11           83      
1   5   17   37       101    
0 1 4 9 16 25 36 49 64 81 100 121 144
$-1$   3                    
$-2$     7   23   47   79      
$-3$                   97    
$-4$                        
$-5$           31   59       139

Fermat primes are near-square primes for $k = 1$ with the additional requirement that $n = 2^{2^m - 1}$ , while Carol primes are near-square primes for $k = -2$ with the additional requirement that $n = 2^m - 1$ .

For $k = -1$ , only $n = 2$ gives a prime, namely 3.




"near-square prime" is owned by PrimeFan.
(view preamble | get metadata)

View style:

Log in to rate this entry.
(view current ratings)

Cross-references: Fermat primes, negative, real number, integer, prime number

This is version 3 of near-square prime, born on 2009-06-12, modified 2009-06-17.
Object id is 11818, canonical name is NearSquarePrime.
Accessed 388 times total.

Classification:
AMS MSC11A41 (Number theory :: Elementary number theory :: Primes)

Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)