Re: Diophantine Approach...

<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<

<vision_1967@xxxxxxxxxxx> wrote in message
news:1181761019.200730.82720@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Hi and thanks for your response.

Unfortunately, I do not have the freedom/luxury to factor the original
number to more efficiently get just 2 squares. I've implemented a
modified version of cornacchia's algorithm to get at the squares. The
fact that it occasionally returns 3 squares instead of 2 appears to be
the price of using the algorithm. I originally read the thread you
suggested when investigating the sum of 2 squares but had to throw it
out when I realized that I wouldn't always have access to the prime
factorization of the original number.

<

How large is your number? If it has less than, say, 50 digits, it is rather
easy to factor using modern algorithms and modern hardware.

-Michael.


.

Relevant Pages

  • Re: Not complicated, weird situation
    ... of squares in some way that involves factoring a number you get to ... This is a faaaaantastic algorithm. ... > better than 50% success rate, which is a claim you made but didn't ... > hard work, Harris' work broke into society with the help of Justin, ...
    (sci.crypt)
  • Re: A very fast Fermat factoring algorithm
    ... there is a way to speed up Fermat's method by considering only the squares ... there are a several known techniques to speed Fermat ... > I'd rather not share the technique just yet. ... > nothing like Fermat's algorithm, but it has the same runtime ...
    (sci.crypt)
  • Re: Mutual Visibility Field Of View
    ... I agree that if you send out enough rays for a given radius, ... But the bottleneck is in visiting all 10,000 squares (my map ... of the reasons why I developed my algorithm. ... of previous walls that have been encountered in a view. ...
    (rec.games.roguelike.development)
  • Re: Math/Programming Algorithm Help
    ... I'm having trouble with an algorithm. ... grid of size NxN, they need to click to activate N number of squares, so ... that all the activated squares are contiguous, ie, they each squares shares ... You might also read a little bit about graph theory. ...
    (comp.lang.java.help)
  • Avoiding random trial and error
    ... every time random trial and error" algorithm. ... computing time and memory than a "deterministic" algorithm would take. ... no matter how rare were the valid squares and how many of them ... method did it, while the "shuffle" errored. ...
    (rec.games.roguelike.development)