Advertisements
Advertisements
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 -
Concept: undefined >> undefined
How many words can be formed by writing letters in the word CROWN in different order?
Concept: undefined >> undefined
Advertisements
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.
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
2 + 4 + 6 + ..... + 2n = n (n+1)
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
3 + 7 + 11 + ..... + to n terms = n(2n+1)
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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)`
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
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)`
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)`
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)`
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))`
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
(24n−1) is divisible by 15
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
3n − 2n − 1 is divisible by 4
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)
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
Concept: undefined >> undefined
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
Concept: undefined >> undefined
Answer the following:
Prove, by method of induction, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
Concept: undefined >> undefined
