English

HSC Science (Electronics) 11th Standard - Maharashtra State Board Question Bank Solutions for Mathematics and Statistics

Advertisements
[object Object]
[object Object]
Subjects
Popular subjects
Topics
Advertisements
Advertisements
Mathematics and Statistics
< prev  141 to 160 of 2051  next > 

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

Advertisements

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

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

(23n − 1) is divisible by 7

[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:

(24n−1) is divisible by 15

[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:

3n − 2n − 1 is divisible by 4

[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:

5 + 52 + 53 + .... + 5n = `5/4(5^"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:

(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)

[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:

Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 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),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N

[2.4] Methods of Induction and Binomial Theorem
Chapter: [2.4] Methods of Induction and Binomial Theorem
Concept: undefined >> undefined
< prev  141 to 160 of 2051  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×