1. 4006/3006
2. 4003/3007
3. 4006/3008
4. 4006/3009
4006/3009
1. s(1) is correct
2. principle of mathematical induction can be used to prove the formula
3. S(k)≠S(k+1)
4. S(k)=>S(k+1)
S(k)=>S(k+1)
1. 3n(n+1)/2
2. [n(n+1)/2]2
3. n(n+1)2/4
4. n2(n+1)/2
n2(n+1)/2
1. State1llent-1, is true, Statement-2 true, Statement-2 is correct explanation for statement-1
2. Statement-1 is true, statement-2 true is statement-2 not a correct explanation for statement-1
3. Statement-1 is true, Statement-2 is false
4. Statement-1 is false, Statement-2 is true
State1llent-1, is true, Statement-2 true, Statement-2 is correct explanation for statement-1
1. 3
2. 8
3. 9
4. 11
8
1. 3
2. 5
3. 10
4. 15
15
1. 3
2. 8
3. 9
4. 11
9
1. 2
2. 3
3. 7
4. 11
11
1. 24
2. 64
3. 17
4. 676
64
1. 24
2. 64
3. 17
4. 676
676