diff options
| author | Charles <sircharlesaze@gmail.com> | 2019-08-11 22:41:34 +0200 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2019-08-11 22:41:34 +0200 |
| commit | 1879caa1dd80cb11dd62403663917ad4bf7cc68e (patch) | |
| tree | ea41c6dd83a9f9bbfe0a891237674342de92d533 /python/35-circular_primes.py | |
| parent | 6b16d921543a62d880171791d39bcc58560785fa (diff) | |
| download | project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.tar.gz project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.tar.bz2 project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.zip | |
rename all file with 3 zero padding
Diffstat (limited to 'python/35-circular_primes.py')
| -rw-r--r-- | python/35-circular_primes.py | 19 |
1 files changed, 0 insertions, 19 deletions
diff --git a/python/35-circular_primes.py b/python/35-circular_primes.py deleted file mode 100644 index 5d5243b..0000000 --- a/python/35-circular_primes.py +++ /dev/null @@ -1,19 +0,0 @@ -from helper.prime import primes_until, is_prime - -def rotate_num(l, x): - l = str(l) - return int(l[-x:] + l[:-x]) - -c_nb_list = [] -for p in primes_until(1_000_000): - circular = True - for k in range(1, len(str(p))): - if not is_prime(rotate_num(p, k)): - circular = False - break - - if circular: - c_nb_list.append(p) - -print(c_nb_list) -print(len(c_nb_list)) |