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 |
|
filifa
|
51e1a97c43
|
split file
|
2025-08-21 20:36:56 -04:00 |
|
filifa
|
005eac45c0
|
refactor general crt algorithm into separate function
|
2025-08-21 20:19:11 -04:00 |
|
filifa
|
8333be5d2d
|
have lib function take map instead of list
|
2025-08-21 19:52:05 -04:00 |
|
filifa
|
0fdb60275f
|
move primitive root functions to lib
|
2025-08-21 19:24:49 -04:00 |
|
filifa
|
4661e2d974
|
simplify a bit
|
2025-08-21 19:11:14 -04:00 |
|
filifa
|
da252dc9de
|
move crt solver
|
2025-08-21 19:07:30 -04:00 |
|
filifa
|
8e71cc87e5
|
create internal library
|
2025-08-21 18:59:01 -04:00 |
|
filifa
|
37f40b25b4
|
compute totient with trial division
|
2025-08-21 00:48:29 -04:00 |
|
filifa
|
a948056382
|
expand help
|
2025-08-20 23:05:08 -04:00 |
|
filifa
|
51abf9139b
|
write more help text
|
2025-08-20 00:56:56 -04:00 |
|
filifa
|
a7ee29df8e
|
implement -t flag
|
2025-08-20 00:51:51 -04:00 |
|
filifa
|
00a7d213d3
|
rename variable
|
2025-08-19 22:44:53 -04:00 |
|
filifa
|
117b046be8
|
refactor into multiplicativeOrder function
|
2025-08-19 22:40:33 -04:00 |
|
filifa
|
7d554fb945
|
optimize a bunch
|
2025-08-19 22:35:15 -04:00 |
|
filifa
|
d12a5a492a
|
don't recompute coprime numbers over and over
|
2025-08-19 22:22:16 -04:00 |
|
filifa
|
a7547fc0eb
|
add special case for modulus=1
|
2025-08-19 22:00:14 -04:00 |
|