Math Forum / Mathematics / Undergraduate Math / February 2009

I really need the Engineering Mechanics Statics Bedford Fowler 5th
edition or 4th preferably the fifth if any one has it!

I have a simple ( and incomplete ) magic ( maybe not so magic ) square where
the only element we are given is the one at the middle 35 and 4 more
integers forming a cross around 35. Clockwise from the top the numbers are
32, 46, 38 and 24. we can see that 2*35=(32+38) and ...

I'm aware that "Z" is symbol for the cyclic group of integers (with
addition). I also know that "nZ" represents the sub-group of Z that
is obtained by taking every n-th element of Z (starting with the
identity).

Mathguy2009 wrote:
http://mathforum.org/kb/message.jspa?messageID=6621234

hello,
I have no experience with mathematica, but I want (have to) solve the following problem:
The problem is a complex system of equations with 31 equations and 31 unknowns (the unknown are delta_i  i=1,...,31).
The equation is as follows. (beta and alpha are parameters and set ...

JSH has given this parametric solution to x^2 - d y^2 = 1, with d = f1
f2 + 1:
x(v) = (f1 + f2 v^2)/(f1 - f2 v^2 - 2 v) - (2 d v/(f1 - f2 v^2 - 2 v) +
   1 - (f1 + f2 v^2)/(f1 - f2 v^2 - 2 v))/(d - 1)

I have the following boundary value problem on the wave PDE: (Problem #4
on Page 87 of Strauss')
U_tt = c^2 U_xx-r*U_x
where 0<x<l and, U(0,t)=U(l,t)=0 and U(x,0)=\phi(x) U_t(x,0)=\psi(x)

From
http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/graphI
ntro.htm
It gives the algorithm to compute the Transpose of a directed graph -
Algorithm for computing GT from G in representation of graph G is

Why the following recurrence relation will lead to T(n) = 2n + 1?
http://www.oniva.com/upload/1356/rec.jpg
For instance,
T(5) = 5 + 1 + ( .... )

For years I've been dealing with a problem where mathematical proofs
I've discovered are not being accepted by the mathematical community,
and tracing it back, I found that over a hundred years ago a
devastating error entered into the math field, which is so devastating

OK, folks. The JSH Troll has gotten his 15 minutes of fame.
He clearly will never listen to what you are saying, so
perhaps it is time to simply stop responding.

Mathguy2009 wrote (in part):
http://mathforum.org/kb/message.jspa?messageID=6619252

does anybody have any working knowledge of the essence of euclids books on number theory, and how to tackle them best?

Let H be a subgroup of S_n, the symmetric group. How to prove that H = A_n, the alternating group, given that the order of H is n!/2?
I thought about the set H intersect A_n. Since A_n is a normal subgroup of G, H intersect A_n is a normal subgroup of G too. For n>=5, A_n is ...

I will say I've been surprised by a willingness of posters to use the
same tactics against my solution to the factoring problem as they've
used against my other research.  You might say that before I didn't
think they'd have the nerve!