[ create a new paste ] login | about

Link: http://codepad.org/jz9XEwSu    [ raw code | output | fork ]

wasoxygen - Python, pasted on Feb 2: 
1
2
3
4
5
6
7
8
9

import math

strEDigs = '27182818284590452353602874713526624977572470936999595749669676277240766303535475945713821785251664274274'

for i in range(0, len(strEDigs) - 9):
   strCandidate = strEDigs[i:i+10]
   c = int(strCandidate)
   if c %2>0 and c%3>0 and c%7>0 and c%11>0 and c%13>0 and c%17>0:
      print strCandidate + ' is indivisible by primes 2 to 17'


Output: 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

1828182845 is indivisible by primes 2 to 17
8281828459 is indivisible by primes 2 to 17
5235360287 is indivisible by primes 2 to 17
3602874713 is indivisible by primes 2 to 17
6028747135 is indivisible by primes 2 to 17
5266249775 is indivisible by primes 2 to 17
2662497757 is indivisible by primes 2 to 17
5724709369 is indivisible by primes 2 to 17
7247093699 is indivisible by primes 2 to 17
2470936999 is indivisible by primes 2 to 17
4966967627 is indivisible by primes 2 to 17
9669676277 is indivisible by primes 2 to 17
2772407663 is indivisible by primes 2 to 17
7240766303 is indivisible by primes 2 to 17
4076630353 is indivisible by primes 2 to 17
0766303535 is indivisible by primes 2 to 17
6303535475 is indivisible by primes 2 to 17
3035354759 is indivisible by primes 2 to 17
3535475945 is indivisible by primes 2 to 17
3547594571 is indivisible by primes 2 to 17
9457138217 is indivisible by primes 2 to 17
8525166427 is indivisible by primes 2 to 17


Create a new paste based on this one


Comments: