Been working on this for 2 days and have gotten no where. Maybe someone out there can show me the light(adsbygoogle = window.adsbygoogle || []).push({});

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 divides x.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Set Theory: Pigeon hole

Loading...

Similar Threads - Theory Pigeon hole | Date |
---|---|

I Countability of ℚ | Feb 12, 2018 |

A Is there a decidable set theory? | Feb 8, 2018 |

About the strategy of reducing the total suffering in a queue | Dec 28, 2017 |

B Empty domains and the vacuous truth | Dec 26, 2017 |

A question in combinatorics. (perhaps implementation of the pigeon hole principle). | Apr 28, 2007 |

**Physics Forums - The Fusion of Science and Community**