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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

When the number 777 is divided by the integer N, the remainder is 77. How many integer possibilities are there for N?

I think it should me mentioned that \(n\) is a positive integer.

Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).

So we'd have: \(777=qn+77\), where \(remainder=77<n=divisor\) --> \(qn=700=2^2*5^2*7\) --> as \(n\) must be more than 77 then \(n\) could take only 5 values: 100, 140, 175, 350, and 700.

Re: When the number 777 is divided by the integer N, the remaind [#permalink]

Show Tags

15 Sep 2010, 13:49

mainhoon wrote:

Can N be allowed to be negative? Does GMAT allow that possibility and if so, how does one answer this then?

the problem with negative numbers is that there is no unique definition of remainder

the only condition is that abs(remainder)<abs(divisor)

But even if we follow that, it is enough to tell us that the possible divisors is just double. All the positive ones listed above as well as -1*those numbers hence, 10
_________________

Re: When the number 777 is divided by the integer N, the remaind [#permalink]

Show Tags

18 Oct 2010, 10:29

Bunuel wrote:

mainhoon wrote:

When the number 777 is divided by the integer N, the remainder is 77. How many integer possibilities are there for N?

I think it should me mentioned that \(n\) is a positive integer.

Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).

So we'd have: \(777=qn+77\), where \(remainder=77<n=divisor\) --> \(qn=700=2^2*5^2*7\) --> as \(n\) must be more than 77 then \(n\) could take only 5 values: 100, 140, 175, 350, and 700.

Answer: 5.

I couldn't understand how we arrived at 100,140,175,350 and 700... is it something that we did manually or erupted out of the calculation given here
_________________

Re: When the number 777 is divided by the integer N, the remaind [#permalink]

Show Tags

19 Oct 2010, 01:30

hirendhanak wrote:

Bunuel wrote:

mainhoon wrote:

When the number 777 is divided by the integer N, the remainder is 77. How many integer possibilities are there for N?

I think it should me mentioned that \(n\) is a positive integer.

Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).

So we'd have: \(777=qn+77\), where \(remainder=77<n=divisor\) --> \(qn=700=2^2*5^2*7\) --> as \(n\) must be more than 77 then \(n\) could take only 5 values: 100, 140, 175, 350, and 700.

Answer: 5.

I couldn't understand how we arrived at 100,140,175,350 and 700... is it something that we did manually or erupted out of the calculation given here

by multiplying the factors of \(700\) with each other and selecting only those numbers which result in \(\geq 77\) till \(700\).
_________________

"I choose to rise after every fall" Target=770 http://challengemba.blogspot.com Kudos??

Re: When the number 777 is divided by the integer N, the remaind [#permalink]

Show Tags

29 Jun 2013, 11:09

5

This post received KUDOS

hirendhanak wrote:

Bunuel wrote:

mainhoon wrote:

When the number 777 is divided by the integer N, the remainder is 77. How many integer possibilities are there for N?

I think it should me mentioned that \(n\) is a positive integer.

Positive integer \(a\) divided by positive integer \(d\) yields a reminder of \(r\) can always be expressed as \(a=qd+r\), where \(q\) is called a quotient and \(r\) is called a remainder, note here that \(0\leq{r}<d\) (remainder is non-negative integer and always less than divisor).

So we'd have: \(777=qn+77\), where \(remainder=77<n=divisor\) --> \(qn=700=2^2*5^2*7\) --> as \(n\) must be more than 77 then \(n\) could take only 5 values: 100, 140, 175, 350, and 700.

Answer: 5.

I couldn't understand how we arrived at 100,140,175,350 and 700... is it something that we did manually or erupted out of the calculation given here

One way to think about this that might help is the following:

You know that the feasible factors of 700 must be in a range above 77. Thus start breaking down 700 "from the top":

700 x 1 350 x 2 175 x 4 140 x 5 100 x 7

The next one, 70 x 10, is already out of range. That gives you 5 factors.

Re: When the number 777 is divided by the integer N, the remaind [#permalink]

Show Tags

13 Nov 2014, 15:08

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

Happy New Year everyone! Before I get started on this post, and well, restarted on this blog in general, I wanted to mention something. For the past several months...

It’s quickly approaching two years since I last wrote anything on this blog. A lot has happened since then. When I last posted, I had just gotten back from...

Happy 2017! Here is another update, 7 months later. With this pace I might add only one more post before the end of the GSB! However, I promised that...