Here's the question you clicked on:
ideed
How many equivalence relations are there in a set of n elements...?
Have you learned much about set partitions?
i think this is not easy it is identical to asking how many partitions there are. maybe i am mistaken, but i don't think this has an obvious answer
a quick google search finds these are bell numbers https://oeis.org/A000110
or scroll down to "counting possible partitions" here http://en.wikipedia.org/wiki/Equivalence_relation
It's actually rather straightforward to figure this out. You can make a bijection between the set of set partitions and the set of equivalence relations on a set of n elements by equating partitions to equivalence classes.
To prove this is actually a bijection, just notice that it has an easy inverse (either way you go, just relabel set partitions as equivalence classes and vice versa). Thus, since it has an inverse, it must be bijective.
ok, but how do you count them?
Well, that's a different story.