-
Notifications
You must be signed in to change notification settings - Fork 4
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Statistics about the known and unknown gnu's in the range [1,50000] #138
Comments
@gnufinder nice! what do you mean by "largest exponent in the prime factorization of the unknown values" - I'd expect to see there, for, example, 11 for 2048. |
For example, 856 of the numbers n in the range [1,50000] , for which gnu(n) is unknown, have no exponent larger than 7 in the prime factorization. I did not complete this table, if you want , I can do it. By the way, the largest exponent occuring is 15 (the number 2^15=32768). Perhaps, you prefer the table below. |
Number of unknown values with given maximal exponent in the prime factorization :
|
@gnufinder this is nice! If you have a GAP function that generates this report, please consider submitting it as a pull request. I suggest to have a file With such report generator, we could publish the overview periodically on wiki at https://github.com/alex-konovalov/gnu/wiki (it has already one page where I've collected some bibliography) - that would be a better place for such table than an issue which should be eventually closed... |
The statistics are based on the currently known gnu's in the range [1,50000]
Number of gnu's with given number of digits :
Number of unknown gnu's, such that the lower bound lb(n) has the given number of digits :
largest exponent in the prime factorization of the unknown values :
odd unknown values
single even unknown values ( residue class 2 modulo 4)
The text was updated successfully, but these errors were encountered: