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.
Published at
2024-10-14 21:12:12Event JSON
{
"id": "3aaba96302b6953bf77f8cb789c060dd754886e39bef2da89f2bae76e73c7589",
"pubkey": "2e4c52d9cd9d4a364a52ec51f1a3cde7af3aae803e9d60e5ec058397e3609ab9",
"created_at": 1728940332,
"kind": 1,
"tags": [
[
"proxy",
"https://mathstodon.xyz/users/davidradcliffe/statuses/113307833618766531",
"activitypub"
]
],
"content": "If N is the product of two primes, p \u003c 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.",
"sig": "6381937d33f76c8095e679409087c5c341564eb5da3d80358682d64217ac3e0e5ff63258068bf68160042e617e58512b70c942c8462d738cdb546e305f11d6cf"
}