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

It is currently 24 Apr 2019, 01:34

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

We define “A mod n” as the remainder when A is divided by n. What is t

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

Hide Tags

 
Math Revolution GMAT Instructor
User avatar
V
Joined: 16 Aug 2015
Posts: 7244
GMAT 1: 760 Q51 V42
GPA: 3.82
We define “A mod n” as the remainder when A is divided by n. What is t  [#permalink]

Show Tags

New post 23 Aug 2017, 01:20
00:00
A
B
C
D
E

Difficulty:

  75% (hard)

Question Stats:

50% (02:48) correct 50% (02:33) wrong based on 68 sessions

HideShow timer Statistics

We define “A mod n” as the remainder when A is divided by n. What is the value of “A mod 6”?

1) A mod 4 = A mod 12
2) A mod 3 = 2

_________________
MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
"Only $149 for 3 month Online Course"
"Free Resources-30 day online access & Diagnostic Test"
"Unlimited Access to over 120 free video lessons - try it yourself"
Current Student
User avatar
P
Joined: 18 Aug 2016
Posts: 619
Concentration: Strategy, Technology
GMAT 1: 630 Q47 V29
GMAT 2: 740 Q51 V38
GMAT ToolKit User Reviews Badge
Re: We define “A mod n” as the remainder when A is divided by n. What is t  [#permalink]

Show Tags

New post 23 Aug 2017, 02:59
MathRevolution wrote:
We define “A mod n” as the remainder when A is divided by n. What is the value of “A mod 6”?

1) A mod 4 = A mod 12
2) A mod 3 = 2


(1) tells us it can take values 12, 13, 14, 15, 24,25,26,27,36,37,38,39......not sufficient

(2) tells us it can take values 2,5,8,11,14,17,20,23,26,29,32,35,38,41.....not sufficient

on combining we get values 14, 26, 38....in all cases A mod 6 will be 2

Hence Sufficient
C
_________________
We must try to achieve the best within us


Thanks
Luckisnoexcuse
Math Revolution GMAT Instructor
User avatar
V
Joined: 16 Aug 2015
Posts: 7244
GMAT 1: 760 Q51 V42
GPA: 3.82
Re: We define “A mod n” as the remainder when A is divided by n. What is t  [#permalink]

Show Tags

New post 25 Aug 2017, 01:10
=> Condition 1)
A = 0, 1, 2, 3.
This is not sufficient.

Condition 2)
A = 2, 5.
This is not sufficient.

Condition 1) & 2)
From the condition 2), we have four cases as follows.
A = 12k + 2
A = 12k + 5
A = 12k + 8
A = 12k + 11
From the condition 1), A should be the case that A = 12k + 2 = 6*(2k) + 2.
Thus both conditions together are sufficient.

Ans: C
_________________
MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
"Only $149 for 3 month Online Course"
"Free Resources-30 day online access & Diagnostic Test"
"Unlimited Access to over 120 free video lessons - try it yourself"
Math Expert
User avatar
V
Joined: 02 Aug 2009
Posts: 7580
We define “A mod n” as the remainder when A is divided by n. What is t  [#permalink]

Show Tags

New post 25 Aug 2017, 01:29
MathRevolution wrote:
We define “A mod n” as the remainder when A is divided by n. What is the value of “A mod 6”?

1) A mod 4 = A mod 12
2) A mod 3 = 2



Hi..

lets see what the Q means ..

we are looking for remainder when A is divided by 6.... remainder has to from 0 to 5

lets see the statements...

1) A mod 4 = A mod 12
the remainder when A is divide by 12, which is 6*2, will be EQUAL or MORE than the remainder when A is divided by 6...
also the remainder when A is divide by 4 will be EQUAL or LESS than the remainder when A is divided by 6...
here but the remainders when div by 12 and when div by 4 are SAME SO when div by 6 will also be same or it will be from 0 to 3

insufficient

2) A mod 3 = 2
when A is divided by 3, remainder is 2... so when div by 6, it will be 2 or 2+3
two values possible

insufficient

combined..
statement I tells us that it is from 0 to 3 and statement II tells it is 2 or 5.
ONLY 2 is common
ans 2
C
_________________
GMAT Club Bot
We define “A mod n” as the remainder when A is divided by n. What is t   [#permalink] 25 Aug 2017, 01:29
Display posts from previous: Sort by

We define “A mod n” as the remainder when A is divided by n. What is t

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


Copyright

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®.