Friday, December 29, 2006

Van Roomen's Problem

Adriaan Van Roomen was a professor of mathematics and medicine in Louvain who had developed a strong reputation as one of the top mathematicians of his age. In 1593, he published a survey of the most important living mathematicians. In this work, he proposed a math problem that he dared any of these top mathematicians to solve:

(45)x - (3,795)x3 + (95,634)x5 - (1,138,500)x7 + (7,811,375)x9 - (34,512,075)x11 + (105,306,075)x13 - (232,676,280)x15 + (384,942,375)x17 - (488,494,125)x19 + (483,841,800)x21 - (378,658,800)x23 + (236,030,652)x25 - (117,679,100)x27 + (46,955,700)x29 - (14,945,040)x31 + (3,764,565)x33 - (740,259)x35 + (111,150)x37 - (12,300)x39 + (945)x41 - (45)x43 + x45 = A

where:



To show that Van Roomen had a solid understanding of this monstrous equation, he observed the following:

(a) If:



Then:



(b) If:



Then:



(c) If:



Then:



This problem was mentioned in a meeting between the Dutch ambassador and the King Henry IV of France. The Dutch ambassador had noted that not a single French mathematician had been listed in van Roomen's survey of the great mathematicians.

King Henry IV presented the problem to François Viète who was able to solve it. Viète's solution is historically significant because he not only demonstrated how trigonometry can be used to solve algebraic equations, he also showed that this problem possessed 45 different solutions. This result was important in helping to establish the Fundamental Theorem of Algebra.

How did Viète solve it? I will show his solution in my next blog.

References

2 comments:

Thomas Jude said...

Dear Larry Freeman,

I have visited your blog on Fermat Last theorem and very impressed with your knowledge in maths and presentation. I am an embedded software developer and I am very much interested in Maths. I have done some amateur steps for solving the FLT. I have one question:

if a^n + b^n = c^n

Then is there any proof that one of a, b or c should be prime?

Larry Freeman said...

Hi Thomas,

There is a simple proof that if any solution exists where a,b,c are not relatively prime (that is, there is at least one prime that divides two of them), then there must exist a smaller solution that does not include that common factor. See here for the proof.

Likewise, if a relatively prime solution exists, then there must exist an infinite number of solutions since if a^n + b^n = c^n then (m^n)(a^n) + (m^n)(b^n) = (m^n)(c^n) and (am)^n + (bm)^n = (cm)^n.

Cheers,

-Larry