diff options
| author | Charles <sircharlesaze@gmail.com> | 2019-08-11 18:42:52 +0200 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2019-08-11 18:42:52 +0200 |
| commit | 7b624de8e3e3637a07364f992c1d7e4185e4a872 (patch) | |
| tree | fdb9b0c3f9185b267f9f7bfb9cb4b0e4cdd8cc16 /python/35-circular_primes.py | |
| download | project_euler-7b624de8e3e3637a07364f992c1d7e4185e4a872.tar.gz project_euler-7b624de8e3e3637a07364f992c1d7e4185e4a872.tar.bz2 project_euler-7b624de8e3e3637a07364f992c1d7e4185e4a872.zip | |
initial commit
Diffstat (limited to 'python/35-circular_primes.py')
| -rw-r--r-- | python/35-circular_primes.py | 19 |
1 files changed, 19 insertions, 0 deletions
diff --git a/python/35-circular_primes.py b/python/35-circular_primes.py new file mode 100644 index 0000000..5d5243b --- /dev/null +++ b/python/35-circular_primes.py @@ -0,0 +1,19 @@ +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)) |
