Here, we are calculating increasing or decreasing order of any number randomly selected from the set of all 8-digit numbers, obtained by permuting 0, 0, 0, 2, 3, 3, 4, 7 together, arranged in increasing or decreasing order. Using a set formula to deal with the problems of the linear permutations of certain articles (like letters, digits etc.) having at least one easily distinguishable property like size, color, surface-design.
It is well known fact that if total 'n' number of letters or non-zero digits, out of which no. of repetitive letters or non-zero digits are 'p', 'q', 'r' ......, are permuted together then the total no. of words or numbers is
=(n!)/(p!xq!xr!........)
but if all these words or numbers are arranged in alphabetic or numeric (increasing or decreasing) order then it is very difficult to find the order of a word or number randomly selected from this set if there large no. of words or numbers. But by using this set formula, any random word or number can be placed at the correct position in the set
similarly, rank or order of any word or number can be correctly evaluated in least time as compared to any other methods existing so far in the field of Mathematics to the best of my knowledge.

thanking you a lot for putting up query about "HCR's formula" published in March-April, 2014.
for brief description of this formula, kindly follow the link below
http://www.scribd.com/doc/210064124/HCR-s-Rank-Formula-a-Greatest-Logical-Formula

## Comments

Sort by:

TopNewestCan you explain what you are calculating?

Log in to reply

Here, we are calculating increasing or decreasing order of any number randomly selected from the set of all 8-digit numbers, obtained by permuting 0, 0, 0, 2, 3, 3, 4, 7 together, arranged in increasing or decreasing order. Using a set formula to deal with the problems of the linear permutations of certain articles (like letters, digits etc.) having at least one easily distinguishable property like size, color, surface-design. It is well known fact that if total 'n' number of letters or non-zero digits, out of which no. of repetitive letters or non-zero digits are 'p', 'q', 'r' ......, are permuted together then the total no. of words or numbers is =(n!)/(p!xq!xr!........) but if all these words or numbers are arranged in alphabetic or numeric (increasing or decreasing) order then it is very difficult to find the order of a word or number randomly selected from this set if there large no. of words or numbers. But by using this set formula, any random word or number can be placed at the correct position in the set similarly, rank or order of any word or number can be correctly evaluated in least time as compared to any other methods existing so far in the field of Mathematics to the best of my knowledge.

thanking you a lot for putting up query about "HCR's formula" published in March-April, 2014.

for brief description of this formula, kindly follow the link below http://www.scribd.com/doc/210064124/HCR-s-Rank-Formula-a-Greatest-Logical-Formula

Log in to reply