Math Forum / Mathematics / General Topics / February 2010

Okay, I know there is an easy way to do this, but at this point I've
over thought it, completely reinvented math, and just seemingly come
back to x=x every time.
My scenario is this:

I have made the decision to better my math skills. I took the hard
road through highschool. I did not ever try to get called on, infact,
I uderly tried to avoid it. Most of this problem lies in my earlier
years of math. I didnt fly through those multiplication cards we had

For labeled trees with n nodes, there is a unique correspondence
between trees and their Prüfer numbers. Does there exist something
analogous for unlabeled trees (or at least for binary trees) such that
one can algorithmically compute from a given tree its number and vice

Dodeca Developer
Ohio
4Months+
Required Experience:

This is priliminary and needs a lot of review , but most certainly,
by proportions as described in part 6 the values are as follows
1=  1.0051754368
3=  3.0155263158

Consider (1) under the given conditions.
a^2 = b^k + c.2^(nk)                          (1)
Conditions: All the variables are integers each > 1; a, b, c are odd,
k is a prime > 3.

I've performed some test of a system (it doesn't matter what the test
does). In short the system enhances a given estimate.
The test is performed with a set of parameters chosen manually.
 - The system tests e.g. 20 different "positions".

let X, Y and I be three (non empty) sets and
{f_i:X->Y} a family of distinct surjective maps
indexed by I.
Can you find distinct injective maps {g_i:Y->X}

let S be an infinite set. I have two questions.
(I) Does there exist a partition of S into finite
subsets X_i with cardinality at most 2?
(II) Does there exist a bijective map f:S->S which

True or false?

Mills ratio is defined as (1 - cdfN(x)) / pdfN(x) or in words as
the quotient of the complementary cumulative normal distribution
and its derivative (up to a minus sign).
For example G. Marsaglia uses that to numerical compute the cdfN

I want to estimate computationally the CDF of a particular test
statistic (described below).  Since I'm particularly interested in
getting a good estimate of the tails of this distribution, I'm
really looking for a suitable importance-sampling algorithm.

As I need this result in another posting to come, I write down the proof
of the result here, not wanting to make the other post too long.
The assertion is the following : Let A(n) be the alternating group on n
elements (labeled x1,..,xn), then the group G, generated by A(n) and ...

I have a 3D graphics book, which gives the formula for absorption of radiance along a ray.  I am trying to derive the details and would like to see if my derivation is correct.
Let o(p) be the probability density that light is absorbed per unit length at point p.
They give the ...

Concurrent sentences on several charges, eligible for parole in 2017, will
be deported to Morocco.
THE CANADIAN PRESS
MONTREAL - A rural Quebec man was sentenced to life in prison Wednesday for