For how many integer values of x there exists positive integer solutions for , such that: where x is an integer and p is any fixed prime number .
A proof will be much better than an integer answer. Since I already know how to solve it, please provide your own proofs.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Here is my solution:
First let us consider that x and x+p are imperfect squares. Now gcd(x,x+p)=1 or p. So, if they are imperfect squares there will be no solutions.
Proof:
For gcd(x,x+p)=p we must have x=ap where a is an integer not 0. Doing some manipulation gives us that S=pa(a+1). Now product of two consecutive integers cannot be a perfect square.
So, we must have x=N2 and x+p=Y2 where N,Y are integers.
And now:
(Y+N)(Y−N)=p
Which implies that either of them =1 or p. Doing some algebra will prove that there are two solutions.
hint :- square on both sides, do some expansion and then factorize.
Log in to reply
I made the problem, as such I already know the answer.
We have to find the number of integer solutions to the equation x(x+p)=S2. First consider the case when x>1. Note that gcd(x,x+p)=1 or p. But we know that the product of two coprime integers can never be a perfect square, so we must have gcd(x,x+p)=p which implies p∣x. Let x=pq, where q is an integer. Then x(x+p)=pq∗(p+1)q=q2p(p+1). This has to be a perfect square, and since q2 is a perfect square, so must be p(p+1). p(p+1) cannot be a perfect square for p>3. When x=1, p+1 has to be a perfect square. For all p>3, there are no such primes since S2−1=(S+1)(S−1). Hence (x,p)=(1,3) is the only possible solution.
Log in to reply
There are several errors in your proof that need correction., since x=1,p=3 implies gcd(1,4)=1, and obviously, 3∣1.
Log in to reply
It has been corrected now. Please check if there are more mistakes remaining.
Log in to reply
x and x+p are perfect squares there will exist a solution. It will differ for different values of p. There will be 2 solutions to the equation for all p>2.
The point is that, wheneverLog in to reply
p to be a fixed prime for all such ordered pairs (x,S) satisfying the given relation. As it is written, one could interpret your question so that we are asked to find the size of the set X={x∈Z:∃(pprime∩S∈Z+∩S=x(x+p))}. In this case, there are infinitely many such x, since for each odd prime p=2m+1 for some positive integer m, there exists at least one integer x=m2 such that S=x(x+p)=m(m+1) is a positive integer.
Your phrasing of the original question is vague, because it is not clear whether or not you intendLog in to reply
p is any fixed prime >2. Would that do?
Actually, yes. I think I should have stated thatAfter stating that gcd(x,x+p)=1 or p, you should have considered that S will have a solution when x and x+p are both perfect squares.
awesome
i can only prove that S must be even
Log in to reply
Proving S is even does not need this much manipulation. All primes greater than 2 are odd, so x and x+p have different parities, thus their product must be even. Hence S2 is even which implies so is S.
Your statement that S must be even is correct, but I did not approach the problem this way. .
Log in to reply
then whats your method.....?
i think for every prime there is a solution of x eg- (1,3)(4,5)(9,7)(11,25) i.e x= (p^2 -2*p +1)/4
Log in to reply
The prime is fixed, and for every odd prime there are 2 solutions.