Home
Class 12
MATHS
Number of zero's at the ends of prod (n...

Number of zero's at the ends of ` prod _(n=5)^(30)(n)^(n+1) ` is :

A

111

B

147

C

137

D

None

Text Solution

AI Generated Solution

The correct Answer is:
To find the number of zeros at the end of the expression \( \prod_{n=5}^{30} n^{n+1} \), we need to determine how many times 10 is a factor in the product. Since \( 10 = 2 \times 5 \), we will find the minimum of the number of factors of 2 and 5 in the product, as the limiting factor will determine the number of trailing zeros. ### Step-by-Step Solution: 1. **Understanding the Expression**: The expression can be rewritten as: \[ \prod_{n=5}^{30} n^{n+1} = 5^6 \cdot 6^7 \cdot 7^8 \cdots \cdot 30^{31} \] 2. **Finding Factors of 5**: We will count how many times 5 appears as a factor in the product. We will consider each term \( n^{n+1} \) for \( n = 5 \) to \( 30 \). - For \( n = 5 \): \( 5^6 \) contributes 6 factors of 5. - For \( n = 10 \): \( 10^{11} = (5 \cdot 2)^{11} \) contributes 11 factors of 5. - For \( n = 15 \): \( 15^{16} = (3 \cdot 5)^{16} \) contributes 16 factors of 5. - For \( n = 20 \): \( 20^{21} = (4 \cdot 5)^{21} \) contributes 21 factors of 5. - For \( n = 25 \): \( 25^{26} = (5^2)^{26} = 5^{52} \) contributes 52 factors of 5. - For \( n = 30 \): \( 30^{31} = (6 \cdot 5)^{31} \) contributes 31 factors of 5. Now, we sum these contributions: \[ 6 + 11 + 16 + 21 + 52 + 31 = 137 \] 3. **Finding Factors of 2**: Next, we will count how many times 2 appears as a factor in the product. However, since factors of 2 will be more abundant than factors of 5, we can skip the detailed counting for this problem. 4. **Conclusion**: The number of trailing zeros in the product is determined by the number of factors of 5, which we calculated to be 137. Thus, the number of zeros at the end of \( \prod_{n=5}^{30} n^{n+1} \) is **137**.
Promotional Banner

Topper's Solved these Questions

  • PERMUTATION AND COMBINATIONS

    VIKAS GUPTA (BLACK BOOK) ENGLISH|Exercise Exercise-2 : One or More than One Answer is/are Correct|4 Videos
  • PERMUTATION AND COMBINATIONS

    VIKAS GUPTA (BLACK BOOK) ENGLISH|Exercise Exercise-3 : Comprehension Type Problems|2 Videos
  • PARABOLA

    VIKAS GUPTA (BLACK BOOK) ENGLISH|Exercise Exercise-5 : Subjective Type Problems|3 Videos
  • PROBABILITY

    VIKAS GUPTA (BLACK BOOK) ENGLISH|Exercise Exercise -5 : Subjective Type problems|11 Videos

Similar Questions

Explore conceptually related problems

Let n!, the factorial of a positive integer n, be defined as the product of the integers 1,2, …n. In other words, n! =1 xx 2xx……xxn . What is the number of zeros at the end of the integer 10^(2)! + 11^(2)! + 12^(2)! + --- + 99^(2)! ?

Consider the number N=2016 . Find the Number of cyphers at the end of .^(N)C_(N//2) is

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) .

Let n be an odd natural number greater than 1. Then , find the number of zeros at the end of the sum 99^n+1.

If (1.5)^(30)=k , then the value of sum_((n=2))^(29)(1.5)^n , is :

If f(n)=prod_(r=1)^(n)cos r,n in N , then

Probability if n heads in 2n tosses of a fair coin can be given by prod_(r=1)^n((2r-1)/(2r)) b. prod_(r=1)^n((n+r)/(2r)) c. sum_(r=0)^n((^n C_r)/(2^n))^2 d. (sumr=0n(^n C_r)^2)/(sumr=0 2n(^(2n)C_r)^)

Statement 1: 1 is a natural number. Statement 2: (n^(5))/(5)+(n^(3))/(3)+(6n)/(15) is a natural number for all n in NN .

For some natural number 'n', the sum of the first 'n' natural numbers is 240 less than the sum of the first (n+5) natural numbers. Then n itself is the sum of how many natural numbers starting with 1.

For positive integer n_1,n_2 the value of the expression (1+i)^(n1) +(1+i^3)^(n1) (1+i^5)^(n2) (1+i^7)^(n_20), where i=sqrt-1, is a real number if and only if (a) n_1=n_2+1 (b) n_1=n_2-1 (c) n_1=n_2 (d) n_1 > 0, n_2 > 0