Let $m$ and $n$ $(m < n)$ be two $2$-digit numbers. Then the total number of pairs $(m, n)$ such that $\operatorname{gcd}(m, n) = 6$ is . . . . . . .

  • A
    $61$
  • B
    $62$
  • C
    $63$
  • D
    $64$

Explore More

Similar Questions

What is the total number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these are the four cards of the same suit?

$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:

All the letters of the word $TABLE$ are permuted and the strings of letters (may or may not have meaning) thus formed are arranged in dictionary order. Then the rank of the word $TABLE$ counted from the rank of the word $BLATE$ is

Group $A$ consists of $7$ boys and $3$ girls,while group $B$ consists of $6$ boys and $5$ girls. The number of ways,$4$ boys and $4$ girls can be invited for a picnic if $5$ of them must be from group $A$ and the remaining $3$ from group $B$,is equal to:

$A$ box contains $5$ blue, $6$ yellow, and $4$ red balls. The number of ways of drawing $8$ balls containing at least two balls of each color 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