Register    Login    Search    Rss Feeds

 Page 1 of 1 [ 2 posts ] 



 
Author Message
 Post subject: * MGMAT - Challenge Problem - April 18 2011
 Post Posted: Mon May 16, 2011 11:22 am 
Offline
Course Students


Posts: 13
Hi - I understand the answer for this question, but I am having issues with the stem of the question:

1101 = (1 × 2^3) + (1 × 2^2) + (0 × 2^1) + (1 × 2^0) = 25

When I add this, I get 13: 8 + 4 + 0 + 1

What am I missing?

Thanks!

Question
Every digit of a number written in binary is either 0 or 1. To translate a number from binary, multiply the nth digit (reading from right to left) by 2^n – 1. For instance, 1101 = (1 × 2^3) + (1 × 2^2) + (0 × 2^1) + (1 × 2^0) = 25. What is the largest prime number (written in binary) that is a factor of both 100010000 and 1000100000 ?
(A) 10
(B) 11
(C) 101
(D) 1011
(E) 10001


Top 
 Post subject: Re: MGMAT - Challenge Problem - April 18 2011
 Post Posted: Sat May 21, 2011 4:33 am 
Offline
ManhattanGMAT Staff


Posts: 7146
hi -- please re-post this problem in the correct folder (i.e., the GENERAL MATH folder).
this folder is strictly for problems from the GMAT PREP official test-prep software.

thank you -- we'll delete this thread in 5-7 days.


Top 
Display posts from previous:  Sort by  
 
 Page 1 of 1 [ 2 posts ] 





Who is online

Users browsing this forum: No registered users and 1 guest

 
 

 
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

Search for:
Jump to: