0
$\begingroup$

Lets say we have $n$, an odd semiprime. $p$ and $q$ are odd primes, such that $pq=n$. What are the tightest upper and lower bounds of $p+q$ in terms of $n$ known right now? Right now, I have $2\sqrt n\leq p+q<n$ but I don't know if that's the tightest possible.

$\endgroup$
4
  • 2
    $\begingroup$ upper would be when $p=3$ and lower would be when $p=\sqrt n$ $\endgroup$ Commented Jun 16, 2019 at 20:43
  • $\begingroup$ No, I meant what is the range of values $p+q$ can fall into. $\endgroup$
    – DUO Labs
    Commented Jun 16, 2019 at 20:45
  • $\begingroup$ Note: $p+q=p+n/p$ $\endgroup$ Commented Jun 16, 2019 at 20:46
  • $\begingroup$ Yes, but how is that any helpful? $\endgroup$
    – DUO Labs
    Commented Jun 16, 2019 at 20:47

1 Answer 1

3
$\begingroup$

Summing up the comments; without loss of generality $3\leq p\leq\sqrt{n}\leq q$, and because $n=pq$ we have $$p+q=p+\tfrac np,$$ which is maximal when $p$ is minimal, and minimal when $p$ is maximal. Hence $$2\sqrt{n}\leq p+q\leq 3+\tfrac n3.$$

$\endgroup$
5
  • $\begingroup$ Is this the tightest possible? $\endgroup$
    – DUO Labs
    Commented Jun 16, 2019 at 21:21
  • $\begingroup$ In what sense? For each semiprime $n$ the value of $p+q$ is uniquely determined, but my answer gives a range of values. For $n=9$ both inequalities are tight, though. $\endgroup$
    – Servaes
    Commented Jun 16, 2019 at 21:27
  • $\begingroup$ Also, why use $3$? $\endgroup$
    – DUO Labs
    Commented Jun 16, 2019 at 21:42
  • $\begingroup$ Because $p$ is an odd prime, so $p\geq3$. $\endgroup$
    – Servaes
    Commented Jun 17, 2019 at 11:26
  • $\begingroup$ Ok, thank you very much. $\endgroup$
    – DUO Labs
    Commented Jun 17, 2019 at 16:17

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .