Community

Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
Login Register Memberlist Search AoPS Blogs Contests Galleries Forum Index
The time now is Mon Dec 07, 2009 11:57 am
All times are UTC - 8
View posts since last visit
View unanswered posts
Shapiro for software specialists
Moderators: High School Olympiad Moderators, Arne, blahblahblah, Cezar Lupu, darij grinberg, harazi, Megus, N.T.TUAN, orl, pbornsztein, pvthuan
Post new topic   Reply to topic View previous topicView next topic
1 Post • Page 1 of 1
Author Message
spanferkel
Yang-Mills Theory
Yang-Mills Theory


Offline
Joined: 15 Oct 2005
Posts: 664
Germany

To rate posts you must be logged in
#1
Shapiro for software specialists
oh yes, computer algebra can be useful

Hi,

can one of the Chinese computer specialists in this forum calculate an equality case for the n=14 case of
\sum_{i=1}^n \frac{x_i}{x_{i+1}+x_{i+2}} \geq k\frac{n}{2}
with maximal k?
I would be interested to know if such an equality case is unique (up to cyclic permutation), if it has a similar structure as the well-known counterexamples for k=1 (i.e. all x_i rather 'close' to 0 or 1), and what the degree(s) of the minimal polynomials involved would be.

Thank you very much.
_________________
There are three kinds of people:
Those who can count and those who can't.
Very Happy Juggle

PostPosted: Thu Nov 05, 2009 4:52 am  Back to top 
  ProfilePM
Display posts from previous:   Sort by:   
1 Post • Page 1 of 1
Post new topic   Reply to topic View previous topicView next topic
Jump to:  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum


© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us