Aliquot Sequence Research
2.0
Compute properties of the sum-of-proper-divisors function.
|
Go to the source code of this file.
Macros | |
#define | BYTES_TO_GB 0.000000001 |
Convert bytes to gigabytes. | |
#define | TWO_THIRDS .6666666666666666666666 |
Constant for 2/3. | |
#define | EVEN(x) (0 == (x) % 2) |
1 if a number is even. | |
#define | SQUARE(x) ((x) * (x)) |
Square a number. | |
#define | MIN(x, y) (((x) < (y)) ? (x) : (y)) |
Return the smaller number. | |
#define | DIVIDES(x, y) (0 == y % x) |
Check if x divides y evenly. | |
#define | F_OFFSET(x) ((x / 2) - 1) |
Offset an even number into an array. | |
#define | F_DE_OFFSET(x) ((x + 1) * 2) |
Get the even number represented by this array index. | |
#define | LOG(shush, fmt, ...) |
quietable logging macro. More... | |
#define | DEBUG_ASSERT(x) |
Turn off asserts for production runs. | |
Enumerations | |
enum | nonaliquot_counts_t { _10_TO_THE_4 = 1212, _10_TO_THE_5 = 13863, _10_TO_THE_6 = 150232, _10_TO_THE_7 = 1574973, _10_TO_THE_8 = 16246940, _10_TO_THE_9 = 165826606, _10_TO_THE_10 = 1681871718, _10_TO_THE_11 = 16988116409, _10_TO_THE_12 = 171128671374, _2_TO_THE_40 = 188206399403 } |
Counts of nonaliquots typed out from (Chum et al.) More... | |
#define LOG | ( | shush, | |
fmt, | |||
... | |||
) |
quietable logging macro.
enum nonaliquot_counts_t |
Counts of nonaliquots typed out from (Chum et al.)