Math Forum / Mathematics / General Topics / July 2009

235PIRV FTP LHP
PP WSP £SP TTP NHP
  HHP   AP LPP   P

Was analyzing resistor errors today ...
Two resistors in series, bottom one to ground, with a tap point in between.
Here is a voltage divider page on the web:
http://en.wikipedia.org/wiki/Voltage_divider

First bisect an angle and then bisect each of the halves.
Now you have trisected three quarters of the angle. One
of these quarters becomes the first term of a series.
Next bisect the remaining quarter and bisect each half of it.

Or let me ask the following:
will the general theory of differentiation of measures (on R) stay the same if we replace in our definitions (e.g. density) every [x-r, x+r] by [x-a*r,x+(1-a)*r] for some fixed 0 < a < 1? will the Radon-Nikodym theorem still holds?

Again I'm stuck with optimizing a function subject to some
constraints.
I came to know KKT (Karush–Kuhn–Tucker) to solve it, but I couldn't
get a solution.

Hy again,
I'm supposed to get the answer to this question in the trigonometric
form. The problem is I don't understand the meaning of the first part.
1 + 2i cis 5pi/6

m^[2](f(x)) - 2 m( f(x+1)) + f(x+2) = 0
        f(p^[2](x))  - 2 f(p(x)) +  f(x) = 0
On R , f  known and inversible  ,
Is there any likeness between solutions (m,p) of

(Note: cross-posted in alt.sci.math.probability)
Friends,
First, I want to assure you that this isn't a homework problem (I only
wish it were). While this is definitely work-related, I've made it

Now I have no dork.

I am here to do math, not play games.

2
y * x   =  Z 3
   MC
    M=/= T E    e = mc3

Glup

The relation between the complexity classes P and NP is studied in computational complexity theory, the part of the theory of computation dealing with the resources required during computation to solve a given problem. The most common resources are time (how many steps it takes ...

I'm looking for conditions for the following rather strange
looking series to converge for certain ranges of values:
 ... c_{-2}.e^f(x)''  +  c_{-1}.e^f(x)'  +
      c_0.e^f(x) + c_1.e^int(f(x)).dx + c_2.e^int(int(f(x))) + ...

Given quadratic polynomial x^2+D (D is a positive, square free, rational number), if the roots of x^2+D are
in number field Q(a), how can we find these roots in
Q(a)? What algorithms are useful for this?