<Dd> s p 1 = p 2 ⋯ p m = q 2 ⋯ q n . (\ displaystyle (\ begin (aligned) (\ frac (s) (p_ (1))) & = p_ (2) \ cdots p_ (m) \ \ & = q_ (2) \ cdots q_ (n). \ end (aligned))) </Dd> <P> Reasoning the same way, p must equal one of the remaining q . Relabeling again if necessary, say p = q . Then </P> <Dl> <Dd> s p 1 p 2 = p 3 ⋯ p m = q 3 ⋯ q n . (\ displaystyle (\ begin (aligned) (\ frac (s) (p_ (1) p_ (2))) & = p_ (3) \ cdots p_ (m) \ \ & = q_ (3) \ cdots q_ (n). \ end (aligned))) </Dd> </Dl> <Dd> s p 1 p 2 = p 3 ⋯ p m = q 3 ⋯ q n . (\ displaystyle (\ begin (aligned) (\ frac (s) (p_ (1) p_ (2))) & = p_ (3) \ cdots p_ (m) \ \ & = q_ (3) \ cdots q_ (n). \ end (aligned))) </Dd>

What do you mean by fundamental theorem of arithmetic