Can Trigonometry and Geometry Prove that ab+pq is Not Prime?

  • MHB
  • Thread starter anemone
  • Start date
  • Tags
    Prime
In summary, the conversation discusses a problem involving integers and a given equation. The goal is to prove that a certain expression is not prime. The solution proposed involves using trigonometric and geometry skills to approach the problem. The conversation ends with the suggestion that the solution is a great way to showcase the application of these skills in solving number theory problems.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Let $a,\,b,\,p,\,q$ be integers with $a>b>p>q>0$.

Suppose that $ap+bq=(b+q+a-p)(b+q-a+p)$.

Prove that $ab+pq$ is not prime.
 
Mathematics news on Phys.org
  • #2
anemone said:
Let $a,\,b,\,p,\,q$ be integers with $a>b>p>q>0--(1)$.

Suppose that $ap+bq=(b+q+a-p)(b+q-a+p)---(2)$.

Prvoe that $ab+pq$ is not prime.
from (1)(2)we must have:
$p\geq q+1$
$b\geq q+2$
$a\geq q+3$
$ap+bq\geq (q+2+q+q+3-q-1)(q+2+q-q-3+q+1)=(2q+4)(2q)$
is not prime
$\therefore ab+pq\geq (q+2)(q+3)+(q+1)q=2q^2+6q+6$
is not prime
 
  • #3
Thanks, Albert for participating and also the solution. :)

I want to share with MHB a solution that I thought is great to showcase how trigonometric and geometry skills could be used to tackle a number theory problem such as this one, and I hope you will like it as much as I do:
View attachment 3889

The equality $ap+bq=(b+q+a-p)(b+q-a+p)$ is equivalent to $a^2-ap+p^2=b^2+bq+q^2\tag{1}$.

Let $ABPQ$ be the quadrilateral with $AB=a,\,BP=q,\,PQ=b,\,AQ=p,\,\angle BAQ=60^{\circ}$ and $\angle BPQ=120^{\circ}$.

Such a quadrilateral exists in view of the equation we obtained in (1) and the Law of Cosines.

The common value in (1) is $BQ^2$. Let $\angle ABP=\theta$ so that $\angle PQA=180^{\circ}-\theta$.

Applying the Law of Cosines to triangles $ABP$ and $APQ$ gives

$a^2+q^2-2aq\cos \theta=b^2+p^2+2bp\cos \theta$

Hence $2\cos \theta=\dfrac{a^2+q^2-b^2-p^2}{aq+bp}$ and $AP^2=a^2+q^2-aq\left(\dfrac{a^2+q^2-b^2-p^2}{aq+bp}\right)=\dfrac{(ab+pq)(ap+bq)}{aq+bp}$.

Because $ABPQ$ is cyclic, Ptolemny's Theorem gives $(AP\cdot BQ)^2=(ab+pq)^2$.

It follows that

$\dfrac{(ab+pq)(ap+bq)}{aq+bp}\cdot (a^2-ap+p^2)=(ab+pq)^2$.

or simply $(ap+bq)(a^2-ap+p^2)=(ab+pq)(aq+bp)$.

Next, observe that
$ab+pq>ap+bq>aq+bp\tag{2}$.

The first inequality follows from $(a-q)(b-p)>0$, and the second from $(a-b)(p-q)>0$.

Now, assume that $ab+pq$ is prime, it then follows from (2) that $ab+pq$ and $ap+bq$ are relatively prime. Hence, from $(ap+bq)(a^2-ap+p^2)=(ab+pq)(aq+bp)$, it must be true that $ap+bq$ divides $aq+bp$.

However, this is impossible by (2). Thus $ab+pq$ must not be prime.

One example that satisfies the given conditions is $(65,\,50,\,34,\,11)$.
 

Attachments

  • Prove ab+bq isn't composite.JPG
    Prove ab+bq isn't composite.JPG
    13.3 KB · Views: 65

FAQ: Can Trigonometry and Geometry Prove that ab+pq is Not Prime?

How do you prove that ab+pq is not prime?

To prove that ab+pq is not prime, we can use the definition of a prime number, which states that a prime number is only divisible by 1 and itself. If we can find at least one other number that can divide ab+pq, then we can prove that it is not prime.

Can you provide an example of how to prove ab+pq is not prime?

Yes, for example, let's take the expression 6x+15. We can factor out 3 from both terms, giving us 3(2x+5). Since both 2x and 5 are integers, we can see that 3 is a common factor, and therefore, 6x+15 is not a prime number.

What is the difference between a prime and a composite number?

A prime number is a positive integer that is only divisible by 1 and itself, while a composite number is a positive integer that has at least one other positive integer as a factor besides 1 and itself.

What are some common factors that can help prove ab+pq is not prime?

Some common factors that can help prove ab+pq is not prime are 2, 3, 5, 7, and 11. However, any positive integer that is not 1 or the expression itself can be a factor.

Can ab+pq be prime in certain cases?

Yes, it is possible for ab+pq to be prime in certain cases. For example, if both a and b are equal to 1, and p and q are equal to 2, then ab+pq would be equal to 1+4, which is a prime number (5). However, this is just one possible scenario, and in most cases, ab+pq will not be prime.

Similar threads

Replies
9
Views
2K
Replies
2
Views
1K
Replies
1
Views
1K
Replies
3
Views
2K
Back
Top