Statement-$1$: The number of $4$-digit numbers that can be formed using the digits $1, 2, 3, 4, 5, 6, 7$ which are divisible by $4$ is $200$.
Statement-$2$: $A$ number is divisible by $4$ if its unit digit is divisible by $4$.

  • A
    Statement-$1$ is true,Statement-$2$ is true. Statement-$2$ is a correct explanation for Statement-$1$.
  • B
    Statement-$1$ is true,Statement-$2$ is true. Statement-$2$ is not a correct explanation for Statement-$1$.
  • C
    Statement-$1$ is true,Statement-$2$ is false.
  • D
    Statement-$1$ is false,Statement-$2$ is true.

Explore More

Similar Questions

If $P(n, r) = 1680$ and $C(n, r) = 70$,then $69n + r! = \dots$.

Difficult
View Solution

Consider the following two statements:
$I.$ If $n$ is a composite number,then $n$ divides $(n-1)!$.
$II.$ There are infinitely many natural numbers $n$ such that $n^3+2n^2+n$ divides $n!$.

If $8 \cdot {}^{7}P_{r} = 7 \cdot {}^{8}P_{r-1}$,what is the value of $r$?

The number of four-letter words that can be formed using the letters of the word $BARRACK$ is

Let $m = (9n^2 + 54n + 80)(9n^2 + 45n + 54)(9n^2 + 36n + 35)$. The greatest positive integer which divides $m$ for all positive integers $n$ is:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo