Thread: Problem 26
View Single Post
  #1  
Old June 10th, 2007, 09:56 PM
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,758 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 Problem 26

This one is not so bad.

1)Let f(x) be an n-th degree* polynomial function such that f(x)\geq 0. Define the function g(x) as:
g(x) = f(x) + f'(x) + f''(x) + ... + f^{(n)}(x). Show that g(x)\geq 0.

2)What is the least number of moves that a player can make to give a checkmate?

*)And the condition that f(x) \not \equiv 0 because the degree of a zero polynomial is not defined. The degree of a constant non-zero polynomial is defined to be zero. However, some authors in field theory differ on their defintions of the degree of the zero polynomial. Some define it to be -1 and other to be \infty. The way I learned it the zero polynomial had an undefined degree. This is why I make such a comment just in case you spotted the mistake in my first sentence.
__________________

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.

Last edited by ThePerfectHacker; June 11th, 2007 at 01:57 PM.