```
1: 0
2: 0 0
3: 0 1 0
4: 0 1 0 0
...
```

1 is divisible by 1.

2 is divisible by 1 and 2.

3 is divisible by 1 and 3, and has a remainder of 1 when divided by 2.

4 is divisible by 1, 2 and 4, and has a remainder of 1 when divided by 3.

..

Notice that the modulos are in the reverse order, such that the first number on a line is n modulo n, and the next is n modulo (n-1).

This is a screenshot of a text editor with the pattern for the first 300 numbers or so, with 0 highlighted.

You get a bunch of lines! The leftmost line is the n%n line. All numbers are divisible by themselves. The next line is n%(n/2), all numbers that are divisible by 2, are also divisible by themselves divided by two. The pattern continues like this, the next line being n%(n/3).

```
..
18: 000 001 002 003 004 005 006 007 008 000 002 004 000 003 002 000 000 000
19: 000 001 002 003 004 005 006 007 008 009 001 003 005 001 004 003 001 001 000
20: 000 001 002 003 004 005 006 007 008 009 000 002 004 006 002 000 000 002 000 000
21: 000 001 002 003 004 005 006 007 008 009 010 001 003 005 000 003 001 001 000 001 000
..
```

Notice that between the 1 and 2 line, the modulos are incrementing by one up to ceiling(n/2-1). After the 2 line, everything increments by 2.

You also see a example of diagonal incrementation lines, that is, you can pick any of the modulo numbers, go one down and one to the right, and that number is going to be one greater than the number that you came from, unless it is zero.

Consider 6:

```
06: 000 001 002 000 000 000
07: 000
08: 000
09: 000
10: 002
11: 001
12: 000
13: 006
14: 006
15: 006
...
```

If you flip this sequence 90 degrees, it is going to replicate:

6 is divisible by 1, therefor 7 is divisible by 1.

6 is divisible by 2, therefor 8 is divisible by 2.

6 is divisible by 3, therefor 9 is divisible by 3.

6 has a remainder of 2 when divided by 4, therefor 10 has a remainder of 2 when divided by 4.

6 has a remainder of 1 when divided by 5, therefor 11 has a remainder of 1 when divided by 5.

6 is divisible by 6, therefor 12 is divisible by 6.

after this point, 6 is just going to repeat infinitely downwards. This pattern is true for all numbers, and primes are just the unlucky numbers that didn't get any zeroes.

I am sure that there are a lot more patterns that I didn't cover, so I'm gonna leave that to the comment section

Haskell program that generates the first 1000 lines in case anyone want it:

```
mods x = map (mod x) [1..x]
mods' = map mods [1..]
show' x = replicate 3 - length (show x) '0' ++ show x
main = putStrLn . unlines . map (unwords.map show'.reverse) $ take 1000 mods'
```

http://math.stackexchange.com/questions … -variables

For the equation:

You can record such decisions.

Or.

For the equation.

You can record such decisions.

Or.

]]>1. There are regular gaps of **4** between primes

2. These gaps of **4** have varying remainders for 4, (either 1 or 3)

A= 3x5x7x11x13x17............(x next prime in series)

x = the next prime above highest prime in A used

p and p+4 are prime

(A - p)/2 = twin prime

(A-(p+4))/2 = twin prime

**Example:**

A= 3x5x7= 105

x=11

A has remainder=1 for 4

2 Primes = 67 and 71

67 and 71 have remainder=3 for 4, which is different from A

(105-67)/2 = 19

(105-71)/2 = 17

Twin primes!

A= 3, 15, 105, 1155, 15015 x next prime in the series................

p= prime or not factorable by any primes in A

and a gap of 2, therefore a p+1 can NOT be a prime because p+2 can not be prime

and a gap of 4, therefore a gap of 4 can not occur because p+2 can not be prime

OR and a gap of 4, therefore a gap of 4 can not occur because p+1 can not be prime

With a gap of 4, one number minused from A will be divisible by 4 or 2. If one is divisible by a higher than 4, the other can't be because the gap would have to be higher than 4 for the remainders to match. Therefore we can express a gap of 4 using the above equations, where if one number is divisible by a greater than 4 this will be p+1 an even no. and p is what was divisible by 4 but no higher.

and a gap of 8, therefore a gap of 8 can not occur because p+4 can not be prime

and a gap of 8, therefore a gap of 8 can not occur because p+2 can not be prime

and a gap of 8, therefore a gap of 8 can not occur because p+1 can not be prime

With a gap of 8, one number minused from A will be divisible by 2,4 or 8. If one is divisible by a higher than 8, the other can't be because the gap would have to be higher than 8 for the remainders to match. Therefore we can express a gap of 8 using the above equations, where if one number is divisible by a greater than 8 this will be p+1 an even no. and p is what is divisible by 8 but no higher.

Divide A by 3 and multiply by 2

another p

and a gap of 6, therefore a gap of 6 can not occur because p+2 can not be prime

With a gap of 6, one number minused from A will be divisible by 3. If one is divisible by a higher than 3, the other can't be because the gap would have to be higher than 6 for the remainders to match. Therefore we can express a gap of 6 using the above equation, where if one number is divisible by a greater than 3 this will be p+2 and p is what is divisible by 3 but no higher.

Divide A by 5 and multiply by 2

another p

and a gap of 10, therefore a gap of 10 can not occur because p+2 can not be prime

With a gap of 10, one number minused from A will be divisible by 5. If one is divisible by a higher than 5, the other can't be because the gap would have to be higher than 10 for the remainders to match. Therefore we can express a gap of 10 using the above equations, where if one number is divisible by a greater than 5 this will be p+2 and p is what is divisible by 5 but no higher.

**..........And so on until a gap that must be >2 becomes a gap that must be >infinity, there therefore must be an infinite No. of twin primes.**

]]>

check p is not a square

where a+b is a factor and a-b is another factor

if p is prime you will not find any factors

if p is composite you will find factors.

Example:

p=33

27*33=891

46+35=81=27*3 46-35=11

factors for 33 are 3 and 11]]>

Nice model.

]]>a=Square Root of without the decimal numbers

(A constant)

New Prime=

Where

Example:

Prime Sequence

2

3

5

7

11

13

17

19

23

Value of a

1

1

2

2

3

3

4

4

4

Value of b

1

2

1

3

2

4

1

3

7

New Prime

2

3

3

5

5

7

5

7

11

Another Larger Sequence

Prime Sequence

93703

93719

93739

93761

93763

93787

93809

Value of a

306

306

306

306

306

306

306

Value of b

67

83

103

125

127

151

173

New Prime

373

389

409

431

433

457

479

Perhaps there are lengthy new prime listing could be generated from the normal prime sequence.

]]>Moved into Mathematics Teaching Resources

http://www.mathisfunforum.com/viewtopic.php?id=22506

Bob

]]>By taking the mean and the standard deviation a couple of guessers could get together and do better than a single one. How much better? That would depend on the sd. But would that increase the expectation of the guessers? Probably not.

]]>There are no more primes after prime, z.

A=3*5*7*11*13*17*19*23*29*31............................................*z.

p= No. not factorable by any primes in A or 2.

p+/-1= otherwise A - 2p and A- 2p +/-2= twin primes.

Some gaps must be >4 as p+1 and p+4-1=.

No room for .

These gaps must be >6 as p+1 and p+3 and p+6-1=.

Again no room for .

And so on until gaps that must be >2 become gaps that must be >infinity.]]>