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

It is currently 24 Mar 2019, 12:39

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

What is the remainder when integer n is divided by two?

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

Hide Tags

 
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 53800
What is the remainder when integer n is divided by two?  [#permalink]

Show Tags

New post 10 Jan 2017, 03:53
00:00
A
B
C
D
E

Difficulty:

  65% (hard)

Question Stats:

64% (02:02) correct 36% (02:00) wrong based on 83 sessions

HideShow timer Statistics

What is the remainder when integer n is divided by two?

(1) When n is divided by 3, the remainder is odd.
(2) When n is divided by 5, the remainder is odd.

_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

Senior Manager
Senior Manager
avatar
G
Joined: 21 Aug 2016
Posts: 261
Location: India
GPA: 3.9
WE: Information Technology (Computer Software)
GMAT ToolKit User Reviews Badge
Re: What is the remainder when integer n is divided by two?  [#permalink]

Show Tags

New post 10 Jan 2017, 09:58
statement 1: number n= 3x+1

n can be 7 or 4 so insufficient

Statement 2: number is either 5x+1 or 5x+3

n can be 21 or 6 so insufficient

Combining both : n can be 16 or 13 so insufficient


Correct ans is E

+1 Kudos if you like the post :)
Director
Director
User avatar
D
Joined: 05 Mar 2015
Posts: 999
Re: What is the remainder when integer n is divided by two?  [#permalink]

Show Tags

New post 10 Jan 2017, 10:48
Bunuel wrote:
What is the remainder when integer n is divided by two?

(1) When n is divided by 3, the remainder is odd.
(2) When n is divided by 5, the remainder is odd.



(1) n=3x+1
two cases
1st is when x is odd then 3x+1 =odd+odd=even
remainder=0
2nd is when x is even then 3x+1= even+odd = odd
remainder =1
Not suff...

(2) n=5x+1
two cases
1st is when x is odd then 5x+1 =odd+odd=even
remainder=0
2nd is when x is even then 5x+1= even+odd = odd
remainder =1
Not suff...

combining both n is multiple of both 3 &5 thus
n=15x+1

two cases
1st is when x is odd then 15x+1 =odd+odd=even
remainder=0
2nd is when x is even then 15x+1= even+odd = odd
remainder =1
Not suff...

Ans E
Manager
Manager
avatar
B
Joined: 03 Sep 2018
Posts: 58
What is the remainder when integer n is divided by two?  [#permalink]

Show Tags

New post 15 Jan 2019, 02:55
Stem: \(n\) \(mod\) \(2\)


I) \(n=3k+(2p+1)\) \(\implies\) \(Remainder_n=0+1\) OR \(Remainder_n=1+1\) \(\implies\) \(NS\)

II) \(n=5L+(2m+1)\) \(\implies\) \(Remainder_n=0+1\) OR \(Remainder_n=1+1\) \(\implies\) \(NS\)

I&II) \(n=15x+5=5(3x+1)\) Which is essentially the same issue as under I & II:
\(Remainder_n=1*1\) OR \(Remainder_n=1*0\) \(\implies\) \(NS\)
_________________

Please consider giving Kudos if my post contained a helpful reply or question.

GMAT Club Bot
What is the remainder when integer n is divided by two?   [#permalink] 15 Jan 2019, 02:55
Display posts from previous: Sort by

What is the remainder when integer n is divided by two?

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