Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^3: Triangle Numbers Revisited

by tall_man (Parson)
on Oct 15, 2004 at 19:30 UTC ( #399625=note: print w/replies, xml ) Need Help??

in reply to Re^2: Triangle Numbers Revisited
in thread Triangle Numbers Revisited

I'm talking about an intermediate step. I'm looking for three odd squares that add to the number 8*M+3. I pick the first number, k, by brute force working down from the square root. So then I have to solve:
N = 8*M + 3 - k^2 i^2 + j^2 = N
There are choices for k that don't work. I want to eliminate them quickly and move on to the next k in the loop instead of spending time trying all combinations of i and j. Eventually I will find an answer, but that choice of k won't be part of it.

For example, if N is a multiple of an odd power of 3, the quadratic problem can't be solved in integers. So I can eliminate about 1/3 of the possible choices for k.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://399625]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (7)
As of 2018-02-21 05:58 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (275 votes). Check out past polls.