Let A and B be finite sets, and let f : A B be a function.

Question:

Let A and B be finite sets, and let f : A → B be a function. Show that

a. if f is injective, then |A| ≤ |B|;

b. if f is surjective, then |A| ≥ jBj.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  answer-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: