document.write( "Question 1122845: Each state of the 50 in the United States has two senators. In how many ways may
\n" );
document.write( "a majority be achieved in the U.S. Senate? Ignore the possibility of absence or
\n" );
document.write( "abstention. Assume that all senators are present and voting. \n" );
document.write( "
Algebra.Com's Answer #739026 by greenestamps(13200)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "Each senator can vote either of 2 ways. \n" ); document.write( "The number of different ways the 100 senators can vote is 2^100. \n" ); document.write( "That total number of ways, 2^100, is equal to \n" ); document.write( "100C0 + 100C1 + 100C2 + ... + 100C99 + 100C100 \n" ); document.write( "The only way not to get a majority (one way or the other) is if the vote is 50-50. The number of ways that can happen is 100C50. \n" ); document.write( "So the number of ways to get a majority (one way or the other) is then \n" ); document.write( "2^100 - 100C50 \n" ); document.write( "If you mean the number of ways of getting a majority \"yes\" votes, it is \n" ); document.write( "(2^100 - 100C50)/2 \n" ); document.write( " |