Recent content by houseurmusic

  1. H

    Proving Pigeonhole Principle in Set Theory

    That was helpful, thank you. The way I approached the problem and I am not sure if this is correct... I split U into 2 subsets. An even subset and an odd subset. I said that set P must contain at least 1 element from the even set by the pigeon hole principle. I also used these to facts...
  2. H

    Proving Pigeonhole Principle in Set Theory

    Been working on this for 2 days and have gotten no where. Maybe someone out there can show me the light U = {1, 2, 3, ... , n, ..., 2n} for some natural number n Let P be a subset of U such that |P| = n + 1 show that there exists x, y in P where x not equal y such that x divides y or y...
Back
Top