diff options
| author | bd <bdunahu@operationnull.com> | 2024-08-05 14:19:21 -0600 |
|---|---|---|
| committer | bd <bdunahu@operationnull.com> | 2024-08-05 14:19:21 -0600 |
| commit | 6cbd528902d4e6eb7f79839a0c53031648c2d408 (patch) | |
| tree | a7326cd90cca23f8ddcbe6f91b9148a97ca61468 | |
| parent | 5e5f7eb2304b9f9f2a54c163cdd79720ea8e0892 (diff) | |
| -rw-r--r-- | circular-primes/README.org | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/circular-primes/README.org b/circular-primes/README.org index 132552f..a9e843c 100644 --- a/circular-primes/README.org +++ b/circular-primes/README.org @@ -4,6 +4,10 @@ The above problem asks us to calculate all of the circular primes below 1,000,00 197, 971, and 719 +** Note to Self + +It would be interesting to try and optimize this one to go fast. Also see https://primes.utm.edu/glossary/page.php/CircularPrime.html for a useful noticing on circular primes. + ** Solution *** First (Faster, at 1m50s on my laptop) |