All Exams Test series for 1 year @ ₹349 only
Question

A letter lock consists of three rings with 15 different letters. If N denotes the number of ways in which it is possible to make unsuccessful attempts to open the lock, then

By the fundamental principle of counting, the number of possible settings of the lock is the product of the choices on each ring; exactly one setting opens it, and every other setting is an unsuccessful attempt.

Step 1 — Total settings \(= 15 \times 15 \times 15 = 15^{3} = 3375\).

Step 2 — \(N = 15^{3} - 1 = 3374\).

Step 3 — Factorise: \(3374 = 2 \times 1687 = 2 \times 7 \times 241\), and 241 is prime.

Step 4 — \(482 = 2 \times 241\) divides N, since \(N = 482 \times 7\).

N has exactly three distinct prime factors (2, 7, 241), so it is a product of three distinct primes and not of two; and N contains only one factor 2, so 16 does not divide it.

482 divides N and N is the product of three distinct prime numbers. options are correct.

Was this answer helpful?

Similar Questions

  1. If z1 and z2 are two complex numbers satisfying the equation \(\left|\dfrac{z_1 + z_2}{z_1 - z_2}\right| = 1\), then \(\dfrac{z_1}{z_2}\) may be

  2. If R and R1 are equivalence relations on a set A, then so are the relations

  3. Let a1, a2, a3, …, an be positive real numbers. Then the minimum value of

    \(\dfrac{a_1}{a_2} + \dfrac{a_2}{a_3} + \ldots + \dfrac{a_n}{a_1}\) is

  4. Consider a quadratic equation ax2 + 2bx + c = 0 where a, b, c are positive real numbers. If the equation has no real root, then which of the following is true ?

  5. Let A = \(\begin{pmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}\), B = \(\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}\) and P = \(\begin{pmatrix} 0 & 1 & 0 \\ x & 0 & 0 \\ 0 & 0 & y \end{pmatrix}\) be an orthogonal matrix such that B = PAP−1 holds. Then

  6. Let ρ be a relation defined on set of natural numbers ℕ, as ρ = \(\{(x, y) \in \mathbb{N} \times \mathbb{N} : 2x + y = 41\}\). Then domain A and range B are

  7. Let P(n) = 32n + 1 + 2n + 2 where n ∈ ℕ. Then

  8. Let A and B are orthogonal matrices and det A + det B = 0. Then

  9. Let A be a set containing n elements. A subset P of A is chosen, and the set A is reconstructed by replacing the elements of P. A subset Q of A is chosen again. The number of ways of choosing P and Q such that Q contains just one element more than P is

  10. If one root of x2 + px − q2 = 0, p and q are real, be less than 2 and other be greater than 2, then


Important Questions from Algebra

  1. Let S be the set of the first 11 natural numbers. Then the number of elements in $A = \{B \subseteq S : n(B) \geq 2$ and the product of all elements of B is even is ________.

  2. The number of $3 \times 2$ matrices A, which can be formed using the elements of the set $\{-2, -1, 0, 1, 2\}$ such that the sum of all the diagonal elements of $A^T A$ is 5, is ______
  3. Let $z = (1 + i)(1 + 2i)(1 + 3i) \dots (1 + ni)$, where $i = \sqrt{-1}$. If $|z|^2 = 44200$, then $n$ is equal to _______
  4. Let $a_1 = 1$ and for $n \ge 1, a_{n+1} = \frac{1}{2} a_n + \frac{n^2 - 2n - 1}{n^2(n+1)^2}$. Then $\left| \sum_{n=1}^\infty \left( a_n - \frac{2}{n^2} \right) \right|$ is equal to ____________.
  5. If $ \left(\frac{1}{^{15}C_0} + \frac{1}{^{15}C_1}\right)$ $\left(\frac{1}{^{15}C_1} + \frac{1}{^{15}C_2}\right)$ $\dots$ $ \left(\frac{1}{^{15}C_{12}} + \frac{1}{^{15}C_{13}}\right)$ = $\frac{\alpha^{13}}{^{14}C_0  ^{14}C_1 \dots ^{14}C_{12}} $, then $30\alpha$ is equal to __________.

Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App