document.write( "Question 86891: 1. What’s the smallest number that you can write with 1’s and 0’s which is divisible by 225?\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "2. The divisors of 216,000 add up to 792,480. What do their reciprocals add up to?\r
\n" ); document.write( "\n" ); document.write( "3. Find the product: 1·2·4·8·16· . . . · 2(to the 399th power)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "4. All natural numbers from 1 to 101 are written in a row. How can the signs “+” and “-” be placed between them so that the value of the resulting expression is 0?\r
\n" ); document.write( "\n" ); document.write( " \r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #62861 by Edwin McCravy(20054)\"\" \"About 
You can put this solution on YOUR website!
1. What’s the smallest number that you can write with 1’s and 0’s which is divisible by 225?
\n" ); document.write( "

\n" ); document.write( "The multiples of 225 end in 25, 50, 75, or 00. Only those ending in 00 could
\n" ); document.write( "contain only the digits 1's and 0's. Those are the multiples of 4×225 or 900.
\n" ); document.write( "So we need a multiple of 900.
\n" ); document.write( "

\n" ); document.write( "The multiples of 900 are just the multiples of 9 with two 0's annexed.
\n" ); document.write( "

\n" ); document.write( "Theorem: A positive integer is divisible by 9 if and only if the sum of its digits is a multiple of 9.
\n" ); document.write( "

\n" ); document.write( "So the smallest integer which contains only 1's and 0's and has sum of digits a multiple of 9 is 111111111 (9 1's). Then the smallest multiple of 900 that has only 1's and 0's is found by annexing two 0's to that. So the answer is 11111111100.
\n" ); document.write( "

\n" ); document.write( "

\n" ); document.write( "2. The divisors of 216,000 add up to 792,480. What do their reciprocals add up to?
\n" ); document.write( "

\n" ); document.write( "Theorem: The sum of the reciprocals of positive integer n =
\n" ); document.write( "the sum of the divisors of n divided by n.
\n" ); document.write( "

\n" ); document.write( "Let's do it with a smaller number like 12, so you can see why.
\n" ); document.write( "

\n" ); document.write( "The divisors of 12 are 1,2,3,4,6,12. Their sum is 28.
\n" ); document.write( "

\n" ); document.write( "Look at the sum of the reciprocals:
\n" ); document.write( "

\n" ); document.write( "\"1%2B1%2F2%2B1%2F3%2B1%2F4%2B1%2F6%2B1%2F12\"
\n" ); document.write( "

\n" ); document.write( "Obviously 12 is the LCD, so when we get the LCD of 12, we have
\n" ); document.write( "

\n" ); document.write( "\"12%2F12%2B6%2F12%2B4%2F12%2B3%2F12%2B2%2F13%2B1%2F12\"
\n" ); document.write( "

\n" ); document.write( "or
\n" ); document.write( "

\n" ); document.write( "\"%2812%2B6%2B4%2B3%2B2%2B1%29%2F12\"
\n" ); document.write( "

\n" ); document.write( "The numerator is just the sum of the divisors of 12, and
\n" ); document.write( "thus equals to the fraction \"28%2F12\" which reduces to 7/3
\n" ); document.write( "

\n" ); document.write( "Let the set of divisors of 216,000 be S =
\n" ); document.write( "

\n" ); document.write( "{1,2,3,4,5,6,8,9,10,12,15,16,18,20,...,216000}.
\n" ); document.write( "

\n" ); document.write( "if x e S then 216000/x e S.
\n" ); document.write( "

\n" ); document.write( "Look at this sum:
\n" ); document.write( "

\n" ); document.write( "

\n" ); document.write( "If we get the LCD of 216000, we have
\n" ); document.write( "

\n" ); document.write( "\"216000%2F216000%2B108000%2F216000\"+...+\"1%2F216000\"
\n" ); document.write( "

\n" ); document.write( "or the fraction
\n" ); document.write( "

\n" ); document.write( "216000+108000+...+1
\n" ); document.write( "-------------------
\n" ); document.write( "`````216000
\n" ); document.write( "

\n" ); document.write( "and the numerator is just the sum of the divisiors of 216000
\n" ); document.write( "which we are given to be 7982480.
\n" ); document.write( "

\n" ); document.write( "So the answer is \"792480%2F216000\". Both numerator and
\n" ); document.write( "denominator can be divided by 480 to reduce that fraction to
\n" ); document.write( "

\n" ); document.write( "\"1651%2F450\"
\n" ); document.write( "

\n" ); document.write( "

\n" ); document.write( "3. Find the product: 1·2·4·8·16· . . . · 2(to the 399th power)
\n" ); document.write( "

\n" ); document.write( "\"2%5E0\"·\"2%5E1\"·\"2%5E2\"·\"2%5E3\"·\"2%5E4\"·...·\"2%5E399\"
\n" ); document.write( "\n" ); document.write( "The sum of those exponents are the sum of the first 399 positive
\n" ); document.write( "integers.
\n" ); document.write( "

\n" ); document.write( "The formula for the first n positive integers is \"n%28n%2B1%29%29%2F2\"
\n" ); document.write( "

\n" ); document.write( "So the sum of the exponents is \"%28399%28400%29%29%2F2\" = 79800,
\n" ); document.write( "

\n" ); document.write( "making the answer \"2%5E79800\"
\n" ); document.write( "

\n" ); document.write( "I'll come back to the last one. I haven't time just now.
\n" ); document.write( "

\n" ); document.write( "Edwin
\n" ); document.write( "
\n" );