If a number P leaves a remainder 4 when divided by 44, then what is the remainder when P is divided by 4?
If a number X leaves a remainder 3 when divided by 9005, then what is the remainder when X is divided by 5?
If X is a positive integer, and X/90 = 19.1, then what is the remainder when X is divided by 18?
Jake buys 4 items each from a grocery store on all weekdays (Monday to Friday) but doesn’t buy anything on a weekend. If he starts buying on Monday and buys a total of 1008 items by some day, then what day is that?
On a Christmas day, Santa Claus has a collection of toffees in his bag. If he distributes 5 toffees to every child in group A, then he will be left with 2 toffees. And, if he distributes 4 toffees each to every child in group B, then he is left with 2 toffees. If the number of toffees is less than 40, then what is the total number of toffees with him?
When a positive integer S is divided by a positive integer T, a remainder of 12 is obtained. If S/T = 21.4, what is the value of T?
Step 1: Question statement and Inferences
We have to find the value of T
Step 2: Finding required values
Given: positive integer S is divided by a positive integer T, a remainder of 12 is obtained.
Step 3: Calculating the final answer
Answer: Option (C)
If m is a positive integer, and m/15 = 8.2, what is the remainder when m is divided by 15?
What is the remainder when the positive integer x is divided by 9?
(1) x + 34 is a multiple of 18
(2) x is a multiple of 11
If n is an odd positive integer, what is the remainder when n(2n2)(n+1)^{2} is divided by 32?
Let E = n (2n2) (n+1)^{2 }= 2n(n1)(n+1)^{2}
Given: n is odd
Now n may be expressed as:
n = 2k + 1, where k is an integer
Now we need to find the remainder when the expression is divided by 16 × 2 = 32.
E = 16k(2k+1)(k+1)^{2 }
We should consider two possibilities with regards to k being odd or even.
1) k is even
Let k = 2m , where m is an integer
Therefore E is divisible by 32.
2) k is odd
Let k = 2m + 1, where m is an integer
Thus, irrespective of whether k is even or odd, the given expression E will be divisible by 32.
Solution: When n(2n2)(n+1)^{2} is divided by 32, the remainder is zero.
Answer: Option (A)
What is the remainder obtained when 63^{26} is divided by 16?
As per the Binomial Theorem, an expression of the form (ab)^{n} opens up as follows:
The interesting thing to note here is that the sum of powers of a and b in each term of this expression will be equal to n. For example, if in a term, a is raised to the power n1, then b will be raised to the power 1 in that term, because (n1) +1 = n
Similarly, if b is raised to the power n in a term, then a will be raised to the power zero in that term.
Please don’t feel intimidated by the Binomial Theorem. Do you need to know it to crack the GMAT? The answer is No, Not really. We have discussed this expression here just to help you better visualize what’s going on here.
The point that we really want to drive home is that when the expression (ab)^{n} is opened up, every term except the last term has a in it. In fact you can try it out with n = 2 or n = 3 and see it for yourself.
This means, an expression of the form (ab)^{n} can be simplified as ka + (b)^{n} , where k is a complicated expression that is outside the scope of the GMAT.
Some students are able to figure out the above simplification intuitively, without any knowledge of the Binomial Theorem, and that is absolutely fine.
Solving the given question using Binomial Theorem
To find the remainder, we should be able to write 63^{26 }in the form:
63^{26 }= 16q + r
where q and r are positive integers and r < 16
The trick in solving such questions is to write the base of the given number in terms of the divisor.
The base of 63^{26} is 63.
So, we have to write 63 in terms of the divisor 16.
The simplest way to do so is:
63 = 16 × 4  1
This means, 63^{26} can be written as follows:
63^{26} = [(16 × 4) – 1]^{26}
We have expressed 63^{26} as [(16 × 4) – 1]^{26}. This expression is analogous to the expression (ab)^{n} we have discussed above in the explanation of Binomial Theorem.
So, we can observe that when the expression [(16 × 4) – 1]^{26} is opened up using the Binomial Theorem, every term will have (16 × 4) except the last term
This means, all terms except the last term will be divisible by 16
And, what will the last term be?
It will be (1)^{26 }= 1
So, 63^{26 } = 16E + 1, where 16E represents all terms of [(16 × 4) – 1]^{26} except the last term
Compare with: 63^{26 }= 16q + r, where r < 16
Thus, we see that Remainder r = 1
Answer: Option (C)
If p and q are positive integers, what is the remainder when 9^{2p} × 5^{p+q} + 11^{q} × 6^{pq} is divided by 10?
What is the remainder obtained when 63^{25} is divided by 16?
As per the Binomial Theorem, an expression of the form (ab)^{n} opens up as follows:
The interesting thing to note here is that the sum of powers of a and b in each term of this expression will be equal to n. For example, if in a term, a is raised to the power n1, then b will be raised to the power 1 in that term, because (n1) +1 = n
Similarly, if b is raised to the power n in a term, then a will be raised to the power zero in that term.
Please don’t feel intimidated by the Binomial Theorem. Do you need to know it to crack the GMAT? The answer is No, Not really. We have discussed this expression here just to help you better visualize what’s going on here.
The point that we really want to drive home is that when the expression (ab)^{n} is opened up, every term except the last term has a in it. In fact you can try it out with n = 2 or n = 3 and see it for yourself.
This means, an expression of the form (ab)^{n} can be simplified as ka + (b)^{n} , where k is a complicated expression that is outside the scope of the GMAT.
Some students are able to figure out the above simplification intuitively, without any knowledge of the Binomial Theorem, and that is absolutely fine.
Solving the given question using Binomial Theorem
To find the remainder, we should be able to write 63^{25 }in the form:
The trick in solving such questions is to write the base of the given number in terms of the divisor.
The base of 63^{25} is 63.
So, we have to write 63 in terms of the divisor 16.
The simplest way to do so is:
This means, 63^{25} can be written as follows:
We have expressed 63^{25} as
This expression is analogous to the expression (ab)^{n} we have discussed above in the explanation of Binomial Theorem.
So, we can observe that when the expression [(16 × 4) – 1]^{25} is opened up using the Binomial Theorem, every term will have (16 × 4) except the last term
This means, all terms except the last term will be divisible by 16
And, what will the last term be?
So,
Now the remainder for 63^{25}÷16 cannot be equal to – 1 since remainders cannot be negative.
This expression 63^{25 }= 16E  1 is exactly parallel to n = 16k  m.
So, here, we will apply The Remainder Finding Process B.
We will write m = adb where a and b are positive integers and b< d. The remainder for n ÷ d is equal to b.
Comparing 63^{25 }= 16E  1 and n = 16k  m, we get m = 1
So, we need to write 1 in the form 16a – b, where b < 16
We can write
So,
Thus, we can conclude that when 63 raised to the power 25 is divided by 16, the remainder is equal to 15.
Answer: Option (E)
The factorial operation ! applied to a positive integer n denotes the product of all integers greater than or equal to 1 and less than or equal to n. If k = 1! + 2! + 3! + . . . + p! , where p is a prime number greater than 10, what is the remainder when k is divided by 4?
Given: k = 1! + 2! + 3! + . . . + p!
Applying the definition of factorial operation:
n! = 1 × 2 × 3 × 4 × 5 × 6 × 7. . . × (n2) × (n1) × n
where n is a positive integer
This implies that:
From 4! onwards, all terms are divisible by 4.
So, to find the remainder when k is divided by 4, we need to consider only terms till 3!
The remainder when 9 is divided by 4 is 1. So when k is divided by 4, the remainder is 1.
Answer: Option (B)
What is the remainder when the positive integer n is divided by 2?
(1) When n is divided by 13, the remainder is 3
(2) n + 2 is a multiple of 7
Steps 1 & 2: Understand Question and Draw Inferences
We need to find the remainder when the positive integer n is divided by 2
i.e., we need to find if n is even or odd.
If n is even, then the remainder is 0
If n is odd, then the remainder is 1.
Step 3: Analyze Statement 1
When n is divided by 13, the remainder is 3
This is not sufficient. n is odd when k is even and even when k is odd.
Step 4: Analyze Statement 2
n + 2 is a multiple of 7
This statement is not sufficient. n is even when t1 is odd and n is odd when t1 is even
Step 5: Analyze Both Statements Together (if needed)
Inference from statement 1: n = 13k + 3
Inference from statement 2: n = 7t 2 = 7(t1) + 5
Inference from statement 1 and statement 2: 13k + 3 = 7(t1) + 5
We know:
Odd – Odd = Even
Even – Even = Even
So k and t1 can be both even or both odd
Hence, we cannot find if k and t is even or odd, and therefore we cannot find if n is even or odd.
Statement 1 and Statement 2 together are not sufficient to answer the question.
Answer: Option (E)
If t is a positive integer, can (t+2)(t3) be evenly divided by 6?
(1) 5(t^{3} +1) is not divisible by 2.
(2) t is a 3digit number, whose digits are consecutive integers.
Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 








