GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 21 Oct 2018, 11:58

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

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

hcf of two no.

Author Message
TAGS:

Hide Tags

Intern
Joined: 18 Dec 2012
Posts: 2

Show Tags

18 Dec 2012, 19:37
If A = (2^(20) -1) and B = (2^(110) - 1). Then HCF(A,B) =
VP
Status: Been a long time guys...
Joined: 03 Feb 2011
Posts: 1169
Location: United States (NY)
Concentration: Finance, Marketing
GPA: 3.75
Re: hcf of two no.  [#permalink]

Show Tags

18 Dec 2012, 20:29
Hii welcome to GMATCLUB.
Please see the rules before posting.

In this question, the answer must be 3.
Take two numbers for easy calculation: 2^6 and 2^8.
So 2^6 - 1=63, 2^8 - 1=255.
Hcf is 3.
Hence IMO for the two numbers in question, the hcf will be 3.
_________________
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 8399
Location: Pune, India
Re: hcf of two no.  [#permalink]

Show Tags

19 Dec 2012, 00:27
2
juantheron wrote:
If A = (2^(20) -1) and B = (2^(110) - 1). Then HCF(A,B) =

Use a^2 - b^2 = (a + b)(a - b) to factorize the expressions.

$$A = 2^{20} - 1^{20} = 2^{10*2} - 1^{10*2} = (2^{10})^2 - (1^{10})^2 = (2^{10} + 1^{10})(2^{10} - 1^{10})$$
$$B = 2^{110} - 1^{110} = 2^{10*11} - 1^{10*11} = (2^{10})^{11} - (1^{10})^{11} = (2^{10} - 1^{10})(2^{100} + ....)$$

(Difference of odd powers is divisible by the difference of the numbers e.g. x^3 - y^3 is divisible by x-y)

The highest common factor must be$$(2^{10} - 1^{10}) = 2^{10} - 1$$
_________________

Karishma
Veritas Prep GMAT Instructor

GMAT self-study has never been more personalized or more fun. Try ORION Free!

VP
Status: Been a long time guys...
Joined: 03 Feb 2011
Posts: 1169
Location: United States (NY)
Concentration: Finance, Marketing
GPA: 3.75
Re: hcf of two no.  [#permalink]

Show Tags

19 Dec 2012, 02:57
Hi Karishma.
Is there any alternate way to do this question?
I tried picking up a smaller number but failed as evitable by your explanation.
_________________
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 8399
Location: Pune, India
Re: hcf of two no.  [#permalink]

Show Tags

19 Dec 2012, 21:02
Marcab wrote:
Hi Karishma.
Is there any alternate way to do this question?
I tried picking up a smaller number but failed as evitable by your explanation.

There is no reason that the HCF of two small numbers will be the same as the HCF of two larger numbers. The question is meant to test your application of algebraic identities.
_________________

Karishma
Veritas Prep GMAT Instructor

GMAT self-study has never been more personalized or more fun. Try ORION Free!

Manager
Joined: 05 Dec 2015
Posts: 118
Re: hcf of two no.  [#permalink]

Show Tags

02 Oct 2017, 21:35
do you mind writing out the "..." part in B please? I understood the rest of your explanation perfect, just got lost there. Many thanks!

Michael

VeritasPrepKarishma wrote:
juantheron wrote:
If A = (2^(20) -1) and B = (2^(110) - 1). Then HCF(A,B) =

Use a^2 - b^2 = (a + b)(a - b) to factorize the expressions.

$$A = 2^{20} - 1^{20} = 2^{10*2} - 1^{10*2} = (2^{10})^2 - (1^{10})^2 = (2^{10} + 1^{10})(2^{10} - 1^{10})$$
$$B = 2^{110} - 1^{110} = 2^{10*11} - 1^{10*11} = (2^{10})^{11} - (1^{10})^{11} = (2^{10} - 1^{10})(2^{100} + ....)$$

(Difference of odd powers is divisible by the difference of the numbers e.g. x^3 - y^3 is divisible by x-y)

The highest common factor must be$$(2^{10} - 1^{10}) = 2^{10} - 1$$
Re: hcf of two no. &nbs [#permalink] 02 Oct 2017, 21:35
Display posts from previous: Sort by

hcf of two no.

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