what is a combinations, permuations, and factorial?
109803
Combinations are basically what you do when order doesn't matter.For example, electing any 12 students to a group of 3. It would be 12 C 3.\n\n\nPermutations are what u do when order DOES mattter. For example, when your arranging 6 different books. The answer to it would be 6 x 5 x 4 x 3 x 2 x 1 = 720 different ways.\n\nFactorials are basically. The number you have multiplied by everything less than that number.For instance, if you have 3. The factorial notation would be 3 x 2 x 1 = 6
956461
factors of 24\n1, 2, 3, 4, 6, 8, 12, 24
1163164
Permutation means the arrangement and order of things, and is used if the order is considered. Combination refers to a slection of things in which the order of things doesn't matter.\n\nFor example, say we have to create a 3-digit number using the digits "4, 5, 6, 7". To form this number, the digits must be arranged. Different numbers will be formed depending on the order that we arrange the digits into. This is a permuation.\n\nFor a combination, say that we have to make a team of 11 players out of 20 players. It's a combination because the order of the players in the team doesn't matter. No matter what order we list the players, the team will stay the same. \n\nA permutation is written like this:         \nnPr = n!/(n-r)!\nNumber of permutations of (n) different things taken (r) at a time.\n\nFor example, how many different signals can be made by 4 flags from 7-flags of different colours? Number of ways taking 4 flags out of 7-flags  = 7P4.\n\n7P4 = 7!(7-4)!\n7 x 6 x 5 x 4 = 840\n\nA combination is written like this:\nnCr               \n3C2 = 3 x 2/2!\n8C3 = 8 x 7 x 6/3!\nYou put 'n' into a factorial like normal, but you only multiply 'r' number of digits down. For example, 5C3. 5! = 5 x 4 x 3 x 2 x 1. But since 'r' equals 3, you only go down the three numbers to make 5 x 4 x 3.\n\nFor example, how many different teams of 4 can you make out of 10 people? The number of ways of making teams of 4 with 10 people = 10C4\n\n10C4 = 10 x 9 x 8 x 7/4!\n10C4 = 10 x 9 x 8 x 7/4 x 3 x 2 x 1\n10C4 = 210\n\nHope this helps! This took a long time to write. :P
636772
k=1/4 or k=2 or many more possibilities
751280
multiplication\n\n\nDoug
44177
I'm sorry, but I don't think that you have actually asked a question here, or perhaps you have left off some very pertinent information. Unless you just wanted the above statement to be explained.\n\nIn this instance, the universe of discourse just means all the points contained in the set S = (p(x,y)), which is all the possible combinations of x = 1,2,3 and y = 1,2,3. For example, (1,3) and (2,2) and (3,1) would all be points contained in the universe of discourse for p(x,y).
515056
I will write them as ordered pairs.\n17: (1,17) and (-1,-17)\n-24: (-1,24), (1,-24), (2,-12), (-2,12), (3,-8), (-3,8), (4,-6), and (-4,6)\nNow try the other two.\nHint: 18 will have 6 factor pairs, and -18 will have 5 factor pairs.
665986
you multiply the number of teams by the number of games... 10 x 2 = 20 possible outcomes.\n\nThe different variations is the mutilples of all the options... for example, the number of sandwich combinations?&#92;Options, wheat, white or rye... (3)\nchedder or swiss cheese.... (2)\nham, turkey, or roast beef... (3)\n\nThere are 18 different sandwiches.  (3 x 2 x 3)
52089
Draw a factor tree:\n      100\n   /      &#92;\n  25      4\n/   &#92;   /  &#92;\n5   5  2   2\n\nFactorization is 2*2*5*5
747450
Sounds like Combinatorics.  Combinations, permutations, a bit of graph theory, discrete math, I usually describe it as "Advanced Counting".
18114
This is true only if the items are distinct. For example if the data set is the 26 letter alphabet and we take letters without replacement, then the number of permutations (order matters, so a,b is different from b,a) is 26*25 while the number of combinations (order does not matter, taking a, then b is the same as taking b, then a) is 26*25/2. \n\nIf our data set contains copies, like the letters in this sentence, then combinations of identical letters would not count doubly (so, a,a is not a seperate permutation from a,a).
959125
Brackets, Orders, Division, Multiplication, Addition, Subtraction.\nIn some countries its BEDMAS, where E is exponents.
549477
http://www.purplemath.com/modules/percntof.htm\n\nhope this helps you.
212528
It is?  Really?  Where?\n\nFactorials are important in combinatorics. They also turn up in calculus and are also used extensively in probability theory.  \n\nFactorials are often used as a simple example, along with Fibonacci numbers, when teaching recursion in computer science because they satisfy the following recursive relationship (if n ≥ 1).  They are also important in number theory. Among other properties, all factorials are highly abundant numbers.\n\nI could spend a year teaching the beauty of Fibonacci numbers alone!!!
587245
If you have n events where the number of outcomes for the first event is p1 and the number of outcomes for the second event is p2 and so on up to the nth event (pn), then the number of total ways the event can occur is\n\n(p1)(p2)(p3)...(pn).
1025267
Here is how:\n\n6+6+3\n6+5+4\n5+5+5\n\nnow change the first two around until you have all the possiblities.
1161271
In all these problems you are going to pick a set of objects or perform a set of actions.  \n\nIf the ordering of the outcomes makes a difference, then it's a permutation. If the ordering doesn't make a difference, then it's a combination.\n\nExample 1: The 10 runners run a race. They give medals for the first 3 places. How many different outcomes are there?\n\nThe order of finish makes a difference, since it determines who gets which medal, so it's a permutation problem.\n\nAnswer: 10x9x8 = 720\n\nExample 2: Three students are chosen from a class of 10 to clean after a food fight. How many ways can the group be chosen?\n\nIt doesn't matter who gets picked first, they all have to clean. Ordering doesn't make a difference, so it's a combination problem.\n\nAnswer: 10C3 = 10!/3!7! = 10x9x8/3x2x1 = 120.