MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Diophantic Equations with Constraints


"Michael S." <MikeSuesserott at t-online.de> wrote in message
news:cdj1t2$nbi$1 at smc.vnet.net...
> Hi group,
>
> given an equation like
>
> 3x + 2y - z == 148
> with
> x in Range[3,8],
> y in Range[0,12],
> z in Range[1,9],
>
> what would be the best way to solve this?

I suppose that by Diophantic (-tine?) you mean that x, y, z are integers.
This is a particularly easy set to solve (if it has a solution) by brute
force.  Just nest some for loops three deep (or build the Mathematica
construct of your choice) and try all 6*13*9=72 candidates.

Hth,
Fred Klingener


  • Prev by Date: Simplify doesn't simplify SparseArrays
  • Next by Date: Admin - Posts getting filtered
  • Previous by thread: Re: Diophantic Equations with Constraints
  • Next by thread: Re: Diophantic Equations with Constraints