On Counting Natural Numbers up to [ N = 1543 ]

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

Top Of Page

Section I - Introduction

Introduction :

• This is the 2nd 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 go thru the numerical procedure of :
    • counting [ prime numbers ] and [ non-prime numbers ] up to [ N = 1543 ] ,
      • on a category-by-category basis .

  And we shall be using the [ All Natural Prime Number System ] here , whereby :

  • all non-zero natural numbers are proposed as [ candidates-for-primes ] .

go to Top Of Page

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

return to the Counting Natural Numbers HomePage

Original dated 2012-10-08