Thank you! I guess you understood the question now. Consider K and X >=0, non-negative.
On Nov 24, 2007 10:41 PM, Nat Padmanabhan <[EMAIL PROTECTED]> wrote: > > 0 is not a positive number....your problem statement is wrong then > > On Nov 24, 2007 10:56 PM, Rupesh Bhochhi <[EMAIL PROTECTED]> wrote: > > ok for instance, if K=2 then we will will have: 1.x1 + 2.x2 = 2. > > Here the possible number of solution will be 2, namely: x1=2, x2=0 or > x1=0, > > x2=1. Please let me know if any confusion.. > > > > > > On Nov 24, 2007 9:50 PM, Nat Padmanabhan < [EMAIL PROTECTED]> > wrote: > > > > > > I am not sure I understand the problem, > > > > > > x1=1, x2=1/2, x3=1/3....xk = 1/k is a trivial solution > > > > > > > > > > > > > > > On Nov 24, 2007 10:41 PM, Rupesh Bhochhibhoya <[EMAIL PROTECTED]> > wrote: > > > > > > > > Hello Geeks, > > > > > > > > Is there any efficient algorithm for finding number of possible > > > > combination of X variables for the given value of K? where all X and > K > > > > are positive integers. > > > > > > > > > > > > > > > > > > > > > > > -- > > Rupesh Bhochhibhoya, [EMAIL PROTECTED] > > Oklahoma State University > > Stillwater, OK 74075 > > > > > > > > > -- Rupesh Bhochhibhoya, [EMAIL PROTECTED] Oklahoma State University Stillwater, OK 74075 --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
