Results 1 to 2 of 2

Math Help - Diophantine issue...

  1. #1
    Spudman
    Guest

    Diophantine issue...

    I have a series of equations:

    x0*y0 = t0
    x1*y0 + x0*y1 = t1
    x2*y0 + x1*y1 + x0*y2 = t2
    x3*y0 + x2*y1 + x1*y2 + x0*y3 = t3

    and so on... where tn are constants >= 0, xn, yn are either 1 or 0
    I am trying to find a way to compute solutions for a given set of 't' constants
    (Obviously only certain sets of 't' constants have solutions ). The number
    of equations may be potentially quite large ( ie hundreds! ).
    Any ideas ?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Apr 2009
    From
    Atlanta, GA
    Posts
    408

    256

    Are these the only four equations, or are you implying that you have a very large chain of equations following this form?

    Given n equations and constants \{t_0,t_1,...t_{n-1}\} you have 2n variables, and therefore 2^{2n} solutions which you can easily iterate through for low values of n.

    I guess the question here is how efficient do we really need to be, or can we just brute-force it?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Diophantine eq
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: April 5th 2011, 03:31 PM
  2. Diophantine equation
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: July 7th 2010, 07:18 AM
  3. Diophantine eqn
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: January 29th 2010, 12:37 PM
  4. TI - 89 TI issue
    Posted in the Calculators Forum
    Replies: 3
    Last Post: October 10th 2009, 10:45 PM
  5. Log Issue
    Posted in the Algebra Forum
    Replies: 2
    Last Post: June 11th 2009, 09:09 PM

Search Tags


/mathhelpforum @mathhelpforum