Question

prove that prime numbers are infinite​

Answer 1

P = p1p2 pn + 1. The number P has remainder 1 when divided by any prime pi, i = 1,...,n, making it a prime number as long as P ≠ 1. ... Therefore, there are infinitely many prime numbers. Alternatively, one can leave out the assumption and let p1,...,n be any ar- bitrary finite list of prime numbers.

Answer 2

0% { -webkit-transform: rotateX(0deg) rotateY(360deg) rotateZ(90deg); }

25% { -webkit-transform: rotateX(90deg) rotateY(270deg) rotateZ(180deg); }