Question

Could you fix the errors in the code typed below. I want to find the smallest composite integer greater than 5993 for which 2 is not a Fermat Witness.

from math import sqrt

def primeFactors(n):
ps = []
  
while (n%2) == 0:
p = 2
ps.append(p)
n = n/p
  
sqrt_n = int (sqrt(n))+1
for p in range(3, sqrt_n,2):
while (n%p) == 0:
ps.append(p)
n = n/p
  
if n>sqrt_n-1:
p=n
ps.append(p)
return ps

fL(5993):
  
for n in (5994,11986)
if 2^n-1 == 1 and len(primeFactors(n)) > 1
return n

Answer 1

from math import sqrt

def primeFactors(n):
        ps = []
        while (n%2) == 0:
                p = 2
                ps.append(p)
                n = n/p
        sqrt_n = int (sqrt(n))+1
        for p in range(3, sqrt_n,2):
                while (n%p) == 0:
                        ps.append(p)
                        n = n/p
        if n>sqrt_n-1:
                p=n
                ps.append(p)
                return ps                  #Here I have removed FL
                for n in (5994,11986):
                        if 2^n-1 == 1 and len(primeFactors(n)) > 1:
                                return n

z=primeFactors(6453)
print(z)

As above code is now error-free. There was some indentation errors.