Home » Ask & Discuss » Mathematics. » Algebra « Back to Discussion
Algebra
Celebrate my CENTURY
None
This is the 100th message that I am posting. So in order to celebrate this ocassion, I am giving a problem which I believe, everyone will like.
Suppose a,b,c are integers with a > 1, & p is a prime number. Show that if ax^2 + bx + c is equal to p for two distinct integral values of x, then ax^2 + bx + c cannot be equal to 2p for any integral value of x.
I enjoyed this sum & I hope others will enjoy this too.
Comments (4)
4 Feb 2007 13:39:01 IST
Like
0 people liked this
yes i also wanted to give similar solution as the above one
from the 1st equation (c-p)/a belongs to I as the product of 2 integers is integer
then from 2nd (c-2p)/a belongs to I
i.e. (c-p)/a -p/a is integer, this cant be true as p is not divisible by a
4 Feb 2007 15:34:41 IST
Like
0 people liked this
i would like to point out one thing here, that a should not be equal to p otherwise product of roots for the 2nd equation will become (c-2p)/p = (c-p)/p -1, now since (c-p)/p is aleady an integer, (c-2p)/p also becomes integer.
(this is my 100th post)












c-p=a
let ax2 + bx +c=2p have roots(j,k are integers)
c-2p=ajk (2)
in (1) subtract p on both sides and substitute in (2)
a
implies
a(
as a>1 (
this is not possible.
that solves the problem!