Perrin primes and composite numbers of these primes are shown to distribute uniformly in a 14 column by 14X row grid. Dirichlet’s theorem on arithmetic progressions states that there are infinitely many primes of the form a+nd (a congruent modulo d). This Chapter discusses the case when d=14. There are 6 progressions of primes modulo 14 as predicted by Euler’s totient function. A prime divisor function f(x,y,N)=0 is derived to factor vertical entries containing integer N. An algorithm can be programmed to solve for the zeros of the prime divisor function.
Chapter 14. Perrin Prime Distribution Theorem
Published
Perrin Sequences My Chalkboard 