Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with nt.number-theory
Search options not deleted
user 83307
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
1
vote
1
answer
602
views
Matrix sieve algorithm for finding prime numbers
I have derived the following theorem:
An odd positive integer $N=6n−1$ is a prime iff neither of two diophantine equations
$6x^2+(6x−1)y=n$
$6x^2+(6x+1)y=n$
has solution.
An odd positive integer …
- 11
-3
votes
1
answer
1k
views
Matrix sieve theorem [closed]
I have formulated the following conjecture:
Odd positive integer $ N=6n-1$ is a prime number iff neither of two diophantine equations
$6x^2+(6x−1)y=n$
$6x^2+(6x+1)y=n$
has solution. $x=1,2,3,..y=0 …
- 11
0
votes
0
answers
434
views
Matrix sieve algorithm
I proposed "matrix sieve" algorithm for finding primes as two pairs of 2-dimensional arrays:
positive integers which do not appear in these
arrays are indexes $k$ of primes in the sequences $S1(k)=6 …
- 11