I have
had a very great time this semester even as I was learning and enjoying my
units in Pure Mathematics. Number Theory has been real fun –all those theories
on primes, Diophantines, modulo arithmetic etc. I found the Eratosthenes sieve of
determining all primes less than a given number n very creative. I`ve done a
Java application (Sieve Calc 1.0) based on GUI that implements the sieve. Check
out these screen shots as you follow the code at my Github repository at https://github.com/HARRIEKIM.
 |
| Main UI |
 |
| About Sieve Calc |
 |
| Help |
 |
| Working |
No comments:
Post a Comment