Home
Class 11
MATHS
Statement-1: The number of zeros at the ...

Statement-1: The number of zeros at the end of 100! Is, 24.
Statement-2: The exponent of prine p in n!, is
`[(n)/(p)]+[(n)/(p^(2))]+.......+[(n)/(p^(r))]`
Where r is a natural number such that `P^(r)lenltP^(r+1)`.

A

Statement-1 is True, Statement-2 is true, Statement-2 is a correct explanation for Statement-1.

B

Statement-1 is True, Statement-2 is True, Statement-2 is not a correct explanation for Statement-1.

C

Statement-1 is True, Statement-2 is False.

D

Statement-1 is False, Statement-2 is True.

Text Solution

Verified by Experts

Statement-2 is true (see section-2 on page 13.2) Also, Statement-1 is true (see illustrations 3 on page 13.2)
Promotional Banner

Similar Questions

Explore conceptually related problems

Statement-1: The number 1000C_(500) is not divisible by 11. Statement-2: The exponent of prime p in n! is [(n)/(p)]+[(n)/(p^(2))]+[(n)/(p^(3))]+......+[(n)/(p^(x))]" where "p^(k)lenltp^(k+1)

Statement-I: The exponent of 3 in 100! is 48 . Statement-II: If n is a t ve integer and p is a prime number then exponent is [(n)/(p)]+[(n)/(p^(2))]+[(n)/(p^(3))]+...

Statement-1: The number of divisors of 10! Is 280. Statement-2: 10!= 2^(p)*3^(q)*5^(r)*7^(s) , where p,q,r,s in N.

P(n,r)+P(n-1,r-1)=

11. Prove that nP_(r)=n(n-1)P_(r-1)

Statement -1: The expression n!(20-n)! is minimum when n=10 . because Statement -2: .^(2p)C_(r) is maximum when r=p .

If .^(n)P_(r)=3024 then (n,r) is

Prove that the number of combinations of n things taken r at a time in which p particular things always occur is .^(n-p)C_(r-p)