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

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Prime
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
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
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
 
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: 88
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