On Counting [ Candidates-for-Primes modulo 30 ] up to [ N = 1543 ]

by Frank C. Fung ( 1st published in October, 2012. )

Top Of Page

Section I - Introduction

Introduction :

• This is the 3rd paper in a series of six (6) papers under the Grand Title :
  • An Approach to the Structural Integrity of Prime Number Systems

    with the 6 papers here being :

    1st paper	* *	On Prime Number Systems and Core Structural Pattern Propagations
    2nd paper	* *	On Counting Natural Numbers up to [ N = 1543 ]
    3rd paper	* *	On Counting [ Candidates-for-Primes modulo 30 ] up to [ N = 1543 ]
    4th paper	* *	On Unique-Factorization Combinatorics via the Pascal Triangle
    5th paper	* *	On the Match-Up of Structural Patterns within Prime Number Systems
    6th paper	* *	On the Unique-Factorization Equation within each Prime Number System
    **********	*	********************************************************

• And in this paper , we shall do the full count of [ Candidates-for-Primes modulo 30 ] up to [ N = 1543 ]
  • on a category-by-category basis .

go to Top Of Page

go to the next section : Section II - Defining the Categories for our Counting Purposes

return to the Counting via [ modulo 30 ] HomePage

Original dated 2012-10-08