Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

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

Search the Archive

Re: Simplification with constraints

  • To: mathgroup at smc.vnet.net
  • Subject: [mg72065] Re: Simplification with constraints
  • From: "dimitris" <dimmechan at yahoo.com>
  • Date: Sun, 10 Dec 2006 04:49:25 -0500 (EST)
  • References: <ele6rc$rm9$1@smc.vnet.net>

Something like?

Reduce[f == b*b + c*c + d*d && a*a + b*b + c*c + d*d == 1, {f, b}][[1]]
f == 1 - a^2

Dimitris


Vladimir wrote:
> Suppose we have a constraint:
>
> a*a+b*b+c*c+d*d==1
>
> What is the most elegant and general way to simplify any expression
> considering above constraint for simplification?
>
> For (just a simple) example:
>
> In[]:=simplify[b*b+c*c+d*d]
>
> should give:
> 
> Out[]=1-a*a
> 
> --
> thanks in advance,
> Vladimir


  • Prev by Date: How to plot a parellal line
  • Next by Date: Sin[30*Degree] vs Sin[29*Degree]
  • Previous by thread: Re: Simplification with constraints
  • Next by thread: RE: Simplification with constraints