Thread: Problem 43
View Single Post
  #6  
Old December 11th, 2007, 10:37 AM
ThePerfectHacker's Avatar
ThePerfectHacker ThePerfectHacker is offline
Global Moderator

 
Join Date: Nov 2005
Location: New York City
Posts: 11,186
Country:
Thanks: 482
Thanked 3,754 Times in 3,070 Posts
ThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond repute
Default

I came up with problem #1 accidently when I playing around with polynomials. Here is my original solution, however it seems to me that this problem is easy even if approached directly.

Proof:
Let a_1,...,a_n be real (or complex numbers) and define f(x) = (x-a_1)...(x-a_n). The key step is to note that f'(x_k) = P_k by using the general product rule for derivatives. Now, \deg f(x) = n\geq 2 thus, \deg f'(x) = n-1\geq 1, this means that f'(x) cannot attain the same values at a_1,a_2,...,a_n (meaning f(a_1)=f(a_2)=...=f(a_n)) because otherwise the situation is that a degree n-1 polynomial attains the same value n times for n distinct numbers. Which is impossible. Thus, P_1,P_2,...,P_n cannot all be the same.
__________________

To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.


"Democracy has proved only that the best way to gain power
over people is to assure the people that they are ruling
themselves. Once they believe that, they make wonderfully
submissive slaves." - Joseph Sobran


To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.