with :
And in this Section , we shall set up the preliminaries for the Counting-and-Calculation process
QUESTION :
with the 2 special conditions being that :
and
And we shall let the values of [ Q ] vary from [ 1 ] to [ 10 ] ,
for the values of [ Q ] varying from [ 1 ] to [ 10 ] .
Then :
( assuming at this first-instance that the value of [ H ] is greater than [ 10 ] )
is then :
And we take special note here that :
will have [ 1 ]-and-exactly-[ 1 ] prime-number as its prime-factors ;
will have [ 2 ]-and-exactly-[ 2 ] different prime-numbers to serve as its prime-factors ;
will have [ 3 ]-and-exactly-[ 3 ] different prime-numbers to serve as its prime-factors ;
will have [ 4 ]-and-exactly-[ 4 ] different prime-numbers to serve as its prime-factors ;
will have [ 5 ]-and-exactly-[ 5 ] different prime-numbers to serve as its prime-factors ;
will have [ 6 ]-and-exactly-[ 6 ] different prime-numbers to serve as its prime-factors ;
will have [ 7 ]-and-exactly-[ 7 ] different prime-numbers to serve as its prime-factors ;
will have [ 8 ]-and-exactly-[ 8 ] different prime-numbers to serve as its prime-factors ;
will have [ 9 ]-and-exactly-[ 9 ] different prime-numbers to serve as its prime-factors ;
will have [ 10 ]-and-exactly-[ 10 ] different prime-numbers to serve as its prime-factors ;
As such , the Equation we have above does give us the Full Count .
is the [ 10th row ] of the Pascal Triangle .