GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 22 Jun 2018, 02:15

Close

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

We define “A mod n” as the remainder when a positive integer A is divi

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Senior SC Moderator
User avatar
V
Joined: 14 Nov 2016
Posts: 1310
Location: Malaysia
GMAT ToolKit User Premium Member CAT Tests
We define “A mod n” as the remainder when a positive integer A is divi [#permalink]

Show Tags

New post 26 Mar 2017, 16:29
1
00:00
A
B
C
D
E

Difficulty:

  55% (hard)

Question Stats:

59% (00:57) correct 41% (01:22) wrong based on 46 sessions

HideShow timer Statistics

We define “A mod n” as the remainder when a positive integer A is divided by n. What is the value of “\(A^2\) mod 4”?

1) A mod 2=1

2) A mod 8=1

_________________

"Be challenged at EVERY MOMENT."

“Strength doesn’t come from what you can do. It comes from overcoming the things you once thought you couldn’t.”

"Each stage of the journey is crucial to attaining new heights of knowledge."

Rules for posting in verbal forum | Please DO NOT post short answer in your post!

Senior Manager
Senior Manager
User avatar
G
Joined: 19 Apr 2016
Posts: 275
Location: India
GMAT 1: 570 Q48 V22
GMAT 2: 640 Q49 V28
GPA: 3.5
WE: Web Development (Computer Software)
Re: We define “A mod n” as the remainder when a positive integer A is divi [#permalink]

Show Tags

New post 26 Mar 2017, 22:29
ziyuen wrote:
We define “A mod n” as the remainder when a positive integer A is divided by n. What is the value of “\(A^2\) mod 4”?

1) A mod 2=1

2) A mod 8=1


St I
A mod 2 =1
Therefore possible values of A are 3 5 7 9 11 13.....

\(A^2\) will be 9 25 49 121 169....

Therefore \(A^2\) mod 4 will always be 1 --------------Sufficient

St II
A mod 8 = 1
Therefore possible values of A are 9 17 25.....

\(A^2\) will be 81 289 625....

Therefore \(A^2\) mod 4 will always be 1 --------------Sufficient

Hence option D is correct
Hit Kudos if you liked it 8-)
Expert Post
Top Contributor
1 KUDOS received
CEO
CEO
User avatar
P
Joined: 12 Sep 2015
Posts: 2568
Location: Canada
Re: We define “A mod n” as the remainder when a positive integer A is divi [#permalink]

Show Tags

New post 27 Mar 2017, 08:08
1
Top Contributor
ziyuen wrote:
We define “A mod n” as the remainder when a positive integer A is divided by n. What is the value of “\(A^2\) mod 4”?

1) A mod 2=1

2) A mod 8=1


Target question: What is the value of A² mod 4?
In other words, what is the remainder when A² is divided by 4?

Statement 1: A mod 2=1
In other words, When A is divided by 2, the remainder is 1
ASIDE: 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
Likewise, since 53 divided by 10 equals 5 with remainder 3, then we can write 53 = (10)(5) + 3

So, in this case, we can write: A = 2k + 1 (where k is some integer)
If A = 2k + 1, then A² = (2k + 1)² = 4k² + 4k + 1 = 4(k² + k) + 1
In other words, A² = 4(some integer) + 1
Since A² is 1 GREATER THAN some multiple of 4, we can conclude that the remainder is 1 when A² is divided by 4
Since we can answer the target question with certainty, statement 1 is SUFFICIENT

Statement 2: A mod 8=1
In other words, When A is divided by 8, the remainder is 1
So, in this case, we can write: A = 8k + 1 (where k is some integer)
If A = 8k + 1, then A² = (8k + 1)² = 64k² + 16k + 1 = 4(16k² + 4k) + 1
In other words, A² = 4(some integer) + 1
Since A² is 1 GREATER THAN some multiple of 4, we can conclude that the remainder is 1 when A² is divided by 4
Since we can answer the target question with certainty, statement 2 is SUFFICIENT

Answer:

RELATED VIDEO

_________________

Brent Hanneson – Founder of gmatprepnow.com

Image

Re: We define “A mod n” as the remainder when a positive integer A is divi   [#permalink] 27 Mar 2017, 08:08
Display posts from previous: Sort by

We define “A mod n” as the remainder when a positive integer A is divi

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions and Privacy Policy| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.