Number System - Questions & Discussions

find the remainder when 10! + 111 is divided by 143?



find the remainder when 84^79 is divided by 100?

find the remainder when 59^8760 is divided by 37?

find the remainder when 20! is divided by 23?

find the remainder when 135713571357.......upto 1000 digits is divided by 101?

Plz tell me all about mod. with examples and in all cases possible..!!!

How do we use it in remainders etc..??

Let 123abc231bca312cab be a 18 digit number in base 7. How many ordered pairs (a,b,c) exist such that the given 18 digit number is divisible by 4? (a) 62 (b) 74 (c) 86 (d) none of these

@sakethraj

if a year ends with sunday then 13 march in that year will be on which day?



0 answers 1) monday



0 answers 2) friday



0 answers 3) thursday



0 answers 4) cannot be detrmnd



€‹D) Leap year or not not mentioned


Find the remainder when 13^73 + 14^3 is divided by 11?

COMPLETE SOLUTION is highly appreciated
  • 3)3
  • 4)4
  • 1)1
  • 2)2

0 voters

Number of 3 digit numbers that can be expressed as sum of 4 consecutive, 5 consecutive and 7 consecutive positive numbers?

  • 10
  • 12
  • 6
  • 8

0 voters

Three numbers 97,152 &252 when divided by the same divisor leaves remainders 1,8 &12 respectively.How many divisors satisfy this condition.Need explanation too..

  • 8
  • 2
  • 9
  • 10

0 voters

Sum of two numbers & their LCM is 41.How many pairs of numbers satisfy this condition??

  • 1
  • 3
  • 2
  • 0

0 voters



How many factors of 464 are divisible by 4?

find the number of zeroes in the product of 1^1 * 2^2 *3^3 ............... 100 ^100

  • 1050
  • 1400
  • 1200
  • 1300
  • none of these

0 voters

x,y,z are integers. What is the remainder when xyz(x^3-y^3)(y^3-z^3)(z^3-x^3) is divided by 7.


lets take year=2007 . If we add digits then we get 2+0+0+7=9 which is a perfect square.

now question is how many years between 2000 - 2199 have this property?
  • i dont remember options
  • so plz skip and post the solution

0 voters

HELP, can we use Euler theorem for finding remainders every time?

Iam not aware of the theorem though 😛 whats the best method in ur opinion?