MHB Find the number of positive integer values

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Integer Positive
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Hi MHB,

This problem drives me crazy because first, I have not encountered a problem like this before (but this is only an excuse and it must be my incompetence that holds me back from cracking it successfully) and I called off the attempt because I don't think I can solve it.

Problem:

For how many positive integer values of n does the equation $2x^2+689x+n=0$ have an integer solution?

Attempt:

roots$=\dfrac{-689 \pm \sqrt{689^2-8n}}{4}=\dfrac{-689 \pm k}{4}$ where $k=\sqrt{689^2-8n}$ hence

roots$=-172.25+0.25k, -172.25-0.25k$

roots$=-172.25+m-0.25, -172.25-(m-0.25)$ where $m-0.25=0.25k$

roots$=-172.5+m, -172-m$

In order for the original given quadratic equation to have only one integer solution, we see that $m$ must be an integer.

If we work on the product of the roots, we see that

$(-172.5+m)(-172-m)=\dfrac{n}{2}$

which simplifies to

$59340+m-2m^2=n$

Okay, if I let $m=150$ I then get $n=14490$ but I don't believe I have to try out all the possible values of $m$ for this problem.


And I don't know what else I can do to determine the number of positive integers $n$ that the problem asks right from where I stopped.

Any help/advice would be greatly appreciated. Thanks!
 
Mathematics news on Phys.org
Hint: Try using:

$$n=-2k^2-689k$$ where $$k\in\mathbb{Z}$$.

Can you show then that one of the roots must be $x=k$?

And then solve $$n>0$$ to see how many integers you get.
 
MarkFL said:
Hint: Try using:

$$n=-2k^2-689k$$ where $$k\in\mathbb{Z}$$.

Can you show then that one of the roots must be $x=k$?

And then solve $$n>0$$ to see how many integers you get.

Hi MarkFL,

Thanks for helping me out again!

Now everything makes perfect sense to me...the problem told us $n$ is positive integer, and we could rewrite the given quadratic equation to make $n$ the subject and then set its equivalent greater than zero...

So from

$$n=-2k^2-689k$$ where $$k\in\mathbb{Z}$$,

we have

$$n=k(-2k-689)$$

and since the quadratic equation has only one integer root, then $x=k$ must be right and now, if we set $n>0$, we need to consider for two cases. First case deals with the case where $k<0$ and second be the case where $k>0$.

If $k<0$, in order for $n>0$, we see that we must set $-2k-689<0$ or $k>-344.5$.

The number of positive $n$ values that we can get here is hence 344.

The second case gives us zero solution. Therefore, the total number of positive integer values of $n$ such that the equation $2x^2+689x+n=0$ have an integer solution is 344.

Thank you Mark for your help!
 
Last edited:
Yes, I get the same number of values. I found with the value for $n$ I suggested, we get:

$$f(x)=(x-k)\left(2(x+k)+689 \right)=0$$

The first factor gives us the integral root:

$$x=k$$

While the second root is:

$$x=-\left(k+\frac{689}{2} \right)$$

which cannot be an integer for any value of $k$.

In order for $n$ to be a positive integer, we require:

$$2k^2+689k<0$$

$$k(2k+689)<0$$

Thus:

$$-344\le k\le-1$$

And, as you found, there are 344 values $n$ may have to satisfies the given requirements.
 
solution by MARKFL and anemone both good

here is another

let (2x+ a)(x+b) = 2x^2+689x+n

as n is +ve both a and b positive or -ve,

a is odd else 2 integer solutionsor 2x^2 + (a + 2b) = 2x^2+689x+n

a and b cannot - ve as sum is positive

0 < 2b < 689 and hence 0 < b < 344.5

so there are 344 values of b and also n
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top