English

HSC Science (General) 11th Standard - Maharashtra State Board Question Bank Solutions

Advertisements
Subjects
Topics
Subjects
Popular subjects
Topics

Please select a subject first

Advertisements
Advertisements
< prev  2301 to 2320 of 4286  next > 

How many numbers between 100 and 1000 have 4 in the units place?

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

How many numbers between 100 and 1000 have the digit 7 exactly once?

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Advertisements

How many four digit numbers will not exceed 7432 if they are formed using the digits 2, 3, 4, 7 without repetition?

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

If numbers are formed using digits 2, 3, 4, 5, 6 without repetition, how many of them will exceed 400?

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

How many numbers formed with the digits 0, 1, 2, 5, 7, 8 will fall between 13 and 1000 if digits can be repeated?

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

A school has three gates and four staircases from the first floor to the second floor. How many ways does a student have to go from outside the school to his classroom on the second floor?

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

How many five-digit numbers formed using the digit 0, 1, 2, 3, 4, 5 are divisible by 5 if digits are not repeated?

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Select the correct answer from the given alternatives.

A college offers 5 courses in the morning and 3 in the evening. The number of ways a student can select exactly one course, either in the morning or in the evening

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Select the correct answer from the given alternatives.

A college has 7 courses in the morning and 3 in the evening. The possible number of choices with the student if he wants to study one course in the morning and one in the evening is -

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

How many words can be formed by writing letters in the word CROWN in different order?

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Answer the following:

A hall has 12 lamps and every lamp can be switched on independently. Find the number of ways of illuminating the hall.

[2.3] Permutations and Combination
Chapter: [2.3] Permutations and Combination
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

2 + 4 + 6 + ..... + 2n = n (n+1)

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

3 + 7 + 11 + ..... + to n terms = n(2n+1)

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

13 + 33 + 53 + .... to n terms = n2(2n2 − 1)

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined

Prove by method of induction, for all n ∈ N:

`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined
< prev  2301 to 2320 of 4286  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×