Data

Frequencies of principal divisor ranks of the first trillion positive integers grouped in millions

The University of Newcastle
Jason S. Kimberley (Aggregated by)
Viewed: [[ro.stat.viewed]] Cited: [[ro.stat.cited]] Accessed: [[ro.stat.accessed]]
ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rfr_id=info%3Asid%2FANDS&rft_id=1959.13/35587&rft.title=Frequencies of principal divisor ranks of the first trillion positive integers grouped in millions&rft.identifier=1959.13/35587&rft.publisher=The University of Newcastle&rft.description=Entry f_r_by_M[r,M] is the count of those integers in the range [(M-1)*10^6 + 1 .. M*10^6] with principal divisor rank r. We list f_r_by_M[r,M] for r in [1..11] and M in [1..10^6]. Implicitly, we have: f_r_by_M[0,1] eq 1 (the integer 1 uniquely has principal divisor rank 0), and f_r_by_M[0,M] eq 0 for every M gt 1.&rft.creator=Jason S. Kimberley&rft.date=2009&rft_rights= https://creativecommons.org/licenses/by/2.5/au/legalcode&rft_subject=Number Theory&rft_subject=distinct prime divisors&rft.type=dataset&rft.language=English Access the data
Cite Saved to MyRDA Save to MyRDA

Full description

Entry f_r_by_M[r,M] is the count of those integers in the range [(M-1)*10^6 + 1 .. M*10^6] with principal divisor rank r. We list f_r_by_M[r,M] for r in [1..11] and M in [1..10^6]. Implicitly, we have: f_r_by_M[0,1] eq 1 (the integer 1 uniquely has principal divisor rank 0), and f_r_by_M[0,M] eq 0 for every M gt 1.

Issued: 2009

This dataset is part of a larger collection

Click to explore relationships graph
Help

Related People

Subjects
Number Theory | distinct prime divisors |

User Contributed Tags    

Login to tag this record with meaningful keywords to make it easier to discover

Identifiers
ACN 633 798 857