Re: New integer multiplication algorithm
From: Oscar Lanzi III (ol3_at_webtv.net)
Date: 02/18/05
- Next message: Timothy Little: "Re: On Well-Ordering(s) and Sets Dense in the Reals, Infinity"
- Previous message: The World Wide Wade: "Re: John Gabriel's Theorem Revisited."
- In reply to: Proginoskes: "Re: New integer multiplication algorithm"
- Messages sorted by: [ date ] [ thread ]
Date: Thu, 17 Feb 2005 18:04:39 -0600
On a totally different note, this algorithm could be used to test
whether a number is a square. If a coded string square root can be
found which has all even digits, then replacing the 2's by 1's in that
string gives the binary representation for the square root. That should
be easy to do with only two choices for each digit. It comes from the
fact that the half-difference associated with teh factorizaiton N*N is
zero. Try it with 9, then with something les obvious like 28,561.
--OL
- Next message: Timothy Little: "Re: On Well-Ordering(s) and Sets Dense in the Reals, Infinity"
- Previous message: The World Wide Wade: "Re: John Gabriel's Theorem Revisited."
- In reply to: Proginoskes: "Re: New integer multiplication algorithm"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|