User Portlet
| Discussions |
|---|
| a) I have established three squares that equal RSA230(750 bit number). b) I'm trying to use E. Catalan's equation to reduce them to two squares, which would factor RSA230 (if it is 1 mod 4 semiprime) c) I've had the solve[] command doing this run... |
| thanks, I noticed after I posted that solutions in either prime as modulus always have 1 as one of the variables, which simplifies the equation tremendously, Once again, thanks for replying |