-1

Let $p$ be a prime and let $n$ be a natural number such that $n \gt a$ .

Prove that $a|p+1$ if and only if exists integers $n,m$

Such that ${\frac{a}{p} = \frac{1}{n} + \frac{1}{m}}$

2 Answers2

1

One direction:

Say $${a\over p}= {1\over m}+{1\over n}\implies amn = p(m+n)$$

Let $g= \gcd(m,n)$ then exists $x,y$ relatively prime such that $m= gx$ and $n= gy$. Then we have $$axyg = p(x+y)\implies x\mid p(x+y) \implies x\mid py \implies x\mid p $$

Case 1: $x=p$ then $ayg = p+y \implies y\mid p\implies y= 1 \implies a\mid p+1$

Case 2: $x=1$ then $ayg = p(1+y) \implies y=1\; \text {or}\; y=p$

If $y=1$ then $m=n$ and $2p= an$ then we can take $n=p$ and $a=2$ and the statement is not true!

If $y=p$ then we get $a\mid p+1$ and we are done.

Other direction: $a\mid p+1$ then $p+1 =an$ so ${a\over p} = {1\over p} +{1\over pn}$ and we are done.

nonuser
  • 90,026
  • In the last equality $\frac{1}{p}$ should be $\frac{1}{n}$, but that is the other answer with 2 downvotes. I guess the "and only if" is not proved. – Dávid Laczkó Dec 05 '20 at 19:02
-2

$a\mid p+1 \iff a\cdot n=p+1\\ \iff\frac{a\cdot n}{p}=1+\frac{1}{p} \\ \iff\frac{a}{p}=\frac{1}{n}+\frac{1}{n\cdot p}$

Let $m:=n\cdot p$ and we are done

  • The downvoters should have really commented here something. – Dávid Laczkó Dec 05 '20 at 19:16
  • I have read and reread Aqua's answer, and I fail to see what is missing in mine. He devotes some effort to prove that it must be the case that either $m=np$ or $n=mp$. However, that also emerges from the algebraic manipulation. The relationships in each step of my answer are biconditional. The implications flow both directions. So what have I missed? – Keith Backman Dec 05 '20 at 22:02