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 350,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:

Re: Math: Number Theory [#permalink]
27 May 2011, 07:21

thank you for the great post. I currently use the GMAT Toolkit app, which I highly recommend, when can I expect this update? In addition, when will the Manhattan GMAT books be updated to the app?

Re: Math: Number Theory [#permalink]
27 May 2011, 08:24

Expert's post

Hi,

Thanks for your words! 1.6.0 update is available for download. Just get it, go to Store and you can buy any of 10 famous Manhattan GMAT books.

Let me know if you have any questions.

OrenY wrote:

thank you for the great post. I currently use the GMAT Toolkit app, which I highly recommend, when can I expect this update? In addition, when will the Manhattan GMAT books be updated to the app?

Re: Math: Number Theory [#permalink]
17 Jul 2011, 09:18

is this always true? The product of n consecutive integers is always divisible by n!. Given consecutive integers: . The product of 3*4*5*6 is 360, which is divisible by 4!=24.

for example, n=10 and the first number starts at 100000, then this rule doesn't hold.

Re: Math: Number Theory [#permalink]
17 Dec 2011, 07:52

Hi, thanks for the great summary. BTW, do you have a list of questions (just question number) in OG12 + Quant Review 2nd edition to practice, just like the Triangles and Circle section?

Re: Math: Number Theory [#permalink]
05 Mar 2012, 00:29

Breathtaking post! (Literally!) _________________

If you like it, Kudo it!

"There is no alternative to hard work. If you don't do it now, you'll probably have to do it later. If you didn't need it now, you probably did it earlier. But there is no escaping it."

Re: Math: Number Theory [#permalink]
06 Mar 2012, 12:00

Bunuel wrote:

NUMBER THEORY

EXPONENTS

Exponents and divisibility: \(a^n-b^n\) is ALWAYS divisible by \(a-b\). \(a^n-b^n\) is divisible by \(a+b\) if \(n\) is even. \(a^n + b^n\) is divisible by \(a+b\) if \(n\) is odd, and not divisible by a+b if n is even.

Hello, Bunuel. Great post!

Do you have an example problem in which this applies. I plugged in numbers to understand the concept I was just curious about the application and seeing this in action. Thanks.

Re: Math: Number Theory [#permalink]
06 Mar 2012, 12:03

Expert's post

destroyerofgmat wrote:

Bunuel wrote:

NUMBER THEORY

EXPONENTS

Exponents and divisibility: \(a^n-b^n\) is ALWAYS divisible by \(a-b\). \(a^n-b^n\) is divisible by \(a+b\) if \(n\) is even. \(a^n + b^n\) is divisible by \(a+b\) if \(n\) is odd, and not divisible by a+b if n is even.

Hello, Bunuel. Great post!

Do you have an example problem in which this applies. I plugged in numbers to understand the concept I was just curious about the application and seeing this in action. Thanks.

Re: Math: Number Theory [#permalink]
06 Mar 2012, 13:32

Bunuel wrote:

destroyerofgmat wrote:

Bunuel wrote:

NUMBER THEORY

EXPONENTS

Exponents and divisibility: \(a^n-b^n\) is ALWAYS divisible by \(a-b\). \(a^n-b^n\) is divisible by \(a+b\) if \(n\) is even. \(a^n + b^n\) is divisible by \(a+b\) if \(n\) is odd, and not divisible by a+b if n is even.

Hello, Bunuel. Great post!

Do you have an example problem in which this applies. I plugged in numbers to understand the concept I was just curious about the application and seeing this in action. Thanks.

Check this:

Awesome! Thanks. That's definitely above my level but good practice no doubt.

Re: Math: Number Theory [#permalink]
04 Sep 2012, 18:34

Bunuel wrote:

NUMBER THEORY

Trailing zeros: Trailing zeros are a sequence of 0's in the decimal representation (or more generally, in any positional representation) of a number, after which no other digits follow.

125000 has 3 trailing zeros;

The number of trailing zeros in the decimal representation of n!, the factorial of a non-negative integer \(n\), can be determined with this formula:

\(\frac{n}{5}+\frac{n}{5^2}+\frac{n}{5^3}+...+\frac{n}{5^k}\), where k must be chosen such that \(5^k<n\).

It's easier if you look at an example:

How many zeros are in the end (after which no other digits follow) of \(32!\)? \(\frac{32}{5}+\frac{32}{5^2}=6+1=7\) (denominator must be less than 32, \(5^2=25\) is less)

Hence, there are 7 zeros in the end of 32!

The formula actually counts the number of factors 5 in n!, but since there are at least as many factors 2, this is equivalent to the number of factors 10, each of which gives one more trailing zero.

I noticed in case the number (n) is multiple of \(5^k\) and we have to find number of trailing zero zeroes, then it will be \(5^k<=n\) rather \(5^k<n\)

Re: Math: Number Theory [#permalink]
04 Sep 2012, 23:13

conty911 wrote:

Bunuel wrote:

NUMBER THEORY

Trailing zeros: Trailing zeros are a sequence of 0's in the decimal representation (or more generally, in any positional representation) of a number, after which no other digits follow.

125000 has 3 trailing zeros;

The number of trailing zeros in the decimal representation of n!, the factorial of a non-negative integer \(n\), can be determined with this formula:

\(\frac{n}{5}+\frac{n}{5^2}+\frac{n}{5^3}+...+\frac{n}{5^k}\), where k must be chosen such that \(5^k<n\).

It's easier if you look at an example:

How many zeros are in the end (after which no other digits follow) of \(32!\)? \(\frac{32}{5}+\frac{32}{5^2}=6+1=7\) (denominator must be less than 32, \(5^2=25\) is less)

Hence, there are 7 zeros in the end of 32!

The formula actually counts the number of factors 5 in n!, but since there are at least as many factors 2, this is equivalent to the number of factors 10, each of which gives one more trailing zero.

I noticed in case the number (n) is multiple of \(5^k\) and we have to find number of trailing zero zeroes, then it will be \(5^k<=n\) rather \(5^k<n\)

no of trailing zeros in 25! =6

\(\frac{25}{5}+\frac{25}{5^2}= 5+1\); Please correct me, clarify if i'm wrong. Thanks

You are right. \(k\) is the highest power of 5 not exceeding \(n.\) _________________

PhD in Applied Mathematics Love GMAT Quant questions and running.

Hey, everyone. After a hectic orientation and a weeklong course, Managing Groups and Teams, I have finally settled into the core curriculum for Fall 1, and have thus found...

MBA Acceptance Rate by Country Most top American business schools brag about how internationally diverse they are. Although American business schools try to make sure they have students from...

After I was accepted to Oxford I had an amazing opportunity to visit and meet a few fellow admitted students. We sat through a mock lecture, toured the business...