Results 1 to 2 of 2

Math Help - counting principles

  1. #1
    Newbie
    Joined
    Apr 2007
    Posts
    5

    counting principles

    Let S be a set of n integers. Prove that S has a nonempty subset whose sum is divisble by n. Show that this is best possible by exhibiting a set of n-1 integers that has no nonempty subset whose sum is divisible by n.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,605
    Thanks
    1573
    Awards
    1
    Here is a proof.
    Attached Thumbnails Attached Thumbnails counting principles-set_s.gif  
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Basic Counting Principles
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 11th 2011, 06:18 PM
  2. Counting Principles
    Posted in the Discrete Math Forum
    Replies: 6
    Last Post: May 23rd 2010, 12:18 AM
  3. Fundamental Counting Principles
    Posted in the Discrete Math Forum
    Replies: 10
    Last Post: January 12th 2010, 07:26 AM
  4. [SOLVED] Counting principles
    Posted in the Statistics Forum
    Replies: 2
    Last Post: April 3rd 2009, 02:13 PM
  5. Counting Principles
    Posted in the Statistics Forum
    Replies: 3
    Last Post: April 2nd 2008, 08:23 PM

Search Tags


/mathhelpforum @mathhelpforum