MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / solution.py

File solution.py

project_euler_problems/10001st prime/solution.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1import math
2
3# This solution aims to try every numbers until we detect 10001 prime numbers
4

Callers

nothing calls this directly

Calls 1

isPrimeFunction · 0.70

Tested by

no test coverage detected