Mathematics - Algebraic Number Theory - Pigeonhole Principle
Not what you're looking for?
1a. If X and Y are infinite sets with the same number of elements, show that the following conditions are equivelent for a function f: X-->Y:
(i). f is injective
(ii). f is bijective
(iii) f is surjective
1b. Suppose there are 11 pigeons sitting in some pigeonhole. If there are only 10 pigeonholes prove that there is a hole containing more than one pigeon.
I just dont know where to begin with the proof and how to show this.
Purchase this Solution
Solution Summary
The expert examines algebraic number theory for the Pigeonhole Principle. A Complete, Neat and Step-by-step Solution is provided in the attached file.
Solution Preview
The solution file is attached.
Let us prove this by contradiction.
Let P be the set of pigeons and H be the set of holes.
Assume that every hole has at most one pigeon in it.
We define f: P ...
Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.