2
$\begingroup$

Let $p\in\mathbb Z$, $p>1$. Prove that $$ p\text{ is prime}\iff p\text{ has no divisor }d\text{ where }1

It is easy to show "$\implies$"; if $p$ is prime, then its only positive divisors are 1 and $p$ itself. Therefore, there are no divisors $d$ for which it holds that $1

However, I'm having trouble with "$\impliedby$". I was thinking of using the contrapositive. So assume $p$ is not prime. Then we would like to show that $p$ has a divisor $d$ such that $1

From here on I wouldn't know how to continue. Could someone help me out?

EDIT

This is my proof then, based on the hints given:

Assume $p$ is not prime. Then $p$ must have at least one divisor $d$, such that $1a$. Contradiction. Therefore it holds that $q\leq\sqrt a$ or $d\leq\sqrt a$.

  • 1
    Show that if $a=bc$ then $b\leq \sqrt{a}$ or $c\leq \sqrt{a}.$ – 2017-02-14
  • 1
    Suppose $p$ is not prime but has no divisors smaller than $\sqrt{p}$. The product of any two divisors will be larger than $p$, contradiction... – 2017-02-14
  • 0
    This question feels like a duplicate. – 2017-02-14

2 Answers 2

2

if $p$ is not prime, then it has some divisor $d>1$, and hence $1 < d \leq \sqrt{p}$ or $d > \sqrt{p}$.

If $d > \sqrt{p}$, then $p = dk$ for some $k \leq \sqrt{p}$.

0

Check the lemma (which also proves the existence of prime divisors):

If $n$ is not prime, the smallest non-trivial (i.e. $\ne 1, n$) divisor of $n$ is prime.

Indee, if this smallest divisor is not prime, it has a non-trivial divisor, which is also a divisor of $n$, contradicting the ‘smallest divisor’ property.

Corollary: If $n$ is not prime, the smallest non-trivial divisor $d$ of $n$ is $\le \sqrt n$.

Indeed, suppose $d>\sqrt n$. Then $\;e=\dfrac nd<\dfrac n{\sqrt n}=\sqrt n