Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #1586
| From | Dana DeLouis <dana.del@gmail.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Re: why this system cannot be solved! |
| Date | 2011-04-11 11:05 +0000 |
| Organization | Steven M. Christensen and Associates, Inc and MathTensor, Inc. |
| Message-ID | <inunab$2b8$1@smc.vnet.net> (permalink) |
On Mar 21, 7:18 am, olfa <olfa.mra...@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]. Hi. Not sure if this helps. Simplify[ Mod[xP, a], 0<=xP<a] xP equ= Mod[xP, a]==Mod[x, a]; Doesn=92t seem to work on the entire equation: Simplify[equ,0<=xP<a] Mod[x,a]==Mod[xP,a] Seems to work on the parts: Map[Simplify[#,0<=xP<a]&, equ] xP==Mod[x,a] = = = = Dana DeLouis=
Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread
Re: why this system cannot be solved! Dana DeLouis <dana.del@gmail.com> - 2011-04-11 11:05 +0000
csiph-web