It is currently 21 Sep 2017, 03:52

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

remainder

  post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
Manager
Manager
avatar
Joined: 04 Sep 2006
Posts: 113

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

remainder [#permalink]

Show Tags

New post 28 May 2009, 09:09
1
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

what is the remainder when 40! / 41? and when 39! / 41 ?

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

GMAT Instructor
User avatar
Joined: 07 Jul 2003
Posts: 769

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

Location: New York NY 10024
Schools: Haas, MFE; Anderson, MBA; USC, MSEE
Re: remainder [#permalink]

Show Tags

New post 28 May 2009, 12:28
40! mod 41 = 40 (any prime number - 1) mod prime number = prime number - 1
39! mod 41 = 1 (any prime number - 2) mod Prime number = 1

Think about it.

Proof to follow....
_________________

Best,

AkamaiBrah
Former Senior Instructor, Manhattan GMAT and VeritasPrep
Vice President, Midtown NYC Investment Bank, Structured Finance IT
MFE, Haas School of Business, UC Berkeley, Class of 2005
MBA, Anderson School of Management, UCLA, Class of 1993

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

Expert Post
Founder
Founder
User avatar
P
Joined: 04 Dec 2002
Posts: 15445

Kudos [?]: 27928 [0], given: 5049

Location: United States (WA)
GMAT 1: 750 Q49 V42
GMAT ToolKit User Premium Member CAT Tests
Re: remainder [#permalink]

Show Tags

New post 28 May 2009, 12:31
Good to see you Akamai!
_________________

Founder of GMAT Club

GMAT Club's Special offer for Student Loans only through Aug 31 - New!
Just starting out with GMAT? Start here... or use our Daily Study Plan


Co-author of the GMAT Club tests

Kudos [?]: 27928 [0], given: 5049

GMAT Instructor
User avatar
Joined: 07 Jul 2003
Posts: 769

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

Location: New York NY 10024
Schools: Haas, MFE; Anderson, MBA; USC, MSEE
Re: remainder [#permalink]

Show Tags

New post 28 May 2009, 13:03
AkamaiBrah wrote:
40! mod 41 = 40 (any prime number - 1) mod prime number = prime number - 1
39! mod 41 = 1 (any prime number - 2) mod Prime number = 1

Think about it.

Proof to follow....


Actually, I don't think this is a fair GMAT question. The problem is an application of "Wilson's Theorem" which is far beyond the knowledge needed for the GMAT. I would be happy to see an answer that has a solution which falls under GMAT-required knowledge.
_________________

Best,

AkamaiBrah
Former Senior Instructor, Manhattan GMAT and VeritasPrep
Vice President, Midtown NYC Investment Bank, Structured Finance IT
MFE, Haas School of Business, UC Berkeley, Class of 2005
MBA, Anderson School of Management, UCLA, Class of 1993

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

Manager
Manager
avatar
Joined: 04 Sep 2006
Posts: 113

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

Re: remainder [#permalink]

Show Tags

New post 31 May 2009, 00:50
40! =40! +1-1= (40! +1)+40-41

when 40! / 41 remainder is 40 since except 40 other terms are divisble by 41 and hence the remainder is 40/41 i.e. 40 .

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

GMAT Instructor
User avatar
Joined: 07 Jul 2003
Posts: 769

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

Location: New York NY 10024
Schools: Haas, MFE; Anderson, MBA; USC, MSEE
Re: remainder [#permalink]

Show Tags

New post 01 Jun 2009, 15:50
vcbabu wrote:
40! =40! +1-1= (40! +1)+40-41

when 40! / 41 remainder is 40 since except 40 other terms are divisble by 41 and hence the remainder is 40/41 i.e. 40 .


Hmmmm. Please demonstrate to me some proof or method to determine that (40! + 1) is divisible by 41. This is the same as saying 40! mod 41 = 40. Essentially, you are using the answer to the problem to find the answer -- circular logic.

If you are claiming that (n! + 1) is always divisible by n + 1, THAT IS WRONG; here is a simple counter example: (3! + 1) = 7 which is certainly NOT divisible by 4.

The ONLY time (n! + 1) is divisible by n + 1 is when n + 1 is PRIME, which is the essense of Wilson's formula and which no GMAT student should be expected to know.

Nuff said.
_________________

Best,

AkamaiBrah
Former Senior Instructor, Manhattan GMAT and VeritasPrep
Vice President, Midtown NYC Investment Bank, Structured Finance IT
MFE, Haas School of Business, UC Berkeley, Class of 2005
MBA, Anderson School of Management, UCLA, Class of 1993

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

Re: remainder   [#permalink] 01 Jun 2009, 15:50
Display posts from previous: Sort by

remainder

  post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions| 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®.