If `P_(n)` is the set of first n prime numbers, then `underset(n=3)overset(10)capP_(n)` is

If p_(n) is the set of first n prime numbers, then underset(n=2)overset(10)(U)P_(n)=

If A_(n) is the set of first n prime numbers, then underset(n=2)overset(10)UA_(n)=

If A_(n) is the set of fiest n prime numbers, then underset(n=2)overset(10)UA_(n)=

If A_(n) is the set of first n primes then bignn_(n=3)^(10) A_(n)=

If A_(n) is the set of first n primes than, uu_(n=2)^(10) A_(n)=

Evaluate underset(n=2)overset(10)Sigma 4^(n)

If A_n = P_n + 1 , where P_n is the product of the first n prime numbers, then consider the following statements : 1. A_n is always a composite number. 2. A_n + 2 is always an odd number. 3. A_n +1 is always an even number. Which of the above statements is/are correct ?

If N is the sum of first 13986 prime numbers, then N is always divisible by

If N is the sum of first 13,986 prime numbers, then N is always divisible by

underset(n=1)overset(oo)sum(x^(n))/(n+2)=