CPhill

avatar
BenutzernameCPhill
Punkte129896
Membership
Stats
Fragen 56
Antworten 43181

 #2
avatar+129896 
+5

Re: what is a combination

It represents the number of sets (or subsets) that we can form by selecting "r" things from "n" things. Here's an example...let's suppose we have a set of 3 objects labeled "A," "B,"  and "C."

Note that I can "choose" all three obejcts to form one set, namely, {A,B,C} The braces denote that we're talking about a set of things.

Or, I could choose any two of the objects. This would give us {A,B}, {A.C} and {B,C}.....note that the "order" of things in the set doesn't matter in combinations.

Or, I could choose  any one of the objects from the three...this gives us {A}, {B}, {C}.

There is one more way to form a "set" of these objects......this may seem strange....DON"T CHOOSE ANY OF THEM!!! This is known as the "empty" set and is just denoted as { } or as Ø.

Note the number of sets we've formed  = 2^(n things) = 2^(3) = 8.

Since it's cumbersome to try and figure how many sets can be formed by selecting some number of objects from a large number of them, we have a "formula" to do that.

It's denoted by C(n,r) or nCr.......both things are used......and it tells us how many sets can be formed by choosing 'r" things from "n" things. Note that n is always greater than or equal to r....That makes sense.....I couldn't choose 6 things from just 3 !!!!

The "formula" is.... (n!) / [(n-r)! (r!)].......where  "r" is the number of objects chosen from "n" things.

The " ! " is known as a "factorial" or just "factorial."

I'll spare you the "fancy" definition of this, but it's really just the product of "n" (or "r") and all the positive integers less than "n' or "r." For example, if "n'  (or "r') = 3, then 3! =  3 x 2 X 1 = 6.   (Note a "special case"..... 0! = 1)

So, looking at our example, let's suppose that we wanted  to know how many sets we could form by choosing 2 things from 3. By the "formula," we have  C(3,2) =

(3!) / [(3-2)! (2!)]     =  ( 3!) /  (1)! (2!)  =   (3X2x1) / [(1) * (2X1)]   =   6/2 =   3  .....which is exactly what we found!!

Combinations are used extensively in statistics and probability. Another thing that is sometimes encountered is the "permutation." It, unlike the combination, DOES take into account "order" within sets. Thus, in a permutation, {A,B} ≠ {B,A}    In general, the "permute" of something is usually greater than a "combination" of that something....but not always!!!

I hope this helps.....

18.04.2014
 #3
avatar+129896 
0

Not to beat this question to death....(maybe Rom and I already have!!!)...but here's something you might want to look at......

Here's a "formula" to calculate the side length (s) of an "2^n-sided" regular polygon inscribed in a circle with a radius of "1."

(Really, the radius length doesn't matter....all circles are "similar." I've just chosen "1" because it's convenient!! By using a "scaling factor," we could show the same  proof for a circle of any radius!!!)

s = (sin(360/2^n)/sin((180-(360/2^n))/2),

where the (2^n) represents the number of sides of the polygon. Note something interesting.....as "n" increases, s "decreases." (Try it for yourself using the on-site calculator!!)

Notice something else.....If you take the output for any particular "s" and multiply it back by (2^n), you will get the perimeter of the polygon. You will also find that, as n increases, this perimeter approaches 2pi (r), when r = 1.

For example, let n be "8." Then the number of sides = 2^8 = 256. And calculating the length of one side of this 256 sided polygon gives us......0.0245430765715311. Now, multiplying this by 256, we get the polygon's perimeter.......6.2830276023119616.......which is > 99.99% of 2*(pi)* (r) , where r = 1.

So, it appears that, as the sides increase to some "large number," the perimeter of the 2^n-sided polygon approaches the perimeter of the circle !!!

If, from the center of the circle, we draw a radial line (r) to each vertex of the polygon, we will form "2^n" triangles............ We can also show that, as the number of sides of the polygon increases to some "large number," the height of each triangle aproaches "r" (the radius of the circle ).

And there's a "formula" to calculate the height of each such triangle....To see how this is dervived, note, that in each triangle, we can draw a line from the"apex" of the triangle such that it interesects the side of the polygon at right angles.... (this is the height, (h), of the triangle). And by the Law of Sines, we have

r /sin (90) = h /sin((180-(360/2^n))/2).......the angle represented by (180-(360/2^n))/2) is just the angle formed by a radial line and the side of the polygon. Note that r =1 and sin(90) = 1. Therefore, the height of the triangle, (h), is just = sin((180-(360/2^n))/2)

As before, let n be = 8. (This, again, represents  a polygon with 256 sides.)

Putting this into the on-site calculator, we get....  (.999924701839). Note how close this is to the radius (1)!!!  Letting n = 10, (a polygon with 1024 sides), we have,  h = .99999529381......even closer to the radius of the circle !!

Putting this all together......by inscribing some "2^n-sided" polygon in a circle (where 2^n is "large"), and drawing radial lines to each vertex of the polygon, we form "2^n" triangles. Each triangle will have a side length of "s" and a height of "h."  Then, the area of each such triangle will be (1/2) * (s) * (h). And multiplying the number of triangles we have, (2^n), by the area of each, we get the area of the polygon .... (2^n)* (1/2) * (s) * (h)   =   (1/2) * (2^n) * (s) * (h) . But note, (2^n) * s equals the perimeter of the polygon which ≈ 2(pi)(r). And h ≈ r..... (as we've shown).

So, the area of the polygon =  (1/2) * 2(pi)(r) * (r)   =     pi * r^2.  (For all practical purposes.)

18.04.2014