Learn about and scruitnize a few basic Number Theory concepts up to and including The Fundamental Theorem of Arithmetic!
- Java 8
- File I/O
- Takes User Input (from Command Line, for example)
- Takes File Input
- Collections API
- Concurrency
- File I/O
- Maven 3
- Setup
- Manage (Clean, Compile, etc.)
- JUnit 5
- Testing
- Git
- Init
- General Version control (commit, push, etc.)
- PostgreSQL 9+
- Get DB Info
- Jenkins
- Auto builds in Jenkins when a new commit is pushed.
- Top Menu
- Add a Glossary
- Build most of it (with predetermined content)
- Chapter 1
- Theorem 1-1 = Sum of the first N Integers.
- Educational Dialogue
- User Test Loop
- Non-User Version
- Theorem 1-2 = Sum of x^j for j = [0, n-1].
- Educational Dialogue
- User Test Loop
- Non-User Version
- Theorem 1-3 = Basis Represenataion Theorem.
- Educational Dialogue
- User Test Loop
- Non-User Version
- Theorem 1-1 = Sum of the first N Integers.
- Chapter 2
- Theorem 2-1 = Euclid's Division Lemma.
- Educational Dialogue
- User Test Loop
- Non-User Version
- Theorem 2-2 = Greatest Common Divisor.
- Educational Dialogue
- User Test Loop
- Non-User Version
- Theorem 2-3 = If gcd(a, c) = 1 and c|ab, then c|b.
- Educational Dialogue
- User Test Loop
- Non-User Version
- Theorem 2-4 = Linear Diophantine Equation.
- Educational Dialogue
- User Test Loop
- Non-User Version
- Theorem 2-5 = Fundamental Theorem of Arithmetic.
- Educational Dialogue
- User Test Loop
- Non-User Version
- Theorem 2-1 = Euclid's Division Lemma.
- Add Proofs
- Define more terms
- Account for Integer Limitations (use longs instead of ints)
- Improve the pace of the output (wait())
- Input Data Validation
- Make Theroem 2-4 return the smallest solution
- Make longDivide() better or find some other way to test divisibility for large numbers
- Look Up Words
From the main dir, run with: (this will delete the log, and do maven clean, compile, then exec:java)
./run
Today is 2022/06/03 01:41