The following pages include additional computational material that may be helpful in following the ideas presented in this paper. If you have any comments or wish to contact me regarding this material, please do so at email@example.com.
Compute Prime Factorial Numbers
Using a function that recursively gets the next higher prime number and multiplies it by the current prime factorial, we can instantly compute a list of PF numbers. The list above is Report 1 which shows the first 40 PF numbers and identifies the matrix number and the Key Seed number in the matrix. The 40th PF is 69 digits long. The number of prime numbers used to compute the PF list is an input. On the following page is Report 2 that shows some additional information including the Matrix number, Key Seed, and the number of matrix members.