Question

plz... help mee
very important.question

Answer 1

hlo..

here the ans is.._____

let a=p1,p2,p3........pn ,where p1 .....pn  are prime numbers
⇒a²=(p1.p2.p3....pn) (p1.p2.p3....pn)
     it is given that p divides a².

from Fundamental Theorem of Algorithm, it following that p is one of the factor of (a²)...
        using the uniqueness part of the Fundamental Theorem of Algorithm, we realise that the only prime factors of (a)² are p1 , p2 ,......pn

so p is one of the factor of p1, p2, p3....pn
   now,since a=p1, p2.....p(n), p divides 'a' 
                         
                        Hence  proved...

hope my ans helps u dear...

                    ^-^

plz....make my ans as brainliest if i deserve