What is Nostr?
David Radcliffe /
npub19ex…vnda
2024-10-14 21:12:12

David Radcliffe on Nostr: If N is the product of two primes, p < q, then 𝑝=gcd(𝑁,βŒŠβˆšπ‘βŒ‹!) . This ...

If N is the product of two primes, p < q, then 𝑝=gcd(𝑁,βŒŠβˆšπ‘βŒ‹!) . This is not a practical factorization method, because we don't know an efficient algorithm to compute factorials mod N. But it makes me wonder if a similar sequence of highly composite numbers could be used as the basis of an efficient algorithm for integer factorization.
Author Public Key
npub19ex99kwdn49rvjjja3glrg7du7hn4t5q86wkpe0vqkpe0cmqn2usmwvnda