Find all School-related info fast with the new School-Specific MBA Forum

It is currently 31 Jul 2014, 20:26

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

If {n} denote the remainder when 3n is divided by 2 then

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Intern
Intern
avatar
Joined: 29 Sep 2009
Posts: 16
Followers: 0

Kudos [?]: 3 [0], given: 3

If {n} denote the remainder when 3n is divided by 2 then [#permalink] New post 29 Sep 2009, 01:44
2
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  45% (medium)

Question Stats:

53% (02:32) correct 47% (02:11) wrong based on 32 sessions
If {n} denote the remainder when 3n is divided by 2 then which of the following is equal to 1 for all positive integers n?

I. {2n+1}
II. {2n}+1
III. 2{n+1}

A. I only
B. II only
C. I and II
D. III only
E. II and III
[Reveal] Spoiler: OA
1 KUDOS received
Senior Manager
Senior Manager
avatar
Joined: 23 Jun 2009
Posts: 360
Location: Turkey
Schools: UPenn, UMich, HKS, UCB, Chicago
Followers: 5

Kudos [?]: 94 [1] , given: 60

GMAT Tests User
Re: Remainder and Divisible [#permalink] New post 29 Sep 2009, 02:42
1
This post received
KUDOS
{n}=3n mod 2.

options
1) {2n+1)=6n+3 mod 2 that is always equal 1.
2) {2n}+1= 6n mod 2 + 1 that is always equal 1.
3) 2{n+1}=2.(3n+3 mod 2) it can be either 0 or 2.

C)
Retired Moderator
User avatar
Status: The last round
Joined: 18 Jun 2009
Posts: 1318
Concentration: Strategy, General Management
GMAT 1: 680 Q48 V34
Followers: 56

Kudos [?]: 457 [0], given: 157

GMAT ToolKit User GMAT Tests User
Re: Remainder and Divisible [#permalink] New post 27 Oct 2009, 16:45
maliyeci wrote:
{n}=3n mod 2.

options
1) {2n+1)=6n+3 mod 2 that is always equal 1.
2) {2n}+1= 6n mod 2 + 1 that is always equal 1.
3) 2{n+1}=2.(3n+3 mod 2) it can be either 0 or 2.

C)


I couldn't get a single point of it. I think this is something modular arithmetic, which I have no idea. Is there any other way of solving the question, but the problem is that I didn't pick the question either. :(
_________________

[ From 470 to 680-My Story ] [ My Last Month Before Test ]
[ GMAT Prep Analysis Tool ] [ US. Business School Dashboard ] [ Int. Business School Dashboard ]

I Can, I Will

Get the best GMAT Prep Resources with GMAT Club Premium Membership

VP
VP
avatar
Joined: 05 Mar 2008
Posts: 1477
Followers: 11

Kudos [?]: 193 [0], given: 31

GMAT Tests User
Re: Remainder and Divisible [#permalink] New post 28 Oct 2009, 08:24
andrewng wrote:
If {n} denote the remainder when 3n is divided by 2 then which of the following is equal to 1 for all positive integers n?

I/ {2n+1}
II/ {2n}+1
III/ 2{n+1}


A/ I only
B/ II only
C/ I and II
D/ III only
E/ II and III

I don't really understand what it asking for in the question. Could somebody help?


Substitute 2 for each answer and solve..as a check do the same with value of 1
{2} remainder = 0
{1} remainder = 1

I. {2(2) + 1} = {5} plug in 5 into 3n/2 and remainder = 1
II. {2(2} + 1 = {4} remainder = 0 and add 1 so answer = 1
III. 2{2+1} = {3} remainder = 1 but then multiply that by 2 and answer is 2

I. {2(1) +1} = {3} remainder = 1
II. {2(1} + 1 = {2} remainder = 0 and add 1 so answer is 1
III. 2{1+1} = {2} remainder = 0 then multiply by two answer is 0

someone double-check my logic...not 100% sure if correct
Senior Manager
Senior Manager
avatar
Joined: 23 Jun 2009
Posts: 360
Location: Turkey
Schools: UPenn, UMich, HKS, UCB, Chicago
Followers: 5

Kudos [?]: 94 [0], given: 60

GMAT Tests User
Re: Remainder and Divisible [#permalink] New post 29 Oct 2009, 11:33
Hussain15 wrote:
maliyeci wrote:
{n}=3n mod 2.

options
1) {2n+1)=6n+3 mod 2 that is always equal 1.
2) {2n}+1= 6n mod 2 + 1 that is always equal 1.
3) 2{n+1}=2.(3n+3 mod 2) it can be either 0 or 2.

C)


I couldn't get a single point of it. I think this is something modular arithmetic, which I have no idea. Is there any other way of solving the question, but the problem is that I didn't pick the question either. :(

Yes. It is about modular arithmetic. I think one must learn this before taking gmat.
1 KUDOS received
Senior Manager
Senior Manager
avatar
Joined: 30 Nov 2008
Posts: 494
Schools: Fuqua
Followers: 10

Kudos [?]: 119 [1] , given: 15

GMAT Tests User
Re: Remainder and Divisible [#permalink] New post 29 Oct 2009, 16:20
1
This post received
KUDOS
This is another way of solving the problem.

It is given that when 3n is divided by 2, the remainder is denoted by {n}. for all positive integers of n. This mean, {n} can be either 0 or 1 depending on whether n is even or odd. Now we need to find which of the following remainders result in 1.

This is like saying if f(n) is the remainder when 3n/2, then what values of the function results in 1.

1. {2n+1} is the remainder obtained when 3(2n+1) is divided by 2. ==> Obviously this results in 1.
2. {2n}+1 can be treated as the remainder obtained when 3(2n) is divided by 2 + adding 1 ==> Obviously this results in 1.
3. 2{n+1} can be obtained when 2 * 3(n+1) is divided by 2. This results in 0.

Hence my take will be C.
Senior Manager
Senior Manager
User avatar
Joined: 22 Dec 2009
Posts: 365
Followers: 10

Kudos [?]: 199 [0], given: 47

GMAT ToolKit User GMAT Tests User
Re: Remainder and Divisible [#permalink] New post 31 Jan 2010, 05:05
maliyeci wrote:
Yes. It is about modular arithmetic. I think one must learn this before taking gmat.


Do you recommend any books which could teach this concept..... I am still not able to understand ur solution :oops: :roll:
_________________

Cheers!
JT...........
If u like my post..... payback in Kudos!! :beer

|Do not post questions with OA|Please underline your SC questions while posting|Try posting the explanation along with your answer choice|
|For CR refer Powerscore CR Bible|For SC refer Manhattan SC Guide|


~~Better Burn Out... Than Fade Away~~

Senior Manager
Senior Manager
User avatar
Joined: 22 Dec 2009
Posts: 365
Followers: 10

Kudos [?]: 199 [0], given: 47

GMAT ToolKit User GMAT Tests User
Re: Remainder and Divisible [#permalink] New post 31 Jan 2010, 05:23
maliyeci wrote:
{n}=3n mod 2.

options
1) {2n+1)=6n+3 mod 2 that is always equal 1.
2) {2n}+1= 6n mod 2 + 1 that is always equal 1.
3) 2{n+1}=2.(3n+3 mod 2) it can be either 0 or 2.

C)


How do you get {2n+1} = 6n+3 mod 2 ...... Am confused! :oops: :roll:
_________________

Cheers!
JT...........
If u like my post..... payback in Kudos!! :beer

|Do not post questions with OA|Please underline your SC questions while posting|Try posting the explanation along with your answer choice|
|For CR refer Powerscore CR Bible|For SC refer Manhattan SC Guide|


~~Better Burn Out... Than Fade Away~~

Expert Post
1 KUDOS received
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 18856
Followers: 3275

Kudos [?]: 22916 [1] , given: 2651

Re: Remainder and Divisible [#permalink] New post 31 Jan 2010, 06:48
1
This post received
KUDOS
Expert's post
jeeteshsingh wrote:
maliyeci wrote:
{n}=3n mod 2.

options
1) {2n+1)=6n+3 mod 2 that is always equal 1.
2) {2n}+1= 6n mod 2 + 1 that is always equal 1.
3) 2{n+1}=2.(3n+3 mod 2) it can be either 0 or 2.

C)


How do you get {2n+1} = 6n+3 mod 2 ...... Am confused! :oops: :roll:


Given {n} = remainder, when 3n is divide by 2.

Which of the following equals to 1:

I. {2n+1} = remainder, when 3(2n+1)=6n+3 is divide by 2. 6n+3 divided by 2 will always give remainder of 1;
II. {2n}+1 = remainder, when 3(2n)=6n is divide by 2 plus 1. Remainder when 6n divided by 2 is 0 plus 1=1;
III. 2{n+1} = 2*(remainder, when 3(n+1)=3n+3 is divide by 2). 3n+3 divided by 2 will give different remainders.

So only I and II equals to 1.
_________________

NEW TO MATH FORUM? PLEASE READ THIS: ALL YOU NEED FOR QUANT!!!

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory; 7. Remainders; 8. Overlapping Sets; 9. PDF of Math Book; 10. Remainders; 11. GMAT Prep Software Analysis NEW!!!; 12. SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) NEW!!!; 12. Tricky questions from previous years. NEW!!!;

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?
25 extra-hard Quant Tests

Get the best GMAT Prep Resources with GMAT Club Premium Membership

Manager
Manager
avatar
Joined: 10 Feb 2010
Posts: 195
Followers: 2

Kudos [?]: 37 [0], given: 6

GMAT Tests User
Re: Remainder and Divisible [#permalink] New post 12 Feb 2010, 17:49
C - I and II

3n/2 = 0 or 1
I just substituted 1 in the equations and solved.
SVP
SVP
User avatar
Joined: 09 Sep 2013
Posts: 1835
Followers: 167

Kudos [?]: 33 [0], given: 0

Premium Member
Re: If {n} denote the remainder when 3n is divided by 2 then [#permalink] New post 23 Jun 2014, 19:56
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

Re: If {n} denote the remainder when 3n is divided by 2 then   [#permalink] 23 Jun 2014, 19:56
    Similar topics Author Replies Last post
Similar
Topics:
10 Experts publish their posts in the topic When n is divided by 5 the remainder is 2. When n is divided yezz 21 18 Aug 2009, 04:39
1 For integer n, f(n) denotes the remainder when n is divided nikhilpoddar 2 15 Oct 2006, 01:38
F(n) denotes the remainder when n is divided by k. Is k apollo168 9 30 Aug 2006, 07:47
F(n) denotes the remainder when n is divided by k. Is k alimad 3 27 Jul 2006, 09:24
F(n) denotes the remainder when n is divided by k. Is k itishaj 13 04 Jun 2006, 09:43
Display posts from previous: Sort by

If {n} denote the remainder when 3n is divided by 2 then

  Question banks Downloads My Bookmarks Reviews Important topics  


cron

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

Powered by phpBB © phpBB Group and phpBB SEO

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