MathGroup Archive 2011

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

Search the Archive

Re: why this system cannot be solved!

  • To: mathgroup at smc.vnet.net
  • Subject: [mg117574] Re: why this system cannot be solved!
  • From: Frank K <fkampas at gmail.com>
  • Date: Wed, 23 Mar 2011 02:54:14 -0500 (EST)
  • References: <im7c6n$7b$1@smc.vnet.net>

On Mar 21, 7:18 am, olfa <olfa.mra... at yahoo.fr> wrote:
> Hi Mathematica community,
>
> I've tried to solve the variable xP in this system with Reduce over
> Integers,Reals and Complexe:
> 0 <= xP < a && Mod[x, a] == Mod[xP, a]
>
> unfortunately it cannot be solved .
>
> the output should be xP==Mod[x,a].
>
> thank you very much for your help.

How about using the definition of Mod?

Reduce[{0 <= xP < a, x ==  n1*a + b, xP ==  n2 * a + c, 0 <= b<= a, 0
<= c< a},{a,b,c,n1,n2,xP},Integers]


  • Prev by Date: Re: Using Nearest on a group of points
  • Next by Date: Multiple Integrals
  • Previous by thread: why this system cannot be solved!
  • Next by thread: NestList integration bug?