Math Forum / Mathematics / Undergraduate Math / April 2006

In short, if I don't understand this till monday
I'm F*****, so I I truly, madly, deeply hope you
will have the patience and inner strength to help
me with this.

What point on parabola y = x^2 - 3x + 3 is closest to
origin O ( point T(0, 0) )?
y^2 = (x^2 - 3x + 3)^2
D - distance from point P(x, y) on parabola to T(0, 0)

The Problem:
Let my G = gamma
W = omega
P = phi

does any one know at what value this function changes concavity? if at all.
fx= ln(1/x+1)

Is anyone aware of an equation of degree 5 (or higher) that can be shown to
have solutions that can not be found by the four operations +-*/ or root
extractions by using very very very elementary methods, i.e. no mentioning
of groups, etc.?

1.
Sample sample has 20 possible outcomes. Out of those 20 four outcomes are elements of event A. So P(A) = 4/20
But we could have similar situation, with one difference: there are 16 outcomes in sample space
P(1) = P(2) = ... = P(15), but P(16) = 4*P(1).

I have constructed a new set of commutative rings.
Let S={R,+,*} be  a ring with R the set of numbers.
I have constucted a commutative ring T[P]={R[P],+[P],*[P]} for every
value of P.

Need a quick hand with basic probability
NOTE ON READING THIS -- FOR SOME REASON when I post this on the forum certain characters appear as question marks. I don't know why and cannot fix it. The characters are the apostrophe, quotation marks and dashes, which double as minus ...

I was wondering what kind of a function is used to make the private value from the product and public value?  I am also talking about what kind of functions that are used in computers.

I'm looking for problems that have double (or more) recursion, where
the split is not clean (ie. where there may be overlap).  Let's call
this overlapped recursion, where the same subproblem may have to be
solved multiple times.

I am working on showing that
SS[total] = SS[Residual] + SS[Regression]
Sum[(y - mu[Y])^2] = Sum[(y - y(hat))^2] + Sum[(y(hat) - mu[Y])^2]
I am really just looking for advice on the method I tried, and see if anyone

Yup, I admit it.  All the fighting and arguing for years has to a large
extent been about the short proof of FLT that I have.
Most of you probably knew that, as what else could have the power to
grip so many people to argue, literally for years.  Why else would the

I have found (in a text) the following curious construction of the center of gravity for an arbitrary quadrilateral ABCD.
Trisect all four sides of the quadrilateral.  Name the points (clockwise, starting from A) as follows:  A, J, K, B, L, M, C, N, O, D, P, Q.
Draw lines KL, MN, ...

Big, big problems with absolute value bars when trying to
find such natural numbers N(a) where |-1 - (2-n)/n| < e
e = 1/100
lim[n->00](2-n)/n = -1

As people have argued with me I've continued to simplify and abstract,
and now it has come down to a rather simple statement--though odd in
particular ways--about factoring a polynomial:
7*C(x) = (f(x) + 7)*(g(x) + 1) where f(0) = g(0) = 0