At 07:51 PM 9/27/2013, you wrote:
>This is just idle curiosity but since there are people on this list -
>most of them - smarter than me, someone probably knows the answer.
>
>If a and b are prime numbers, and their product a X b is c, then is c
>divisible by *only* a and b? Guaranteed?  My feeling is that it is but I
>lack the knowledge of what to search for to find the definitive answer.
>
>BTW, this does *not* involve, for me, any sort of cryptography. In other
>words, I'm not trying to re-invent any crypto ciphers.  Thanks!

Yes, for one proof you can see this:-
http://mathworld.wolfram.com/FundamentalTheoremofArithmetic.html

If c was divisible by some number d other than a or b, then d itself could
be expressed as a product of one or more primes and therefore c could be
expressed as a different product of primes, contradicting the theorem.

--sp =20

--=20
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
http://mailman.mit.edu/mailman/listinfo/piclist
.