document.write( "Question 925269: Drew purchased a used 50 page book. The book, in which left-hand pages contained even page #s and the right-hand pages contained odd page #s, did not contain all 50 pages. The sum of the page #s on the pages that Drew's book did contain was 1242. What is the greatest page # that could be on a page missing from Drew's book? \n" ); document.write( "
Algebra.Com's Answer #561608 by KMST(5328)\"\" \"About 
You can put this solution on YOUR website!
In all books I have ever had, left-hand pages contained even page #s and the right-hand pages contained odd page #s. That sounds normal to me.
\n" ); document.write( "
\n" ); document.write( "If one page is missing, the page on the reverse must be missing too.
\n" ); document.write( "For example, if page 1 is missing, page 2, which is the other side must also be missing.
\n" ); document.write( "So, missing pages must come in pairs: one odd numbered (right page), with number \"N\" ,
\n" ); document.write( "and the even numbered page with the next page number, \"N%2B1\" .
\n" ); document.write( "If just one such set of 2 pages is missing, the sum of their numbers will be
\n" ); document.write( "\"N++%2B+%28N%2B1%29+=+2N+%2B+1\" .
\n" ); document.write( "
\n" ); document.write( "The numbers on all 50 pages add up to
\n" ); document.write( "\"%281%2B50%29%2A50%2F2=1275\"
\n" ); document.write( "The sum of numbers on the missing pages will be
\n" ); document.write( "\"1275-1242=33\"
\n" ); document.write( "Could that be just 2 pages, an \"odd\" page and the next page?
\n" ); document.write( "I don't think so, and I can explain why it cannot be so.
\n" ); document.write( "If the pages missing were page \"N\", and page \"N%2B1\" ,
\n" ); document.write( "\"2N%2B1=33\"-->\"2N=33-1\"-->\"2N=32\"-->\"N=16\" and that does not work, because \"16\" is not odd.
\n" ); document.write( "The book cannot be missing just page 16 and page 17, because the reverse of page 16 is page 15 and the reverse of page 17 is page 18.
\n" ); document.write( "
\n" ); document.write( "Since the sum of the numbers of the missing pages is \"33\" which is odd,
\n" ); document.write( "and it cannot be the sum of the numbers of 1 pair of consecutive pages,
\n" ); document.write( "it must be the sum of the numbers of 3 pairs of consecutive pages,
\n" ); document.write( "because the sum of 2 pairs of consecutive pages would be even.
\n" ); document.write( "Making the numbers in 2 of the 3 pairs as small as possible would make the numbers in the third pair as large as possible.
\n" ); document.write( "The smallest 4 numbers are 1, 2, 3, and 4, and
\n" ); document.write( "\"1%2B2%2B3%2B4=10\"
\n" ); document.write( "The sum of the third pair would be \"33-10=23\" ,
\n" ); document.write( "and \"2N%2B1=23\"-->\"2N=23-1\"-->\"2N=22\"-->\"N=11\" gives us an odd first page.
\n" ); document.write( "The reverse has the number \"N%2B1=highlight%2812%29\"
\n" ); document.write( "and that would be the greatest page number that could be on a page missing from Drew's book.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );