Open problem? Diophantine equations.

["Marko Riedel" <mriedel@xxxxxxxxxxxxx>]

Hi folks,

I spent a week learning how to manipulate hypercomplex numbers in
order to compute certain combinatorial sums and wrote a Maple library
for this purpose. It's on my combinatorics page on my home page.

http://www.geocities.com/markoriedelde/combnumth.html

In the end it turned out that the problem in question had a fairly
simple solution. I nonetheless enjoyed discovering properties of
hypercomplex numbers like e.g. the fact that there are more than n
roots of the equation w^n = 1. I actually found some of these roots
for n=5 and n=7, first numerically and then analytically.

I am always interested in doing Maple code work.

Best regards,

-- 
+------------------------------------------------------------+
| Marko Riedel, EDV Neue Arbeit gGmbH, mriedel@neuearbeit.de |
| http://www.geocities.com/markoriedelde/index.html          |
+------------------------------------------------------------+