Home
Class 12
MATHS
The number of ordered pairs (m, n), m, n...

The number of ordered pairs (m, n), m, n `in` {1, 2, …, 100} such that `7^(m)+7^(n)` is divisible by 5 is

A

1250

B

2000

C

2500

D

5000

Text Solution

Verified by Experts

The correct Answer is:
C
Promotional Banner

Topper's Solved these Questions

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise SOLVED EXAMPLES (LEVEL 2) Single Correct Answer Type Questions |14 Videos

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise SOLVED EXAMPLES (LEVEL 2) Numerical Answer Type Questions |19 Videos

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise Questions from Previous Years. B-Architecture Entrance Examination Papers |17 Videos

  • PARABOLA

    MCGROW HILL PUBLICATION|Exercise QUESTIONS FROM PREVIOUS YEARS. B-ARCHITECTRE ENTRANCE EXAMINATION PAPERS|9 Videos

  • PROBABILITY

    MCGROW HILL PUBLICATION|Exercise Previous Years B-Architecture Entrance Examination Papers|21 Videos

Similar Questions

Explore conceptually related problems

Find the number of ordered pairs (m,n)epsilon {1,2,…..20} such that 3^(m)+7^(n) is divisible by 10.

The number of ordered pairs (m,n), where m, n in {1,2,3, …..,50}, such that 6^(m)+9^(n) is a multiple of 5 is -

The number of ordered pairs (m,n) where m , n in {1,2,3,…,50} , such that 6^(m)+9^(n) is a multiple of 5 is

The number of ordered pairs (m,n) (m,n epsilon {1,2,……..20}) such that 3^(m)+7^(n) is a multiple of 10, is

The number of ordered pairs (m,n,p) such that 2^(m)+2^(n)+2^(p) is divisible by 3, where 1<=m<=100,1<=n<=50,1<=p<=25 is/are (where m,n,p varepsilon l)

The number of all pairs (m, n), where m and n are positive integers, such that 1/(m)+1/(n)+1/(mn)=2/(5) is

If two distinct numbers m and n are chosen at random form the set {1, 2, 3, …, 100}, then find the probability that 2^(m) + 2^(n) + 1 is divisible by 3.

MCGROW HILL PUBLICATION-PERMUTATIONS AND COMBINATIONS -SOLVED EXAMPLES (LEVEL 1) Single Correct Answer Type Questions
  1. Sum of the factors of 9! Which are odd and are of the form 3m+2, where...

    Text Solution

    |

  2. Sum of all three digit numbers (no digit being zero) having the proper...

    Text Solution

    |

  3. The number of ordered pairs (m, n), m, n in {1, 2, …, 100} such that 7...

    Text Solution

    |

  4. An n-digit number is a positive number with exactly n digits. Nine hun...

    Text Solution

    |

  5. The number of ways of arranging p numbers out of 1, 2, 3, …, q so that...

    Text Solution

    |

  6. The number of ways of selecting 4 cards of an ordinary pack of playing...

    Text Solution

    |

  7. The number of integers, x, y, z, w such that x+y+z+w=20 and x,y,z,w ge...

    Text Solution

    |

  8. If 20% of three subsets (i.e., subsets containing exactly three elemen...

    Text Solution

    |

  9. There are three piles of identical yellow, black and green balls and e...

    Text Solution

    |

  10. The total number of permutations of n(gt 1) different things taken not...

    Text Solution

    |

  11. The exponent of 7 in the prime factorization of ""^(100)C(50) is

    Text Solution

    |

  12. In a certain test there are n questions. In this test 2^(k) students g...

    Text Solution

    |

  13. The number of ways of permuting letters of the word ENDEANOEL so that ...

    Text Solution

    |

  14. Sum of the series sum(r=1)^(n)(r^(2)+1)(r!) is

    Text Solution

    |

  15. If letters of the word SACHIN are arranged in all possible ways and ar...

    Text Solution

    |

  16. The set S={1,2,3,…12} is to be partitioned into three sets A, B, C of ...

    Text Solution

    |

  17. Ten letters of an alphabet are given. Words with five letters are form...

    Text Solution

    |

  18. The number of ways in which six '+' and four '-' sings can be arranged...

    Text Solution

    |

  19. The remainder when x=1!+2!+3!+4!+…+100! is divided by 240, is

    Text Solution

    |

  20. If x in N and ""^(x-1)C(4)-""^(x-1)C(3)lt(5)/(4)(""^(x-2)P(2)), then x...

    Text Solution

    |