filifa
|
51ae15cedc
|
make same performance improvements to all sieve commands
|
2025-10-01 23:44:56 -04:00 |
|
filifa
|
5f65b35b9c
|
buffer channel
|
2025-10-01 23:27:32 -04:00 |
|
filifa
|
633a31a214
|
buffer prints
|
2025-10-01 22:21:02 -04:00 |
|
filifa
|
5c42040e34
|
add help
|
2025-09-29 22:50:44 -04:00 |
|
filifa
|
b55fe61820
|
move to lib
|
2025-09-29 22:40:40 -04:00 |
|
filifa
|
d2275cd69f
|
add multiplicity flag
|
2025-09-20 14:47:39 -04:00 |
|
filifa
|
356267a6af
|
add prime-omega command
|
2025-09-20 14:07:45 -04:00 |
|
filifa
|
bfef2a0001
|
use for loop constructs
|
2025-09-20 14:07:32 -04:00 |
|
filifa
|
2fd9b940d5
|
use PrintErrln instead of log
|
2025-09-18 00:09:28 -04:00 |
|
filifa
|
9e6f648f0b
|
add more help text
|
2025-09-18 00:08:56 -04:00 |
|
filifa
|
0ae3f4667f
|
speed up with dynamic programming
|
2025-09-16 23:09:22 -04:00 |
|
filifa
|
ddbb892748
|
massively improve performance with dynamic programming
|
2025-09-16 22:23:39 -04:00 |
|
filifa
|
4d8f12e1a2
|
add -e flag to set exponent
|
2025-09-15 21:25:24 -04:00 |
|
filifa
|
e5b3be0e60
|
add divisors command
|
2025-09-15 20:46:26 -04:00 |
|
filifa
|
e422c83803
|
add mobius command
|
2025-09-15 19:47:17 -04:00 |
|
filifa
|
f3f87710cb
|
skip 0
|
2025-09-15 19:19:19 -04:00 |
|
filifa
|
5b62e1e1ab
|
use flag for limit
|
2025-09-15 19:16:23 -04:00 |
|
filifa
|
adc73dbeca
|
add totient subcommand
|
2025-09-15 19:06:42 -04:00 |
|
filifa
|
efeb0f8818
|
add divisor summatory function
|
2025-09-15 18:39:42 -04:00 |
|
filifa
|
c6f6fc4a78
|
change wording
|
2025-09-10 22:15:46 -04:00 |
|
filifa
|
b9fd3d903c
|
change variable names for consistency
|
2025-09-10 22:14:12 -04:00 |
|
filifa
|
fffdf712e7
|
add check for invertibility
|
2025-09-10 21:29:13 -04:00 |
|
filifa
|
78f8efa06a
|
rename flag to base
|
2025-09-10 21:02:48 -04:00 |
|
filifa
|
48cc045e80
|
return error if no solution found
|
2025-09-10 20:50:11 -04:00 |
|
filifa
|
11fa36071f
|
add optional order flag
|
2025-09-10 20:33:53 -04:00 |
|
filifa
|
0fdc6f6e6c
|
rename order flag to modulus
|
2025-09-10 18:56:03 -04:00 |
|
filifa
|
c9cb78428f
|
iterate from 1 to m
|
2025-09-10 18:54:01 -04:00 |
|
filifa
|
dc952746a9
|
add discrete log command
|
2025-09-10 00:36:40 -04:00 |
|
filifa
|
61e84f934d
|
add shoelace command
|
2025-09-08 23:22:27 -04:00 |
|
filifa
|
93ba12400f
|
avoid stack overflow if k > n
|
2025-09-07 23:07:30 -04:00 |
|
filifa
|
2d359b3e63
|
add partitions command
|
2025-09-07 12:27:27 -04:00 |
|
filifa
|
849df37a96
|
add modular inverse command
|
2025-09-06 23:23:48 -04:00 |
|
filifa
|
f8a2e30618
|
add modular square root command
|
2025-09-06 22:25:58 -04:00 |
|
filifa
|
96fe7b14af
|
clarify that commas are needed
|
2025-09-06 21:19:18 -04:00 |
|
filifa
|
4978ec7834
|
add more help text
|
2025-09-06 00:43:51 -04:00 |
|
filifa
|
58d9185296
|
move functions to lib
|
2025-09-06 00:37:40 -04:00 |
|
filifa
|
b953ade1a1
|
reorganize function
|
2025-09-06 00:13:30 -04:00 |
|
filifa
|
67c95db7ba
|
reorganize loop
|
2025-09-06 00:04:26 -04:00 |
|
filifa
|
cafef6a4a2
|
create a cFracConvergents function
|
2025-09-05 23:52:40 -04:00 |
|
filifa
|
a65e54ff46
|
output solutions based on repetend period
|
2025-09-05 22:12:18 -04:00 |
|
filifa
|
675b98bf17
|
refactor checking pell solution
|
2025-09-05 21:32:01 -04:00 |
|
filifa
|
d238fe196f
|
make channels one-way
|
2025-09-05 21:27:10 -04:00 |
|
filifa
|
e4bd9aa661
|
return channels
|
2025-09-05 21:23:45 -04:00 |
|
filifa
|
0603ee9879
|
make channels one-way
|
2025-09-05 20:49:58 -04:00 |
|
filifa
|
0f98a371e8
|
compute convergents with channels
|
2025-09-05 20:35:18 -04:00 |
|
filifa
|
e8ae7e3e3e
|
give function a more descriptive name
|
2025-09-05 19:19:19 -04:00 |
|
filifa
|
33ab06c17d
|
add pell subcommand
|
2025-09-05 19:12:48 -04:00 |
|
filifa
|
f740223d88
|
name variables more clearly
|
2025-08-27 22:42:45 -04:00 |
|
filifa
|
654f0efc0a
|
add stirling subcommand
|
2025-08-27 22:37:45 -04:00 |
|
filifa
|
65c8ab4057
|
replace log.Fatal with cobra.CheckErr
|
2025-08-27 22:37:28 -04:00 |