Hey there, I've been having some problems trying to prove this:(adsbygoogle = window.adsbygoogle || []).push({});

"Let p be an integer other than 0, +/- 1 with this property: Whenever b and c are integers such that p | bc, then p | b or p | c. Prove p is prime. [Hint: If d is a divisor of p, say p = dt, then p | d or p | t. Show that this implies d = +/- p or d = +/- 1.]"

Proving p *can* be prime isn't too difficult, but proving p *must* be prime has really confused me.

I've tried going down the path, gcd(p,b) = p if p | b. Which means p = pn + bm, but since b = px, p = pn + pxm = p(n + mx) => n + mx = 1. This doesn't seem to get me anywhere though.

Then I've tried using b = pn, c = pm and tried various manipulations such as b / n = c / m => bm = cn = pmn but I just don't see how I can get it in the form p = dt.

Now, if I got it to the form p = dt, I'm not sure how I could prove p must be prime. Who's to say its not prime? I don't know it seems like I'm thinking in circles here. (Sorry for not properly defining n,m and x I just assumed they were integers to save time). Any help would be greatly appreciated. Unfortunately my professor has been out of town for the entire week so I've been unable to seek help from him (its still due though of course :P).

**Physics Forums - The Fusion of Science and Community**

# Proving an integer is prime

Have something to add?

- Similar discussions for: Proving an integer is prime

Loading...

**Physics Forums - The Fusion of Science and Community**