Explain theorem in Number theory

Question

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?

Answer 1

This is a rather simple statement that is written in a pretty unclear manner.

What they are saying is that if p is a prime number and $p\vert ab \implies p\vert a$ or $p\vert b$

This can easily be proven with the following proposition:

If a,b,c are integers with $c\vert ab$ and $gcd(a,c)=1 \implies c\vert b$

As people have said in the comments, the example does not really relate to the theorem at all.