Show that if f is a function from S to T, where S and T are finite sets with |S|>|T|, then there are elements s1 and s2 in S such that f(s1)=f(s2), or in other words, f is not one-to-one. | Numerade

That language is a discrete combinatorial system means:Owe can take a finite number of words and make an infinite number of sentencesthe language can be taught and learnedthe same words can be combined in different ways to convey new meaningOsome words are used as function words and some as content words

Finite and Infinite Sets (Definition, Properties, and Examples)