Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

If $A = \{x \mid x \text{ is a letter of the word 'contrast'}\}$

Represent it in a Venn Diagram, and then find the $n(A)$.

Do I need to write the letter 't' twice inside the venn diagram? What should be the answer for $n(A)$?

share|cite|improve this question
Sets does not have repeated elements. n(A) equals 7. – Shashwat Oct 29 '12 at 13:14
up vote 4 down vote accepted

From wikipedia:

Every element of a set must be unique; no two members may be identical. A multiset is a generalized concept of a set that relaxes this criterion.

share|cite|improve this answer

No. Sets are collections where repetition and order are ignored.

Therefore in the word contrast we have the letters $\{\sf c,o,n,t,r,a,s\}$ and a simple observation tells us that there are exactly $7$ letters in this set.

share|cite|improve this answer
what about n(A)? – Fazlan Oct 29 '12 at 10:09
I don't know what that is. Is that "the number of elements in $A$"? – Asaf Karagila Oct 29 '12 at 10:10
yes.the number of elements in A. Should it be 7 or 8? – Fazlan Oct 29 '12 at 10:12
@Fazlan: It’s $7$. – Brian M. Scott Oct 29 '12 at 10:17
@BrianM.Scott Thank you. – Fazlan Oct 29 '12 at 10:19

The original question is simply ill-posed, since "letter" is ambiguous between letter-tokens and letter-types.

I'm doing the crossword. I ask you "What's an a eight letter word beginning with 'c' that means disparity?" Obviously here I mean to count letter-tokens. "Contrast" is an eight letter word in this crossword sense, as it contains eight letter-tokens though these happen to exemplify only seven different types of letter.

I challenge you: "Only use the first fifteen letters of the alphabet in your tweets today". Obviously here I'm talking about letter types. It is ok for you to tweet "Eeek. Killing me!" even though that contains many tokens of the same letter type.

Likewise talk about words is ambiguous between word-tokens or word-types. "How many words are there in Shakespeare?" could be asking how many word-tokens there are in the corpus, or how many word-types are there exemplified. (I think it is to C.S. Peirce we owe the type/token terminology for making the obvious distinction.)

share|cite|improve this answer
So you're saying that $A = \{x \mid x \text{ is a letter of the word 'contrast'}\}$ is ambiguous between $A = \{\text{'a'}, \text{'c'}, \text{'n'}, \text{'o'}, \text{'r'}, \text{'s'}, \text{'t'}\}$ and something along the lines of $A = \{\left(\text{'c'}, 1\right), \left(\text{'o'}, 2\right), \left(\text{'n'}, 3\right), \left(\text{'t'}, 4\right), \left(\text{'r'}, 5\right), \left(\text{'a'}, 6\right), \left(\text{'s'}, 7\right), \left(\text{'t'}, 8\right)\}$ (where a "letter" has both a type and a position)? – ruakh Oct 29 '12 at 14:56

In formal set theory, each element counts as one even though they may appear more than once, so that $\{1\}=\{1,1\}$. This is because if we let $A=\{1\}$ and $B=\{1,1\}$, then $x\in A \iff x\in B$, so that the two sets are equal by the very definition of equality of sets.

However, in elementary school texts treating sets in a more informal manner, the elements of a set are often taken to mean something else. For example, for the word contrast, its letters may be taken to be $c,o,n,t,r,a,s,t$ where there is the implicit supposition that one is dealing with $c,o,n,t_1,r,a,s,t_2$, so that the set actually has $8$ elements instead of $7$.

It all depends on the context and intention of the text.

share|cite|improve this answer

There is nothing here that requires any double counting. You simply take the alphabet, look at the letters one by one, and decide "Does this letter appear in the word 'contrast'?" If it does, then it's in $A$, if not, then it isn't.

At least that's how I interpret the question.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.