Why can't the product of two primes A and B be congruent to 0 modulo some other ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		cousin_it on June 22, 2016 \| parent \| context \| favorite \| on: Why isn’t the fundamental theorem of arithmetic ob... Why can't the product of two primes A and B be congruent to 0 modulo some other prime C? It's trivial that A * B can't be equal to C, but not as easy to show that it can't be 2 * C, say.

thaumasiotes on June 22, 2016 [–]

This was answered in the same comment tree before you posted the question: https://news.ycombinator.com/item?id=11953790

cousin_it on June 22, 2016 | [–]

Yes, I know the proof. The point is that your original proof sketch didn't acknowledge the need for that lemma.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact