Math Forum / Mathematics / Recreational Math / February 2005

I see a lot of negative postings about my ideas, and surrogate
factoring is getting a lot of bashing, but hey, it's just an idea.
It may not be practical--ever.  But it's still just an idea, and I can
discuss it as just an idea, having long ago backed away from calling it

Hi the world,
Herr Richard, Maple Support, Scientific Computers GmbH reports us
the Maple customers a nice, satisfying the heart piece of news!
It turns out that Maple quality improves in time.... well... or at

Any ideas on the following?
1. Existence
An n by n matrix A = [a_ij] is magic if no two entries are equal,
a_ij being an element of {1,2,...n^2} and

The idea behind surrogate factoring is driven by the way numbers are
selected for RSA encryption, as the way it works is you get two primes
p_1 and p_2, specially chosen so that their product is hard to factor,
and then get that product p_1 p_2, which is your public key.

What does it mean for a set to be *consistent* with another?
What does it mean for that consistency to be transitive and reflexive?
Any explanations are references will be welcome
(This is not a homework question btw. I'm a 46 year old programmer

I was wandering what is the cartesian equation of an helix given its
parametric eq. x=Rcos(phi) y=Rsin(phi) z=k*phi.
Is there anyone could help me?
Thank you in advance!

Sorry to just jump straight in here with a request after being absent for
about a year, but I'm not proud!
As part of a proof of Cassini's Identity for Fibonacci numbers, I've come
across the re-arrangement

I need to give my phone number to someone, but I need to do it the form of a
math equation.
I was going to say something like x = y to the power of 2, but it's too
simple and the square root of my phone number is also 10 digits, and I want

Let me demonstrate you a striking bug identified
about six months ago by the GEMM machine.
In MuPAD 3.1, MuPAD 3.0, MuPAD 2.5.2

Jean-Michel Collard identified an unknown for us Maple bug and
shared it with us the users, great! It takes a man to do this ;)
http://groups-beta.google.com/group/comp.soft-sys.math.maple/msg/85f4fe4af3a798d9
JMC>  Maple 9.5 (IBM INTEL NT)

One of the odder things I face is propaganda postings from people who
make it their business to continually post negatively about my ideas,
when I say that's useless as often I'll post negatively about my own
ideas anyway.

I have the same problem, no idea what to do at all, if anybody can
help please let me know, cheers.

Could anyone explain me in a very simple way the proof for:
for any 2 integers k,l > 0: the sequence k, k+1, k+2, ..., k+l contains
exactly 1 number that has the highest power of 2 in its prime factors.
Example:

Help! im trying to solve this problem! basically, we have been given a
triangle and have been posed the question 'How many integer triangles
are there with longest side n? Help! Im having such problems working
out a formula so you can work out how many tirangles can be made when

This is probably more of a surveyor's question, but I thought
this would be a good place to find the answer as well.
Here's the problem. I have a lot on a survey with sides
annotated as follows: