Prove a sum is a composite number

  • Context: MHB 
  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Composite Sum
Click For Summary
SUMMARY

The discussion revolves around proving that for positive integers \( p, q, r, s \) satisfying the equation \( ps = q^2 + qr + r^2 \), the expression \( p^2 + q^2 + r^2 + s^2 \) is a composite number. Participants clarify that if \( p - q - r + s = 1 \), then the equation simplifies to \( p^2 + q^2 + r^2 + s^2 = p + q + r + s \), which only holds true when \( p = q = r = s = 1 \). However, this case contradicts the original equation, thus confirming that \( p^2 + q^2 + r^2 + s^2 \) must indeed be composite.

PREREQUISITES
  • Understanding of algebraic expressions and composite numbers
  • Familiarity with positive integer properties
  • Knowledge of basic algebraic manipulation
  • Ability to analyze mathematical proofs
NEXT STEPS
  • Study properties of composite numbers in number theory
  • Learn about algebraic identities and their applications
  • Explore proofs involving positive integers and their relationships
  • Investigate the implications of specific integer conditions in algebraic equations
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in algebraic proofs and properties of composite numbers.

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
For positive integers $p,\,q,\,r,\,s$ such that $ps=q^2+qr+r^2$, prove that $p^2+q^2+r^2+s^2$ is a composite number.
 
Mathematics news on Phys.org
My solution:

From the given:

$$ps=q^2+qr+r^2$$

We obtain:

$$q^2+r^2=2ps-(q+r)^2$$

And so:

$$p^2+q^2+r^2+s^2=p^2+2ps+s^2-(q+r)^2=(p+s)^2-(q+r)^2=(p+q+r+s)(p-q-r+s)$$

Which shows the given expression is composite.
 
Nice one, MarkFL! Thanks for participating too. :)
 
if one talks of algebraic expression being composite I agree but if one talks of the number being composite this is not correct as one of the factors could be 1
 
kaliprasad said:
if one talks of algebraic expression being composite I agree but if one talks of the number being composite this is not correct as one of the factors could be 1
That possibility is easily eliminated. If $p-q-r+s = 1$ then the equation becomes $p^2+q^2+r^2+s^2 = p+q+r+s$. That can only hold for positive integers if $p=q=r=s=1$. But in that case the equation $ps = q^2+qr+r^2$ does not hold.
 
Opalg said:
That possibility is easily eliminated. If $p-q-r+s = 1$ then the equation becomes $p^2+q^2+r^2+s^2 = p+q+r+s$. That can only hold for positive integers if $p=q=r=s=1$. But in that case the equation $ps = q^2+qr+r^2$ does not hold.

addition of above completes the proof. IN other words this was the missing link. Thanks Opalg
 
Opalg said:
That possibility is easily eliminated. If $p-q-r+s = 1$ then the equation becomes $p^2+q^2+r^2+s^2 = p+q+r+s$. That can only hold for positive integers if $p=q=r=s=1$. But in that case the equation $ps = q^2+qr+r^2$ does not hold.

Thanks Opalg to the rescue.:o

Another method (I'll admit that I overlooked the necessity to show that $p-q-r+s \ne 1$, as I thought that was quite obvious and now after pondering about it, I owed MHB a good and solid reason why $p-q-r+s \ne 1$).

We will prove it by contradiction.

Suppose $p+s = 1+q+r$ Then squaring it and using the fact $ps = q^2+qr+r^2$ twice gives

$p^2+s^2+(q-1)^2+(r-1)^2=1$

However, since $p^2+s^2 \ge 2$, we have reached to a contradiction.

Therefore, $p-q-r+s \ge 2$ and $p^2+q^2+r^2+s^2$ is composite.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K