Talk:Prime decomposition: Difference between revisions
Content added Content deleted
m (Add ==headers== to first sections.) |
(→C edits: can't be more than 8: new section) |
||
| Line 66: | Line 66: | ||
The GMP version of the C code is ''bad''. It can't realistically handle any number with a prime factor that's larger than 64 bit (so it's pretty pointless to use GMP to begin with), is written in a convoluted way, and leaks memory. Keeping it here only serves as a bad influence. If there are no objections soon, I'll delete it. --[[User:Ledrug|Ledrug]] 03:39, 4 August 2011 (UTC) |
The GMP version of the C code is ''bad''. It can't realistically handle any number with a prime factor that's larger than 64 bit (so it's pretty pointless to use GMP to begin with), is written in a convoluted way, and leaks memory. Keeping it here only serves as a bad influence. If there are no objections soon, I'll delete it. --[[User:Ledrug|Ledrug]] 03:39, 4 August 2011 (UTC) |
||
== C edits: can't be more than 8 == |
|||
I'm reverting the last change of array size from 8 to 30, since it's mathematically impossible to have more (or fewer than) 8 numbers after each run. If you disagree because some diagnostic software says other wise, show me where it will fail. --[[User:Ledrug|Ledrug]] 20:59, 7 September 2011 (UTC) |
|||