Is there any collection of examples that <> disprove Fermat's
last Theorem?

In other words:

Has anyone studied integers a, b, c, n, and e, such that

a^n + b^n = c^n + e, where a, b, c are positive, n > 2, and abs(e) is
really small, compared to a, b, and c?

Hello All,

Here is a nice simple-looking riddle that leads to heavy mathematics.

Assume that there are 4 dogs in each corner of a square on a plane
(around the origin) at initial time.
Where the start gun is fired, each dog want to get his neighbor (lets
say, clock wise neighbor). The questions are, will the dogs get each
other? Will they stop runing some time if the dogs are infinitesimaly
small? What is the trajectory they will draw? How can you describe the
motion near the origin?

->-----------------
- \/
- -
- -
/\ -

Dear Newsgroup:

The following are Basti Newsgroups:
Sci.math:

http://groups.google.com/group/MBScimath?hl=en

Sci.physics:

http://groups.google.com/group/MBSciphysics?hl=en

and Sci,comp (public):

http://groups.google.com/group/MBScicomp/about?hl=en

Sign in at Google site. You need to fill out a form (regulations).

If you are interested in another newsgroup, please let us know (no fee
is involved at this time).

Dr.Mehran Basti

I love this from Jack Handey in the New Yorker:

"Try this simple test: flip a coin, over and over again, calling out
“Heads!” or “Tails!” after each flip. Half the time people will ask
you to please stop."

Posted by Paul Epstein

http://mathworld.wolfram.com/RadicalInteger.html
example;
7^(1/3) + (-2)^(1/2) - Sqrt[3 + (1 + Sqrt[2])^(1/4)]

On 3 Jul, 02:59, Terry/Padden bigpond.net.au> wrote:

How do you define the various categorical operations in D, i.e.
domains, codomains, composition etc.?

Presumably for any given category, C, we can form another category, D, whose
objects are the morphisms of C and whose morphisms are the objects of C.

What is the standard name for D ?

Can anyone recommend a web reference for elementary convexity theory
(sorry but I don't have a book on this and don't plan to buy one.)
I'd like to see rigorous proofs on things like Jensen's inequality,
the fact that convex functions only have countably many
discontinuities, and the equivalence of the second-derivative
definition with the elementary definition.

Thank you very much.

Paul Epstein

Hello,
I have a few questions on complexity theory which are perhaps easy to
answer for an expert or perhaps at least for a beginner in the field.

1. Is the problem CLIQUE(n) that decides weather an input graph has
got an n-clique or not in NP? I suppose it is, because I know that
CLIQUE (that gives the maximal clique of an input graph) is in NP.

2. Is it true that the class of languages generated by all context
sensitive grammars which is called the "type 1 languages" is PSPACE
complete (which means that the word problem for type 1 languages is
PSPACE complete)?

3. Have you got a common example for a P-complete language? Perhaps
the type 2 word problem (languages generated by context free grammars)
which is in P by the CYK algorithm?

4. Is it true that the problem of determining the chromatic number for
an input graph is in NP? I know that "3-colorability" is NP complete.

Hi,
I wonder if any of you could help solve this equation--not for values--but to express y in terms of x, c, and a. C and a are constants.

5 + (8/(1-x)) = y / (cx - a)

where 'cx' means c times x

I'm ending up with a quadratic for x that's kind of hairy.
Thanks,
Brad