[algogeeks] Re: Finding the n integers given the set of sums.

2007-11-08 Thread anvera
for this interesting problem! Have a nice day, Antonio On Nov 7, 10:28 pm, anvera [EMAIL PROTECTED] wrote: Why not? Does order really matters here? Look at the symmetry of the problem. Put 3,4,5,5 and then 4,5,6,7 at the right side. Look at the solutions. How they differ? Is this natural? On Nov 7, 6

[algogeeks] Re: Finding the n integers given the set of sums.

2007-11-07 Thread anvera
I have not developed entirely the idea, but I am sure it works. Just write the corresponding linear system. You will have n unknowns and n(n-1)/2 equations. Provided that the system is consistent you can find a solution by Gaussian elimination. For the complexity, you can do it in less than n^3/3

[algogeeks] Re: Finding the n integers given the set of sums.

2007-11-07 Thread anvera
= ? x1 + x4 = ? x2 + x3 = ? x2 + x4 = ? x3 + x4 = ? On 7 нояб, 20:16, anvera [EMAIL PROTECTED] wrote: I have not developed entirely the idea, but I am sure it works. Just write the corresponding linear system. You

[algogeeks] Re: efficient method of exponation

2007-09-13 Thread anvera
Hi, you can find the answers on the book The Art of Computer Programming of Knuth, volume 2, known as Seminumerical Algorithms. Good luck! On 8 sep, 23:13, mukesh tiwari [EMAIL PROTECTED] wrote: hello everybody . for a given value i have to find a lowest possible steps in exponation . i