MHB Minimizing Positive Terms in a Sequence with Alternating Signs

  • Thread starter Thread starter Albert1
  • Start date Start date
AI Thread Summary
To achieve the equation A = 1 with the sequence from 1 to 2009, the goal is to minimize the number of positive signs while balancing the sums of positive and negative terms. The total sum of numbers from 1 to 2009 is 2019045, and half of that is 1009522.5. The optimal strategy involves selecting the 588 largest numbers (from 1422 to 2009) to be positive, along with one additional positive term to ensure the positive sum exceeds the negative sum by 1. This results in a minimum of 589 positive terms needed to satisfy the equation.
Albert1
Messages
1,221
Reaction score
0
A=$1\triangle2\triangle3---------\triangle2008\triangle2009=1$
where $\triangle$ can be replaced only by eather "$+$" or "$-$" , find the least number of "$+$" can be ued to make A=1
 
Last edited:
Mathematics news on Phys.org
Albert said:
A=$1\triangle2\triangle3---------\triangle2008\triangle2009=1$
where $\triangle$ can be replaced only by either "$+$" or "$-$" , find the least number of "$+$" can be used to make A=1
[sp]For the whole sum to be equal to $1$, the sum of the positive terms must be almost the same as the sum of the negative terms. In order to minimise the number of positive terms, it seems clear that we should take the positive terms to be as large as possible (so that there will be fewest of them).

Writing $n$ for $2009$, the sum of all the numbers from $1$ to $n$ is $\frac12n(n+1).$ Suppose that there is a number $r < n$ such that the sum of the $r$ largest numbers in the sequence (namely the numbers $n-r+1$ to $n$ inclusive) is exactly half of the total. The condition for that is $$rn - \tfrac12r(r-1) = \tfrac14n(n+1).$$ Solve that quadratic equation for $r$ to get $$r = \tfrac12\bigl(2n+1 - \sqrt{2n^2 + 2n + 1}\bigr)$$ (taking the negative sign for the square root to ensure that $r<n$). Plugging in the value $n=2009$, I get $r = 588.56...$.

So it looks as though we should take the $588$ largest numbers on the sequence (namely $1422$ to $2009$ inclusive) to have positive signs, and then to have just one further positive term to make the sum of the positive terms $1$ more than the sum of the remaining (negative) terms.

In fact, the sum of all the numbers from $1$ to $2009$ is $2019045$. Half of that is $1009522.5$. So we want the sum of the positive numbers in the sequence to be $1009523$, and the sum of the negative numbers in the sequence to be $1009522.$ The first term in the sum (namely $1$) has no $\triangle$ in front of it, so must necessarily be positive. The sum of the numbers $1422$ to $2009$ is $1008714$, leaving a shortfall of $1009523 - 1008715 = 808$ for the sum of the positive terms.

Thus the minimal number of positive terms is given by taking the numbers $808$, and $1422$ to $2009$ inclusive, to be preceded by $\triangle = +$, and all the remaining triangles to be $\triangle = -.$ That gives the minimal number of "$+$" triangles to be $589.$[/sp]
 
Opalg said:
[sp]For the whole sum to be equal to $1$, the sum of the positive terms must be almost the same as the sum of the negative terms. In order to minimise the number of positive terms, it seems clear that we should take the positive terms to be as large as possible (so that there will be fewest of them).

Writing $n$ for $2009$, the sum of all the numbers from $1$ to $n$ is $\frac12n(n+1).$ Suppose that there is a number $r < n$ such that the sum of the $r$ largest numbers in the sequence (namely the numbers $n-r+1$ to $n$ inclusive) is exactly half of the total. The condition for that is $$rn - \tfrac12r(r-1) = \tfrac14n(n+1).$$ Solve that quadratic equation for $r$ to get $$r = \tfrac12\bigl(2n+1 - \sqrt{2n^2 + 2n + 1}\bigr)$$ (taking the negative sign for the square root to ensure that $r<n$). Plugging in the value $n=2009$, I get $r = 588.56...$.

So it looks as though we should take the $588$ largest numbers on the sequence (namely $1422$ to $2009$ inclusive) to have positive signs, and then to have just one further positive term to make the sum of the positive terms $1$ more than the sum of the remaining (negative) terms.

In fact, the sum of all the numbers from $1$ to $2009$ is $2019045$. Half of that is $1009522.5$. So we want the sum of the positive numbers in the sequence to be $1009523$, and the sum of the negative numbers in the sequence to be $1009522.$ The first term in the sum (namely $1$) has no $\triangle$ in front of it, so must necessarily be positive. The sum of the numbers $1422$ to $2009$ is $1008714$, leaving a shortfall of $1009523 - 1008715 = 808$ for the sum of the positive terms.

Thus the minimal number of positive terms is given by taking the numbers $808$, and $1422$ to $2009$ inclusive, to be preceded by $\triangle = +$, and all the remaining triangles to be $\triangle = -.$ That gives the minimal number of "$+$" triangles to be $589.$[/sp]
very good !
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...

Similar threads

Replies
1
Views
2K
Replies
10
Views
2K
Replies
1
Views
2K
Replies
3
Views
2K
Replies
55
Views
5K
Replies
6
Views
3K
Back
Top