Why is the Remainder is always less than the Divisor?

When you divide an integer by 6, the remainder could not be which of the following? Select all that apply 0 1 2 3 4 5 6 7 8 9…

When you divide an integer by 6, the remainder could not be which of the following?

Select all that apply

  • 0
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10

 

When you divide an integer by 6, the remainder could be 0, 1, 2, 3, 4, or 5.

We already know that the remainder cannot be negative.

Moreover, you cannot have a remainder larger than or equal to 6 (d).

 

Since you admire analogies, let’s use one to clear this concept.

Let’s revisit a slightly altered version of the oranges problem you so liked in the previous micro-lesson.

Consider the problem “You have 39 oranges, there are 5 people, and each person should get the same number of oranges. What is the minimum number of remaining oranges?”. In mathematical terms, n is 39, and d is 5.

The answer is obviously 4, the remainder of 39 divided by 5. The quotient is 7, meaning each person got 7 oranges and there were 5 people, so a total of 35 oranges got divided amongst these 5 people.


But why is the remainder less than 5? Why can’t it be more?

Well, imagine if 5 or more oranges remain, you can still go ahead and distribute one more orange to each person. So it means 5 or any larger number cannot be the answer. Therefore, the remainder should be less than 5.

 

Important trick

In remainder problems, the question might trick you with a negative value of d. For example, what is the remainder when you divide an integer by -6?

The answer is the same as that for the positive value of d.

When you divide an integer by -6, the remainder could be 0, 1, 2, 3, 4, or 5.

In other words, the 0 ? Remainder < |-6| ? 0 ? Remainder < 6

Remember |-6| gives us the absolute value or the magnitude of -6, which is 6.

 

An alternative approach

Let’s say you want to find the remainder of 17 divided by ?6.

To find the remainder, we can also use the 3-step process.

  • Step 1: List all the multiples of d (?6) that are less than the n (17). Those are ?6, 0, 6, and 12.
  • Step 2: Select the multiple that is nearest to n. In this case that is 12.
  • Step 3: Find the distance from the n (17) to the multiple you selected in step 2 (12).

17 – 12 = 5. This is your remainder.

We can see that the remainder (5) is less than 6 (the absolute value of ?6, the divisor).

 

So, if you have a negative value of d, you can generalize this as:

0 ? Remainder < |d|

 

What is the minimum possible remainder when an integer is divided by 11?

Since, 0 ? Remainder < d, the minimum possible value of the remainder is 0. In other words, n is completely divided by d.

For example, 11 ÷ 11, 22 ÷ 11 etc…

 

What is the minimum possible remainder when an integer is divided by ?11?

Recall that if you have a negative value of d, 0 ? Remainder < |d|,

Again, the minimum possible value of the remainder is 0. In other words, n is completely divided by d.

For example, 11 ÷ ?11, 22 ÷ ?11 etc…

 

And what is the maximum possible remainder when an integer is divided by 11?

Since, 0 ? Remainder < d, the value of the remainder should lie somewhere within that range.

In this question, the d is 11, so the range of remainder values is

0 ? Remainder < 11

This means that the remainder can be any value starting from 0 and going up to less than 11.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

As the question is asking about the maximum possible value, the answer would be 10.

 

And what is the maximum possible remainder when an integer is divided by ?11?

For a negative d, 0 ? Remainder < |d|, the value of the remainder should lie somewhere within that range.

In this question, d is ?11, so the range of remainder values is

0 ? Remainder < |?11| ? 0 ? Remainder < 11

This means that the remainder can be any value starting from 0 and going up to less than 11.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

As the question is asking about the maximum possible value, the answer would be 10.

 

You can also generalize this as:

If d is positive, the maximum possible value of the remainder is 1 less than d.

If d is negative, the maximum possible value of the remainder is 1 less than |d|.

 

To summarise:

  • If d is +ve

0 ? Remainder < d

The maximum possible value of the remainder = d – 1

  • If d is -ve

0 ? Remainder < |d|

The maximum possible value of the remainder = |d| – 1

SEE ALSO

GRE Math: Fundamentals of a Triangle

Like most people who take the GRE, your Math knowledge might be a little rusty. The good news is that GRE only tests you on math that you have already learned in high school. If you are worried that you have forgotten most of what you learned in high school, you will...

read more

How do you Calculate Standard Deviation on the GRE?

Standard deviation is an important statistical term tested on the GRE. It gives you an insight into the deviation or dispersion of a set of numbers from its mean; therefore, a low standard deviation implies that the numbers are very close to the mean, and vice versa....

read more

What are Prime Factors?

Every integer greater than 1 either is a prime number or a composite number. All composite numbers can be expressed as a product of prime numbers. For example, 6 can be expressed as 2 × 3. The prime factors of 6 are 2 and 3. Whereas the expression 2 × 3 is called...

read more

How to calculate Factors of Perfect Squares

Let's see how we use the chart to deal with this question: How many positive factors does 100 have? Set up the chart: 100 Left Column Right Column 1 100 2 50 4 25 5 20 10 10   Remember the rule - once the factors repeat themselves, (i.e. 10 and 10), stop. Since...

read more

What are Factor Tables?

Some integer questions may require you to find the Factors of an integer. The factor table is a basic technique for finding all the factors of any integer. This technique can also be useful for questions asking how many factors a particular integer has. The technique...

read more

Basics of Prime Numbers

Primes play a central part in integer questions. Overconfidence is dangerous here: while almost everybody can recite the definition of a prime number at the drop of a hat, the field is actually rife with misconceptions. We are here to make sure you know everything...

read more

Rules of Operations for Odd and Even Numbers

Let's formulate rules for addition, subtraction, multiplication, and division of Even and Odd numbers. Here are the rules for adding / subtracting even and odd numbers: Even ± Even = Even (e.g. 2 + 2 = 4; -4 - 2 = -6) Odd ± Odd = Even (e.g. 1 + 1 = 2; -31 - 1 = -32)...

read more

Basics of Even & Odd numbers

We'll begin with the basic definitions: Even: any integer that is divisible by 2. Examples: 2, 4, 14. Odd: any integer that is not divisible by 2, i.e. leaves a remainder of 1 when divided by 2. Examples: 1, 3, 5, 7, 9 So far so good. Consider this potential...

read more

Shortcuts to find Remainders

Find the remainder when 5,142,376,298 is divided by 9?     The long division method will definitely tell you the remainder of dividing 5,142,376,298 by 9 but you can very well imagine how long would that take. The good news is that just like the divisibility...

read more