feat(math): add anti_primes_up_to function for generating anti-prime numbers(highly composite numbers) #180
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…numbers(highly composite numbers) Implement anti_primes_up_to function that generates anti-prime numbers (highly composite records) within a given range. The function uses a DFS approach to generate candidate numbers by assigning non-increasing exponents to small primes, then identifies record-holders based on divisor counts. The implementation includes: A nested _gen_by_exponents helper function to generate candidates with divisor counts Logic to merge candidates with same values keeping maximum tau Selection of record-holding anti-primes in ascending order Also update function list documentation to include the new function.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
To solve #167
Implement anti_primes_up_to function that generates anti-prime numbers (highly composite records) within a given range. The function uses a DFS approach to generate candidate numbers by assigning non-increasing exponents to small primes, then identifies record-holders based on divisor counts.
The implementation includes:
A nested _gen_by_exponents helper function to generate candidates with divisor counts Logic to merge candidates with same values keeping maximum tau Selection of record-holding anti-primes in ascending order Also update function list documentation to include the new function.
You can test this_function by run command