BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

number theory

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Source: — Problem Solving |
Legendary Member
Posts: 527
Joined: Thu May 01, 2008 12:06 am
Thanked: 7 times

Re: number theory

by real2008 » Thu Jul 23, 2009 10:44 am
priyankagumber wrote:Find the number of possible values of integer ‘x’ such that 41^n when divided by ‘x’ leaves 1 as the remainder. (‘n’ is any prime number greater than 5)
Is the answer 8? I have one doubt.... Is it needed that 'n' to be prime number greater than 5 but not any positive integer?
Top
User avatar
Master | Next Rank: 500 Posts
Posts: 157
Joined: Tue Oct 07, 2008 5:47 am
Thanked: 3 times

by PussInBoots » Fri Jul 24, 2009 11:12 pm
This cannot be on GMAT. 41 ^ 7 -1 vs 41 ^ 11 - 1 have different divisors. Only answers of some f-on of n would be correct. That'd take more than 3 minutes to solve.
Top
Master | Next Rank: 500 Posts
Posts: 113
Joined: Thu Jul 16, 2009 11:23 am
Thanked: 15 times
GMAT Score:730

by prindaroy » Sat Jul 25, 2009 12:00 am
That's certainly not a GMAT question. I don't know where you're pulling these questions from. Anyways, the number of divisors of 41^n = n+1, so for numbers that have a remainder of 1, the answer is n .
Top
User avatar
Master | Next Rank: 500 Posts
Posts: 157
Joined: Tue Oct 07, 2008 5:47 am
Thanked: 3 times

by PussInBoots » Sat Jul 25, 2009 11:47 am
prindaroy wrote:That's certainly not a GMAT question. I don't know where you're pulling these questions from. Anyways, the number of divisors of 41^n = n+1, so for numbers that have a remainder of 1, the answer is n .
Wrong

41^ 2 = 1681

10, 20, 40, 80, 2, 5...
Top
Post new topic Post Reply
• Page 1 of 1