Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 22980dc commit e2ec0baCopy full SHA for e2ec0ba
1 file changed
Doc/library/itertools.rst
@@ -1045,6 +1045,8 @@ The following recipes have a more mathematical flavor:
1045
def factor(n):
1046
"Prime factors of n."
1047
# factor(99) --> 3 3 11
1048
+ # factor(1_000_000_000_000_007) --> 47 59 360620266859
1049
+ # factor(1_000_000_000_000_403) --> 1000000000000403
1050
for prime in sieve(math.isqrt(n) + 1):
1051
while True:
1052
quotient, remainder = divmod(n, prime)
0 commit comments