emileclarkb/noether
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

commit state before changing what noether considers primitive roots

Browse source
This commit is contained in:
Emile Clark-Boman 2025-06-12 14:42:03 +10:00
parent a168a728ce
commit 33bcffdc69
11 changed files with 441 additions and 36 deletions
Download patch file Download diff file Expand all files Collapse all files

19
README Normal file
View file

@ -0,0 +1,19 @@
Noether is a project I plan to complete over a LONG period of time (years).
A collection of useful commands for solving various math problems.
A personal little MATLAB alternative I suppose :)
In future I'd love to start using a developed TUI library like [textual](https://github.com/Textualize/textual?tab=readme-ov-file),
but for now everything is just a custom ANSI wrapper thing.
NOTES:
1. could I define something like "primality classes"?
ie class one: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, ...
class two: 3, 5, 11, 17, 31, ... (class 1 with a prime index, ie 11 is the 5th class 1 prime)
class three: 5, 11, 31, ... (class 2 with a prime index, ie 11 is the 3rd class 2 prime)
2. figure out all possible patterns that can appear amongst primitive roots
can we then categorise primes by their primitive root behaviour?