This work is licensed by its author, Gary William Croft, under a

Creative Commons Attribution-ShareAlike 3.0 Unported License.

**Return to www.primesdemystified.com Home Page**

The first 1000 prime numbers are silently screaming: "Humans, pay attention to us! We hold the secret to the distribution of *all* prime numbers." We have listened long and hard, and will provide what we believe to be compelling evidence that the 1000th prime number, 7919, is the perfectly positioned cornerstone of a geometry with highly organized substructures dually enveloped by 89^{2} and 7920.

It is no accident that this page's header image is of a 4-sided pyramid. What this archetypal shape has to do with the first 1000 prime numbers will be revealed near the end of this section, where we unearth the 'Tomb of the First 1000 Primes.' For now we will be coy and state that the secret of the pyramid lies with two 4-times triangular numbers: The first, **2112** (4 x triangular number 528), equates to the total number of elements used to construct the pyramid subdivided into its four lateral faces; 2112 is thus the index number of the 1000th prime as a member of this domain. The second, **112** (4 x triangular number 28; which also happens to be the 2nd perfect number) defines the pyramid's pyramidion, or capstone. As such, each face's capstone section cascades 7 triangular numbers (1, 3, 6, 10, 15, 21, 28) with a total element count of 28.

We lay the foundation for the pyramid to follow by providing an exhaustive list of data points employing the Prime Spiral Sieve telescoped to modulo 90 and a corresponding 24 x 88 = 2112 cell matrix–the width reflecting the period-24 digital root of this domain, and 2112 being the index number of the 1000th prime number as a member of this sequence (and note the Fibonacci palindrome). Also note that every quadrant of the matrix (22 of 88 rows = 528 elements) is equivalent to one lateral face of the mysterious One Grand Pyramid alluded to earlier.

The first three primes (2, 3, and 5), although obviously counted among the first 1000, are set aside for the purpose of this analysis (albeit accounted for in the total), given 1) they are the only prime numbers not members of our defined factorization domain, i.e., not members of the set of natural numbers ≡ {1, 7, 11, 13, 17, 19, 23, 29} modulo 30, and b) they and their primorial, 30, are nonetheless present given they form the *structure* within which the 8-dimension (mod 30) and 24-dimension (mod 90) factorization algorithms described on this site operate.

Our specified range for this analysis thus begins with 1 and terminates with 7919 (the 1000th prime number), and is circumscribed by two numbers:

**7920** (which = 22 x 360 = 89^{2} − 1^{2})

and **7921 **(which = 89^{2})

(using the standard notation to represent counts of primes from 1 to n):

**π(7920) = 1000** and **π(89 ^{2}) = 1000.***

*The reason we’ve presented two (seemingly redundant) counting ranges will become evident.

Study the relationships detailed below and you'll discover a palindromic spine (viz., 11, 22, 33, 44, 55, 66, 88, 121, 242, 343, 484, 2112, 23232, 69696), vertical and horizontal reflectional symmetry composed of prime numbers (especially the 242 'Mirror Prime Pairs'), and other features that suggest this 'mathematical object' is worthy of further study. For example: The myriad ways that number 24 and its square, **576**, play out dimensionally in this space are truly remarkable.

The diagram below captures the basic dimensions of our analytical matrix, followed by a rather long list of its intriguing features. Then the fully populated matrix is presented, showing row and additive sum totals for primes (hi-lited in black). After that, you'll find a graphical "footprint" of the 484 prime numbers between 1 and 7920 (exactly 11^{2} + 11^{2} on each side!) that form 242 Mirror Prime Pairs, or what might better be called Reflectional Symmetry Primes.

[Note:The cumulative sum and indexing formulae referenced below can be found on a page dedicated to them, here: **
Cumulative Sum and Indexing Formulae**.]

Also, be warned that you'll find a certain amount of annoying redundancy in the list below. This was done deliberately to expose particularly interesting juxtapositions and associations. Also note that **576** has been 'boldened' to emphasize its importance. And one can't help but wonder if there's a connection between the 88-unit dimension of this object and the 88 pitches of a modern piano(?).]

As you scan the list below you'll occasionally encounter what we're calling 'iterative digit division' (you can think of it as a corollary to 'iterative sum of digits' that defines digital root). For example, the cumulative sum of n not divisible by 2, 3, or 5 from 1 to the 1000th prime (7919) = 8,363,520. To calculate its iterative division root we get 8/3/6/3/5/20 = .00148148 ... (You'll note that, because one can't 'legally' divide by zero, all zeroes adhere to the digit preceding them.).

Here's a quote to keep in mind while scanning these data:

"Mathematicians have long wondered at the haphazard way in which the primes are sprinkled along the number line from one to infinity, and universality offers a clue. Some think there may be a matrix underlying the Riemann zeta function that is complex and correlated enough to exhibit universality. Discovering such a matrix would have 'big implications' for finally understanding the distribution of the primes ..." Natalie Wolchover, "In Mysterious Pattern, Math and Nature Converge,"
*Quanta Magazine,* 02.05.2013

- F
_{10}(55) * F_{12}(144) = 7920. - F
_{10}(55) * F_{12}(144) − F_{1}(1) = 7919 (the 1000th prime number). - F
_{10}(55) * F_{12}(144) + F_{1}(1) = 7921 = 89^{2}(and every 11th Fibonacci number, starting with F_{11}, has 89 as one of its divisors). - The additive sums of Fibonacci numbers sequentially divided by 10 raised to the power of their sequence numbers equate to the reciprocal of 89. Thus, 1/89 = 1/10
^{2}+ 1/10^{3}+ 2/10^{4}+ 3/10^{5}+ 5/10^{6}+ 8/10^{7}+ 13/10^{8}+ ... . Similarly, the additive sums of Fibonacci numbers divided by 10 raised to the power of 109*minus*their index numbers produce the reciprocal of 109. - Total value of the 24 * 88 = 2112 cell matrix is 8,363,520, and average value is 3960, while 3960 = 11 x 360. To show the depth of these relationships, we give you: 11 x (8/3/6/3/5/20) x 360
^{2}= 2112 (7919's index number as a member of n not divisible by 2, 3, or 5). Related to this is (8/3/6/3/5/20) x 360^{2}= 192 = 24^{2}/3 = the total partitions of 10, and 4/8/4 x (8/3/6/3/5/20) x 360^{2}= 24 (index # of 89, the 24th prime, as a member of n not divisible by 2, 3, or 5, while 484 is the count of primes in the 242 'Mirror Prime Pairs," described and illustrated down this page. - F
_{11}(89): The decimal expansion of 89's reciprocal (1/89) is period-44, composed of 22 bi-lateral 9 sums = 198, while 7920/198 = 40 and 8,363,520/198 = 20 x 2112 (7919's index number as a member of this domain).

- 109
^{2}− 89^{2}= 3960 and 3960 x 2 = 7920; which equates to 8,363,520/(109^{2}− 89^{2}) = 2112, and 89^{4}− 7919^{2}= 8 x 3960. - (2 x 3
^{2}x 109) − (2 x 3^{2}x 89) = 360.

- Cumulative digital root of 7920 9600, while cumulative sum n {1, 2, 3, ...} (1 - 7919) = 31,359,240 = 7919 x 3960 = 11 x 360 x 7919.
- 8 x 3 x 6 x 3 x 5 x 2 = 4320, and 4 x 3 x 2 = 24.
- 4320 − (109
^{2}− 89^{2}) = 360. - 89's index # as a member of this domain = 24, while 89
^{2}= 7921 has index #2113 (a twin prime, with 2111). - 89/90
^{2}= .010987654321. - The first 89 digits of pi's decimal expansion sum to 432.
- (89 x 91) − (89 + 91) = 7919. And, interestingly, (7919 x 7921) − (7919 + 7921) = 62,710,559, which is prime.

[Here we note our astonishment that π(62,710,560) = 3,713,160, and (again using iterative digital division) 3/7/1/3/1/60 x 112 (Fibo_{3}) x 7920 = 2112 (index number of the 1000th prime). How to explain that! ... especially considering the role 112 plays as the pyrimidion of our 'One Grand Pyramid' housing the first 1000 primes, which you'll find at the bottom of this page.] - 90
^{2}− 89^{2}= 179 (prime); 90^{2}− 7919 = 181 (prime); twin primes 179 + 181 = 360. - 9+8+7+6+5+4+3+2+1+2+3+4+5+6+7+8+9 = 89.
- 10+9+8+7+6+5+4+3+2+1+2+3+4+5+6+7+8+9+10 = 109.
- 89 and its reversal require the most reversals and additions to become palindromic (steps required = 24).
- 89 is the 24th prime and 24th n not divisible by 2, 3, or 5.
- 24 is the 3rd 'Superprimorial,' viz. 1! x 2! x 3! = 24 and (1! x 2! x 3!)
^{2}= 1^{2}x 2^{2}x 3^{2}x 4^{2}=**576**. - F
_{4}(3) + F_{8}(21) = 24 (and both 3 and 21 are triangular numbers). - The prime numbers between 1 and 24 (2, 3, 5, 7, 11, 13, 17, 19, 23) sum to 100, while the first 24 counting numbers sum to 300.
- 431, 433 are twin primes.(4 x 3 x 1) x (4 x 3 x 3) = 432.
- 7919 ≡ 431 (mod
**576**), while 7921 (or 89^{2}) ≡ 433 (mod**576**), and, of course, 7920 ≡ 432 (mod**576**). - F
_{10}(55) + F_{14}(377) = 432. - 8/30 x 5/24
^{2}x 432 = 1 ... thus 30/8 x 24^{2}/5/432 = 1. Also note that 24^{2}/4/3/2 = 24 and 24^{2}/7/9/2/1 x 112 = 512 = 2^{9}and 24^{2}/8/3/6/3/5/20 x 360^{2}= 4 x 432 = 3 x 576 and 24^{2}/9/50/4 x 360^{2}= 96 x 432 = 72 x 576.

- 8/30 x 5/24
^{2}x 432^{2}= 432. - 24
^{2}=**576**. - (3/5/9)
^{2}x 360^{2}= 576. - 1
^{2}x 2^{2}x 3^{2}x 4^{2}=**576**. - F
_{8}(21) + F_{9}(34) + F_{10}(55) + F_{11}(89) + F_{12}(144) + F_{13}(233) =**576**. **576**= 100_{10}_{24}**576**= 484_{10}_{11}**576**= number of modulo 90 factorization dyads and associated {9/3} star polygons that algorithmically account for all composite numbers > 5 not divisible by 2, 3, or 5.**5 x 7 x 6**= 210 = 2 x 3 x 5 x 7 (the 4th primorial).**576**+ its cumulative digital root (2880) = 3456.- 3 x 4 x 5 x 6 = 360.
- F
_{24}= 46368. - 4 x 6 x 3 x 6 x 8 = 3456.
- The cumulative sum of natural numbers N = {0, 1, 2, 3, ...} from 1 to 2112 (Index # of the 1000th prime) = 2,231,328. (Here is the formula for the cumulative sum (k) of n 1, 2, 3, ...:
**k = (n + n**.)^{2})/2 - 2 x 2 x 3 x 1 x 3 x 2 x 8 =
**576**. **576**= number of 4 x 4 Latin Squares.- In 2016, Ukrainian mathematician Maryna Viazovska published two papers (the 2nd in collaboration with associates) proving that the densest packing of congruent spheres in Euclidean space is in dimensions
**8**and**24**; here's the theorem statement for the latter: "Theorem 1.1. The Leech lattice achieves the optimal sphere packing density in R^{24}, and it is the only periodic packing in R^{24}with that density, up to scaling and isometries." Here's a link to the 2nd paper: "The sphere packing problem in dimension 24". - The
**576**th prime member of this domain, 4211, has index # 1123 (1st 4 Fibonacci numbers). - Cumulative digital root sequence n 1, 2, 3, ... (1 - 7920) contains 345 prime numbers; 345's divisors (1, 3, 5, 15, 23, 69, 115, 345) =
**576**. **576**_{10}= 484_{11}.- 484 = number of primes in range (1 - 7920) that form 242 'Mirror Prime Pairs.'*

* prime pairs in each period-24 segment of our domain with summands that spatially 'mirror' opposite the center-line of a 24-wide matrix. All such pairs are evenly divisible by 90. For example, the first row contains 9 such pairs (working from the center outward):

**(43 + 47); (37 + 53); (31 + 59); (29 + 61); (23 + 67); (19 + 71); (17 + 73); (11 + 79); and (7 + 83)**

(Curiously, and possibly not a coincidence: 7920 (which = 22 x 360) x (22/360) = 484.)

Scroll down to find a "footprint" of all 242 of these pairs. - 8363520/242 = 34560 = 96 x 360 = 80 x 432 = 60 x 576 = 1! x 2! x 3! x 4! x 5! (the 5th 'superfactorial').
- 8363520/96 = 242 x 360. (96 is the 360° term periodicity for n not divisible by 2, 3, or 5, i.e., 8/30 x 360 = 96.)
- 1/1/2 x (8/3/6/3/5/20) x 360 = 8/30; 1/1/2 x (8/3/6/3/5/20) x 360
^{2}= 96; 1/1/2 x (8/3/6/3/5/20) x 360^{3}= 1! x 2! x 3! x 4! x 5!.

- 8363520/360 = 23232.
- 23232/360 * 30/8 = 242. (30/8 is ratio of numbers N = {0, 1, 2, 3, ...} to n not divisible by 2, 3, or 5).
- A day on Venus is equivalent to 242 Earth days. 365 - 242 = 123.
- Entire matrix consists of 1056 dyads summing to 7920. Of these, 243 form prime pairs. 243 = 9
^{2}+ 9^{2}+ 9^{2}= 3^{5}. - Cumulative sum N = {0, 1, 2, 3, ...} (1 - 7920) = 31367160 = 11 x 89
^{2}x 360 = 2^{2}x 5 x 89^{2}x 198. - 3 x 1 x 3 x 6 x 7 x 1 x 6 = 4 x 567 while 7 x 9 x 1 x 9 = 567.
- Our mathematical object, a matrix, is 24 x 88 = 2112 cells.
- 2112 x (24/88) =
**576**; 2112/(88/24) =**576**. - 2112/8
^{2}= 33. - (2112/8
^{2}) − (**576**/8^{2}) = 24. - 2112 is the sum of 2 distinct powers of 2, i.e., 2
^{6}+ 2^{11}= 2112 (ref. oeis.org: A018900). - 2112 is a 4 times triangular number, defined as a(n) = 2n(n+1) (ref. oeis.org: A046092).
- 2111, 2113 are twin primes
- 2112's aliquot sum (the sum of its divisors) = 3984.
- 3 + 9 + 8 + 4 = 24; 3 x 9 x 8 x 4 = 432 x 2.
- 3/9/8/4 x 360 = 30/8 = 3.75 = 2
^{3}/(1^{2}+ 2^{2}+ 3^{2}+ 4^{2}). - 2112/96 = 242 (242 = number of Mirror Prime Pairs and 96 is the 360 degree digital root Fibonacci periodicity when indexed to n not divisible by 2, 3, or 5, i.e., period 32 every 120 degrees).
- 2((8363520)/(8x9x10x11)) = 2112.
- (1
^{2}+ 2^{2}+ 3^{2}+ 4^{2}) x (1^{2}x 2^{2}x 3^{2}x 4^{2}) x 484 = 8363520. - 8,363,520/242 = 34,560.
- 3 x 4 x 5 x 6 = 360.
- 34,560 is the 5th "superfactorial," i.e., the product of first 5 factorials, viz. 1! x 2! x 3! x 4! x 5! = 1 x 2 x 6 x 24 x 120 = 34560 (ref: oeis.org: A000178). Curiously, the 6th superfactorial (24883200) =
**576*** 432 * 100. - 2
^{3}/(1^{2}+ 2^{2}+ 3^{2}+ 4^{2}) x 360^{2}= 1! x 2! x 3! x 4! x 5!. - 34,560/360 = 96.
- 2
^{3}/(1^{2}+ 2^{2}+ 3^{2}+ 4^{2}) x 360 = 96. - 34560/432 = 80.
- 34560/
**576**= 60. - 8 x 3 x 6 x 3 x 5 x 2 = 4320 = 10 x 432 = 12 x 360.
- 8363520/360 = 23232
- 2
^{2}x 3^{2}x 2^{2}x 3^{2}x 2^{2}= 5184 = 3^{2}x**576**. - 23232/2112 = 11.
- 23232/(8/30) = 242 * 360.
- 2112/192 = 11.
- (191,193) are twin primes; 191 + 192 + 193 =
**576**. - 192 = total number of partitions of 10.
- 192 = 5 + 7 + 11 + 13 + 17 + 19 +23 + 29 + 31 + 37 (10 consecutive primes).
- 8353520 x 30/8 = 31363200 = 242 x 360
^{2}. - 8363520 x 30/8 + 3960 = cumulative sum (1 - 7920) = 31367160, while 31367160 = 360 x 11 x 89
^{2}. - 1056 (number of dyads summing to 7920) x 8/30 (ratio of numbers not divisible by 2, 3, or 5 to numbers N = {0, 1, 2, 3, ...} ) = 3960 (the average value of matrix).
- 1/1/2 x (8/3/6/3/5/20) x 360 = 8/30.
- Cumulative digital root compiled for natural numbers congruent to {1, 7, 11, 13, 17, 19, 23, 29} mod 30 from 1 to the 1000th prime, 7919 = 9504.
- 9504 = 22 x 432 = 24 x 396 = 88 x 108 = 2
^{5}x 3^{3}x 11. - 9504/1056 (number of pairs in our domain summing to 7920) = 9.
- (8 x 3 x 6 x 3 x 5 x 20) / (9 x 50 x 4) = 24.
- 8363520/9504 = 880.

- 7 x 9 x 1 x 9 = 567; 5 x 6 x 7 = 210 = 2 x 3 x 5 x 7.
- Of the 1000 primes between 1 and 7920, 997 are n not divisible by 2, 3, or 5 ... 9 x 9 x 7 = 567.
- In physics, 11 is the number of dimensions in M-theory "that unifies all consistent versions of superstring theory."
- 11 is not only the Fundamental Repunit. It's also the Fundamental Dyad (1 + 1 = 2) and the Fundamental Palindrome! And, of course, it's also the first palindromic prime and 1 + 1 = 2 ... initiates the Fibonacci sequence. And should we be surprised that the 'Magic Angle' for superconductivity (a precipitous drop in electrical resistance) when two sheets of graphene are stacked and twisted at a relative angle, is 1.1°! Lastly, when we add 11 + 89, we score 100!

Here is the matrix under discussion:

Below is an image reflecting the "Mirror Prime Pairs" referenced above. Astounding that each side of the matrix has 11^{2} + 11^{2} = 242 of these primes:

And here are the same primes identified by number:

Here's a tantalizing example of how Cumulative aka Additive Sum Formulae can be employed as analytical tools to reveal structure; in this case, exposing a beautiful bidirectional progression at the heart of the mathematical object we've been describing above:

And the following example also exposes hidden structure:

**π(7920) = 1000**; 7919 is 1000th Prime.

There are 243 prime pairs among the first 1000 primes that sum to 7920, with additive sum 1,924,560.

Additive Sum n 1, 2, 3, ... (1 - 7919) = 31,359,240.

Additive Sum n ≡ (1, 7, 11, 13, 17, 19, 23, 29} modulo 30 (1 - 7919) = 8,363,520.

Now consider this:

1 x 9 x 2 x 4 x 5 x 60 = 21,600 = 60 x 360 = 50 x 432.

3 x 1 x 3 x 5 x 9 x 2 x 40 = 32,400 = 90 x 360 = 75 x 432.

8 x 3 x 6 x 3 x 5 x 20 = 43,200 = 120 x 360 = 100 x 432.

8 x 3 x 6 x 3 x 5 x 20 x 576 = 1! x 2! x 3! x 4! x 5! x 6! (the 6th Superprimorial!)

In the following provocative study we sieve the delta differences in prime number counts between the squares of n congruent to {89} modulo 90 and test their divisibility by 360 and 1000 (and we find especially interesting those deltas evenly divisible by both):

Focusing in on the deltas with divisibility by 1000, we find the following fascinating relationships:

At the top of this page we declared that the first 1000 prime numbers are 'entombed' in a beautiful mathematical object. In support of this claim we offer the somewhat Archimedean construction below. We're tempted to call it the Tomb of the First 1000 Primes, but prefer the pun in 'One Grand Pyramid.'

First, we must inject a bijection (a fancy word for a one-to-one-correspondence between two sets). In our case we're referring to the index numbers of the triangular number sequence bijecting the set of natural numbers not divisible by 2, 3, or 5. Here are the first eight such correspondences:

**1** ↔ 1, **2** ↔ 7, **3** ↔ 11, **4** ↔ 13, **5** ↔ 17, **6** ↔ 19, **7** ↔ 23, **8** ↔ 29, ...

Thus, getting back to defining our pyramid, each of its lateral faces is constructed from a 32-step triangular number progression (oeis.org/A000217: a(n) = n(n+1)/2 ...). By definition, each triangular step is equilateral. In addition, every step dyad, starting with 1+3 = 4, sums to a perfect square, and thus each face of our pyramid cascades 1^{2} thru 32^{2}, and 32^{2} x 4 = 4096 = 2^{12}. (Note that 4 x 32 = 128 = the perimeter of the square base which has an area of 32^{2} = 1024 = 2^{10}. Which is to say that the pyramid's perimeter, 128, equals the number of triangular numbers employed in its construction.)

The four faces of our pyramid collectively cascade 32 'four-times triangular numbers' (oeis.org/A046092: a(n) = 2(n+1) ...). These include Fibo_{3} equivalent 112 (rooted in T_{7} = 28; 28 x 4 = 112), which creates a pyramidion or capstone in our model, and 2112 (rooted in T_{32} = 528; 528 x 4 = 2112), which is the index number of the 1000th prime within our domain, and equals the total number of 'elements' used to construct the pyramid. Or, using the textbook way to visualize triangular numbers, 2112 = the total number of billiard balls filling the four faces, which in our case will be dually populated with natural numbers 1, 2, 3, ... and their associated numbers not divisible by 2, 3, or 5 in a 4-fold progression of perfect squares concatenating from the top to the bottom of the pyramid.

It's worth noting here that 2112 is a 4- (x528), 32- (x66), 352- (x6), 704- (x3), and 2112- (x1) times triangular number (and we find it odd–no pun intended–that "1" is considered a triangular number). Regardless, both 112 and 2112 express the 'fundamental dyad' 1+1 = 2 (which we featured earlier in this section). They give us a curious equation (employing iterative digital division), (2/1/1/2)(2112-112)(1/1/2) = 1000.

Speaking of iterative digital division–a powerful tool for exposing structure–we get this astonishing equation: iteratively dividing the digital roots of the first 12 Fibonacci numbers times the divisively iterated 1000th prime, 7919, times 360^{4} gives us 1000 (Keeping in mind that the first two and last two digits of the Fibo sequence below, 11 and 89, sum to 100; that 89 is the 11th Fibo number; that there are 1000 primes between 1 and 89^{2}; and that 89 has the Fibonacci sequence embedded in its decimal expansion.):

**1/1/2/3/5/8/4/3/7/1/8/9 x 7/9/1/9 x 360 ^{4} = 1000**.

This spreadsheet clip shows the progressions of triangular, 4-times triangular numbers and cascade of perfect squares that compose each lateral face of the pyramid:

Summarizing some of the above relationships:

7/132 x Pyramid Unit Sum = Pyramidion Unit Sum; 7/132 x Pyramid Face Unit Sum = Pyramidion Face Unit Sum (or Pyramidion/4).

528 x 7/132 = 28; 528 x 112/2112 = 28 (which happens to be the 2nd perfect number).

2112 x 7/132 = 112; 2112 x 28/528 = 112; 7/9/1/9 x 36^{2} = 112; and, 1/90 x 28 x 360 = 112.

28/112 x 2112 = 528; and, 2112/112 x 28 = 528.

500/28 x 112 = 2000.

528/28 x 112 = 2112; 2112/112 x (7/9/1/9) x 36^{2} = 2112; 112/(7/132) = 2112; and, 1/90 x 528 x 360 = 2112.

And, we note that:

(2112-112)/2 = 1000.

(2112-112) x 1/1/2 = 1000.

500/28 x 112/2 = 1000.

2000/112 x (7/9/1/9) x 36^{2}/2 = 1000

(2/1/1/2)(2112-112)(1/1/2) = 1000.

(7 x (4/3/2)^{2})^{2} x (7 x (5/7/6)^{2}) x (3/60)^{2} x 360^{3}/112 = 1000 (whew!).

1/2/3/4/5/6/7/8 x 112 x 360 = 1.

1/1/2 x (8/3/6/3/5/20) x 360 = 8/30 = ratio of numbers not divisible by 2, 3, or 5 to N = {0,1,2,3, ...}.

1/1/2 x (8/3/6/3/5/20) x 360^{2} = 96 = the number of perfect squares generated by the Prime Spiral Sieve during one complete modulo 90 factorization cycle.

1/1/2 x (8/3/6/3/5/20) x 360^{3} = the 5th 'Superfactorial = 1! x 2! x 3! x 4! x 5! = 34560.

And then there's this:

Exploring 12960 and its portents has led to yet another interesting 'coincidence,' namely:

**π(4859 ^{2} → 11059^{2}) = 4,561,920**, which in turn =

And we end this section with an equation full of sound and fury, signifying nothing:

**Return to www.primesdemystified.com Home Page**

Your feedback welcome! Email: gwc@hemiboso.com