Author 
Message 
TAGS:

Hide Tags

CEO
Joined: 17 Nov 2007
Posts: 3511
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth)  Class of 2011

Re: Math: Number Theory [#permalink]
Show Tags
27 May 2011, 09:24
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? Thanks,
_________________
HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android)  The OFFICIAL GMAT CLUB PREP APP, a musthave app especially if you aim at 700+  PrepGame





Manager
Joined: 11 Apr 2011
Posts: 97

Re: Math: Number Theory [#permalink]
Show Tags
17 Jul 2011, 10: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.



Intern
Joined: 05 Aug 2011
Posts: 4

Re: Math: Number Theory [#permalink]
Show Tags
05 Sep 2011, 01:15
Hi GMAT CLUB, Thank you for this super book. I am completely following it for my exam in November. I am going through the chapter on Number Theory, under heading "Finding the Number of Factors of an Integer". Please can someone explain how you arrived at the following rule. Is there any proof for it. For an integer n=a^p*b^q*c^r, where a, b, and c are prime factors of n and p, q, and r are their powers. The number of factors of n will be expressed by the formula (p+1)(q+1)(r+1). NOTE: this will include 1 and n itself. Thank You for your help.



Senior Manager
Joined: 12 Dec 2010
Posts: 257
Concentration: Strategy, General Management
GMAT 1: 680 Q49 V34 GMAT 2: 730 Q49 V41
GPA: 4
WE: Consulting (Other)

Re: Math: Number Theory [#permalink]
Show Tags
10 Sep 2011, 23:04
This one piece is awesome of all on the math book!
_________________
My GMAT Journey 540>680>730!
~ When the going gets tough, the Tough gets going!



Senior Manager
Joined: 12 Dec 2010
Posts: 257
Concentration: Strategy, General Management
GMAT 1: 680 Q49 V34 GMAT 2: 730 Q49 V41
GPA: 4
WE: Consulting (Other)

Re: Math: Number Theory [#permalink]
Show Tags
10 Sep 2011, 23:08
gujralam wrote: Hi GMAT CLUB, Thank you for this super book. I am completely following it for my exam in November. I am going through the chapter on Number Theory, under heading "Finding the Number of Factors of an Integer". Please can someone explain how you arrived at the following rule. Is there any proof for it. For an integer n=a^p*b^q*c^r, where a, b, and c are prime factors of n and p, q, and r are their powers. The number of factors of n will be expressed by the formula (p+1)(q+1)(r+1). NOTE: this will include 1 and n itself. Thank You for your help. Please search for "uniqueprimefactorization theorem" on web, you should be able to get what you are looking for!
_________________
My GMAT Journey 540>680>730!
~ When the going gets tough, the Tough gets going!



Intern
Joined: 03 Mar 2010
Posts: 34

Re: Math: Number Theory [#permalink]
Show Tags
21 Sep 2011, 02:37
Thanks a lot Bunuel.. truly awesome...



Intern
Joined: 24 Nov 2011
Posts: 1

Re: Math: Number Theory [#permalink]
Show Tags
24 Nov 2011, 18:23
This is THE BEST thing anyone has ever posted. THANK YOU SO MUCH.
__________________ Cost performance Electronics Wholesales online: chingtown com



Intern
Joined: 15 Apr 2010
Posts: 48

Re: Math: Number Theory [#permalink]
Show Tags
17 Dec 2011, 08: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?
Thanks again!



Manager
Joined: 09 Aug 2011
Posts: 131
Location: United States
Concentration: General Management
GMAT Date: 11152011
GPA: 3.33

Re: Math: Number Theory [#permalink]
Show Tags
06 Feb 2012, 15:55
Bunnel you simply ROCK!!!!



Manager
Joined: 23 Feb 2012
Posts: 208
Location: India
Concentration: Finance, Entrepreneurship
GPA: 2.9
WE: Marketing (Computer Software)

Re: Math: Number Theory [#permalink]
Show Tags
05 Mar 2012, 01: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."
710 Debrief. Crash and Burn



Intern
Joined: 10 Jan 2012
Posts: 40
Location: United States
Concentration: Finance, Entrepreneurship

Re: Math: Number Theory [#permalink]
Show Tags
06 Mar 2012, 13:00
Bunuel wrote: NUMBER THEORY
EXPONENTS
Exponents and divisibility: \(a^nb^n\) is ALWAYS divisible by \(ab\). \(a^nb^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.



Math Expert
Joined: 02 Sep 2009
Posts: 44600

Re: Math: Number Theory [#permalink]
Show Tags
06 Mar 2012, 13:03



Intern
Joined: 10 Jan 2012
Posts: 40
Location: United States
Concentration: Finance, Entrepreneurship

Re: Math: Number Theory [#permalink]
Show Tags
06 Mar 2012, 14:32
Bunuel wrote: destroyerofgmat wrote: Bunuel wrote: NUMBER THEORY
EXPONENTS
Exponents and divisibility: \(a^nb^n\) is ALWAYS divisible by \(ab\). \(a^nb^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.



Intern
Joined: 07 May 2012
Posts: 8
Location: India
Concentration: Technology, Strategy
WE: Information Technology (Computer Software)

Re: Math: Number Theory [#permalink]
Show Tags
17 May 2012, 02:03
Thanks a Tonn for the detailed post and help !!!!!



Intern
Joined: 24 Apr 2012
Posts: 3

Re: Math: Number Theory [#permalink]
Show Tags
01 Jun 2012, 13:27
Thanks a lot for the detailed post ! This is sure to help with my recurrent mistakes on number properties



Manager
Joined: 23 Aug 2011
Posts: 77

Re: Math: Number Theory [#permalink]
Show Tags
04 Sep 2012, 19: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 nonnegative 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
_________________
Whatever one does in life is a repetition of what one has done several times in one's life! If my post was worth it, then i deserve kudos



Director
Joined: 22 Mar 2011
Posts: 607
WE: Science (Education)

Re: Math: Number Theory [#permalink]
Show Tags
05 Sep 2012, 00: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 nonnegative 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.



Intern
Joined: 09 Sep 2012
Posts: 29
Location: United States

Re: Math: Number Theory [#permalink]
Show Tags
22 Sep 2012, 20:15
Hey..Awesome post !! Like number theory, can u pls share links for other topics as well ?



Math Expert
Joined: 02 Sep 2009
Posts: 44600

Re: Math: Number Theory [#permalink]
Show Tags
24 Sep 2012, 04:01



Intern
Joined: 18 Jan 2012
Posts: 49
Location: United States

Re: Math: Number Theory [#permalink]
Show Tags
25 Sep 2012, 10:43
1
This post received KUDOS
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 nonnegative 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 The highest power of a prime number "k" that divides any number "n!" is given by the formula n/K + n/k^2+n/k^3.. (until numerator becomes lesser than the denominator). Remember to truncate the remainders of each expressionE.g : The highest number of 2's in 10! is 10/2 + 10/4 + 10/8 = 5 + 2 + 1 = 8 (Truncate the reminder of each expression) As a consequence of this, the number of zeros in n! is controlled by the presence of 5s. Why ? 2 reasons a) 10 = 5 x 2, b) Also in any n!, the number of 5's are far lesser than the number of 2's. Think about this example. The number of cars that you make depends on the number of engines. You can have 100 engines and 1000 cars, but you can only make 100 cars (each car needs an engine !) 10 ! = 10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1 Lets factorize each term ... 10! = (5 x 2) x(3x3)x(2x2x2)x7x(2x3)x(5)X(2x2)x1 the number of 5s = 2 The number of 2s = 7 The number of zeros in 10! = the total number of 5s = 2 (You may use a calc to check this 10! = 3628800) hence in any n! , the number of 5's control the number of zeros.As a consequence of this, the number of 5's in any n! is n/5 + n/25 + n/125 ..until numerator becomes lesser than denominator. Again, i want to emphasize that this formuala only works for prime numbers !! So to find the number of 10's in any n!, DO NOT DIVIDE by 10 ! (10 is not prime !) i.e DONT do n/10 + n/100 + n/1000  THIS IS WRONG !!!
_________________
 IT TAKES QUITE A BIT OF TIME AND ENERGY TO POST DETAILED RESPONSES. A KUDOS IS a small but effective way to say "Thank You" 




Re: Math: Number Theory
[#permalink]
25 Sep 2012, 10:43



Go to page
Previous
1 2 3 4 5 6 7 8 9 10 11
Next
[ 216 posts ]



