This file contains 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
#Format: | |
# (Index of counterexample in sequence of highly composite numbers) | |
# (Number) | |
# (Prime decomposition, e.g., [2,1,4] would refer to 2^2 * 3^1 * 5^4 = 7500) | |
# --- | |
815 | |
362279431624673937974303738230488502933082643722886373107941760000 | |
[10, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] | |
--- |
This file contains 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
#!/usr/bin/env python3 | |
# This code was adapted from dario2994/generate_hcn.py | |
# https://gist.github.com/dario2994/fb4713f252ca86c1254d?signup=true | |
# It outputs counterexamples to Matthew Daly's highly composite number... | |
# ... conjecture at Math Stack Exchange question 3529219 that are below MAXN | |
# This program prints all hcn (highly composite numbers) <= MAXN (=10**18) | |
# | |
# The value of MAXN can be changed arbitrarily. When MAXN = 10**100, the |