Questions

M.C.Q (1 Marks)

Take a timed test

7 questions · self-marked practice — reveal the answer and mark yourself.

Question 11 Mark
If p(n): 2n < (1 × 2 × 3 × ... × n). Then the smallest positive integer for which p(n) is true is:
  1. 1
  2. 2
  3. 3
  4. 4
Answer
  1. 4

Solution:

The smallest positive integer for which P(n) is 4.

P(4) = 24 < (1 × 2 × 3 × ... × 4)

P(4) = 16 < 24.

View full question & answer
Question 21 Mark
If $10^\text{n} + 3 \times 4^{\text{n}+2}+\lambda$ is divisible by 9 for all $\text{n}\in\text{N},$ then the least positive integer value of $\lambda$ is 
  1. 5
  2. 3
  3. 7
  4. 1
Answer
  1. 5

Solution:

Given,

$10\text{n }+3\times^{\text{n}+2}+\lambda$ is divisible by 9,

$\text{P}(1)=10^1+3\times4^{1+2}+\lambda$ is exactly divisible by 9 then the value of $\lambda$ is 5.

View full question & answer
Question 31 Mark
If $\text{i}^2=-1,$ then the sum $\text{i}+\text{i}^2+\text{i}^3+...$ upto 1000 terms is equal to:
  1. 1
  2. -1
  3. i
  4. 0
Answer
  1. 0

Solution:

$\text{i}+\text{i}^2+\text{i}^3+\text{i}^4+...\text{i}^{1000}$

$\text{i}+\text{i}^2+\text{i}^3+\text{i}^4 \ [\because\text{i}^2=-1,\text{i}^3=-\text{i and} \ \text{i}^4=1]$

$=\text{i}-1-\text{i}+1$

$=0$

Similarly, the sum of the next four terms of the series will be equal to 0. This is because the powers of i follow a cyclicity of 4. Hence, the sum of all terms, till 1000, will be zero.

$\text{i}+\text{i}^2+\text{i}^3+\text{i}^4+...\text{i}^{1000}=0$

View full question & answer
Question 41 Mark
A student was asked to prove a statement p(n) by induction. He proved p(K + 1) is true whenever p(k) is true for all $\text{k}>5\in\text{N}$ and also p(5) is true. On the basis of this he could conclude that p(n) is true.
  1. For all $\text{n}\in\text{N}$
  2. For all n > 5
  3. For all $\text{n}\geq5$
  4. For all n > 5
Answer
  1. For all $\text{n}\geq5$

Solution:

P(n) is true for all positive integer n, i.e. $\text{n}\geq5,$

Where P(n) is a Propositional function, complete two steps:

Basic Step: Verify that the proposition P(1) is true.

Inductive Step: Show the conditional statement,

$\big[\text{P}(1) \wedge \text{P}(2) \wedge-\wedge\text{P}(\text{k})\big]\rightarrow\text{P(k+1)}$ holds for all positive integer.

View full question & answer
Question 51 Mark
If xn - 1 is divisible by $\text{x}-\lambda,$ then the least positive integral value of $\lambda$ is:
  1. 1
  2. 2
  3. 3
  4. 4
Answer
  1. 1

Solution:

Given

xn - 1

We know that

x = k is the root of the equation(x - 1)

⇒ xn - 1 = 0

⇒ xn = 1

Hence, the least positive integral value of $\lambda$ is 1.

View full question & answer
Question 61 Mark
For all $\text{n}\in\text{N},$ 3 × 52n+1 + 23n+1 is divisible by:
  1. 19
  2. 17
  3. 23
  4. 25
Answer
  1. 17

Solution:

3.52n+ 1 + 23n+1 is divisible by 17, $\text{n}\in\text{N}$

Step 1: 3.52(1)+1 + 23(1) + 1

3.53 + 24 = 391

Step 2: Assuming True for n = k

Hence, it is proved that 3.52n+1 + 23n+1 is divisible by 17.

View full question & answer
Question 71 Mark
If p(n): $49^\text{n}+16^{\text{n}}\lambda$ is divisible by 64 for $\text{n}\in\text{N}$ is true, then the least negative integral value of $\lambda$ is:
  1. -3
  2. -2
  3. -1
  4. -4
Answer
  1. -1

Solution:

(49)n + 16n - 1

⇒ (1 + 48)n + 16n - 1

⇒ 1 + 48n + ... 48n + 16n - 1

⇒ 64n + nC2(48)2 + nC3(48)3 + ... + (48)n

⇒ 64(n + nC2(6)2 + nC3(6)348 + ... + (6)n 8n-2)

$\therefore$ 49n + 16n - 1 is divisible by 64

View full question & answer