Consider the set $A = \{1, 2, 3, \ldots, 30\}$. The number of ways in which one can choose three distinct numbers from $A$ such that the product of the chosen numbers is divisible by $9$ is:

  • A
    $1590$
  • B
    $1505$
  • C
    $1110$
  • D
    $1025$

Explore More

Similar Questions

The number of $4$-digit numbers that can be formed from the digits $0, 1, 2, 3, 4, 5, 6, 7$ such that each number contains the digit $1$ is:

Difficult
View Solution

The number of $5$-digit numbers that are not divisible by $5$ and consist of different odd digits is:

$A$ five-digit number divisible by $3$ has to be formed using the numerals $0, 1, 2, 3, 4,$ and $5$ without repetition. The total number of ways in which this can be done is:

The total number of positive integral solutions $(x, y, z)$ such that $xyz = 24$ is

Find the number of natural number solutions to the equation $x_1 + x_2 = 100$,such that $x_1$ and $x_2$ are not multiples of $5$.

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