Files

 master

/

216_Primality2n^2-1.py

Blame

Blame

Latest commit

 

History

History

14 lines (12 loc) · 222 Bytes

 master

/

216_Primality2n^2-1.py

Top

File metadata and controls

• Code
• Blame

14 lines (12 loc) · 222 Bytes

Raw

1

2

3

4

5

6

7

8

9

10

11

12

13

14

from Euler import is_prime, factor

def main(limit):

num = 1

vals = []

while num < limit:

val = 2*num**2-1

vals.append(val)

if not is_prime(val):

print val, factor(val)

num += 1

return vals

print main(100)