Let's look at two closely related problems:
You have 8 people, and want to divide them into 4 teams of 2. One team will go to the Olympics, one to Wimbledon, one to the US Open and one to Australia. Notice the teams are in order now. We then have 8C2 choices for the Olympic team, 6C2 choices for the Wimbledon team, 4C2 choices for the US Open, and 2C2 = 1 choice left for the Australia team. In total you have 8C2*6C2*4C2*2C2 choices of teams. We do not divide by 4! at the end, because the order of the teams matters.
Now, let's look at the problem posted above. How many ways can 8 people be divided into 4 teams of 2? Notice in this version of the question, the order of the teams is not important. This question is different from the Olympics/Wimbledon/US Open/Australia question. Why? If I have 8 people, A, B, C, D, E, F, G and H, and send them to different tennis tournaments, then this set of teams:
Olympics: {A, B}
Wimbledon: {C, D}
US Open: {E, F}
Australia: {G, H}
is different from this set:
Olympics: {C, D}
Wimbledon: {A, B}
US Open: {E, F}
Australia: {G, H}
because I have a different team going to the Olympics in each case.
But if I'm dividing people up into teams, and the order of the teams doesn't matter, then {A, B}, {C, D}, {E, F}, {G, H} is the same set of teams as {C, D}, {A, B], {E, F}, {G, H}. These answers are different when the order matters, but are the same when the order does not matter. Because the order of 4 teams doesn't matter, we can count by:
a) pretending the order does matter;
b) dividing by 4! (the number of ways to arrange 4 things in order) because the order of 4 things doesn't matter.
So the answer must be:
(8C2*6C2*4C2*2C2)/4!
which is equal to 105.