can some one explain with a clear example this theorem for me,
Let ($A_1$, $A_2$, $A_3$,..., $A_n$) be integars and $p$ a prime number.
if $p|(A_1A_2A_3...A_n)$ then there exist some $1 \leq k \leq N $ such that $p|A_k$.
Then there is a example on this which says,
is 6^100 divisible by 64? answer is yes, why is this? 64 is not a prime number the theorem says p must be a prime number?