## What is the remainder when positive integer n is divided by 4?

##### This topic has expert replies
Moderator
Posts: 1977
Joined: 15 Oct 2017
Followed by:6 members

### What is the remainder when positive integer n is divided by 4?

by BTGmoderatorLU » Wed Jun 02, 2021 9:50 am

00:00

A

B

C

D

E

## Global Stats

Source: Magoosh

What is the remainder when positive integer n is divided by 4?

1) When n is divided by 8, the remainder is 1
2) When n is divided by 2, the remainder is 1

The OA is A

### GMAT/MBA Expert

GMAT Instructor
Posts: 15734
Joined: 08 Dec 2008
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1266 members
GMAT Score:770

### Re: What is the remainder when positive integer n is divided by 4?

by [email protected] » Thu Jun 03, 2021 5:09 am

00:00

A

B

C

D

E

## Global Stats

BTGmoderatorLU wrote:
Wed Jun 02, 2021 9:50 am
Source: Magoosh

What is the remainder when positive integer n is divided by 4?

1) When n is divided by 8, the remainder is 1
2) When n is divided by 2, the remainder is 1

The OA is A
Target question: What is the remainder when positive integer n is divided by 4?

Statement 1: When n is divided by 8, the remainder is 1.

APPROACH #1
There's a nice rule that say, "If N divided by D equals Q with remainder R, then N = DQ + R"
For example, since 17 divided by 5 equals 3 with remainder 2, then we can write 17 = (5)(3) + 2

Statement 1 essentially says, When n is divided by 8, we get some integer (say k) and the remainder is 1.
So, we can use our nice rule to write: n = 8k + 1 (where k is an integer)
At this point, we can take n = 8k + 1 and rewrite it as n = (4)(2)k + 1
We can rewrite THIS as n = (4)(some integer) + 1
This means that n is 1 greater than some multiple of 4.
In other words, if we divide n by 4, we'll get remainder 1
Since we can answer the target question with certainty, statement 1 is SUFFICIENT

APPROACH #2
Let's test a few possible values of n.
When it comes to remainders, we have another nice rule that says:
If N divided by D, leaves remainder R, then the possible values of N are R, R+D, R+2D, R+3D,. . . etc.
For example, if k divided by 5 leaves a remainder of 1, then the possible values of k are: 1, 1+5, 1+(2)(5), 1+(3)(5), 1+(4)(5), . . . etc.

So, if n divided by 8 leaves remainder 1, then some possible values of n are: 1, 9, 17, 25, 33 etc.

Let's test a few of these possible values to see what happens when we divide them by 4
n = 1: n divided by 4 leaves remainder 1
n = 9: n divided by 4 leaves remainder 1
n = 17: n divided by 4 leaves remainder 1
n = 25: n divided by 4 leaves remainder 1
n = 33: n divided by 4 leaves remainder 1
It certainly seems that statement 1 guarantees that the remainder will be 1
Since we can answer the target question with certainty, statement 1 is SUFFICIENT

Statement 2: When n is divided by 2, the remainder is 1.
In other words, statement 2 tells us that n is ODD
Let's test some possible values of n
Case a: n = 3, in which case n divided by 4 leaves remainder 3
Case b: n = 5, in which case n divided by 4 leaves remainder 1
Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT