Pe039

def number_of_solution(p):
    num = 0
    for a in range(1,p//3):
        if (p**2-2*p*a)%(2*p-2*a) == 0:
            num += 1
    return num

def main(n=1000):
    d = {p:number_of_solution(p) for p in range(2,n+1,2)}
    ans = max(d,key=d.get)
    return ans

Source: pe.metaquant.org

Similar codes

0 vote159 views1 answer
How to check local endianness with Python ?
Python
5 votes95 views3 answers
Urllib3 python
Python
0 vote95 views2 answers
Python regex words with apostrophe in middle
Python
0 vote102 views1 answer
Python set current working directory debugging
Python
9 votes103 views3 answers
Python venv usage
Python
0 vote108 views1 answer
Installing intelpython3_core using anaconda
Python
1 vote100 views1 answer
Ax tick params
Python
1 vote106 views1 answer
What is nea in python
Python
0 vote97 views6 answers
List Comprehensions in python
Python
0 vote101 views1 answer
Struct trong python
Python