Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2023-01-05 10:21:49 +0200 | received badge | ● Notable Question (source) |
| 2022-08-20 13:44:28 +0200 | received badge | ● Popular Question (source) |
| 2019-10-26 11:20:32 +0200 | commented answer | Factoring vs Prime identification thank you sir! |
| 2019-10-26 11:19:23 +0200 | asked a question | Factor function in Sage For factoring large semi-primes (140bit +) is there any GNFS or Msieve in sage? What does factor() use under the hood? |
| 2019-10-07 17:53:27 +0200 | received badge | ● Student (source) |
| 2019-10-07 17:47:56 +0200 | asked a question | Factoring vs Prime identification Hey folks, I generated two random primes, using Which gave me: and Multiplying them to get a semiprime I get: So maybe this is my miscomprehension, but when I try to run: factor(on the semiprime) -- it takes a long time, never completing. When I run isPrime(on the semiprime) -- it instantly returns false. If indeed sage generates proper primes (non pseudoprimes) how can isPrime be so efficient. Does verifying that a number ISNT prime, not require identifying a factor? If so, why does factorisation take so long? Thanks |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.