repl.it
@anonymous/

SpiffyButteryCrownofthornsstarfish

Python

No description

fork
loading
Files
  • main.py
main.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
def isPrime(num):
    return num%2 and all([num%prime for prime in primes])
    
def divisors(num):
    return [x for x in range(2,num+1) if num%x==0]
    
primes = [2,3]

for i in range(5,10000):
    if isPrime(i):
        primes.append(i)
      
      
for p in primes:
    if pow(10,p-1,p*p)==1:print(p)
    

    
print(divisors(486-1))

print([pow(10,e,487**2) for e in divisors(487-1)])

print([pow(10,e,487) for e in divisors(487-1)])
?