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

The number $(49^{2}-4)(49^{3}-49)$ is divisible by (in $!$)

The value of ${2^n} \{ 1 \cdot 3 \cdot 5 \cdots (2n - 3) \cdot (2n - 1) \}$ is

Difficult
View Solution

There are three sections in a question paper,each section containing $4$ questions. If a candidate has to answer exactly $5$ questions from this paper such that at least one question is answered from each section,then the number of ways in which a candidate can make the choice of questions is

If $4$-digit numbers greater than $5,000$ are randomly formed from the digits $0, 1, 3, 5,$ and $7$,what is the probability of forming a number divisible by $5$ when the repetition of digits is not allowed?

Difficult
View Solution

The total number of two-digit numbers $n$ such that $3^{n} + 7^{n}$ is a multiple of $10$ 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