Free Essay

Combinations and Permutations.

In:

Submitted By sarah12112
Words 1778
Pages 8
Combinations and Permutations

What's the Difference?

In English we use the word "combination" loosely, without thinking if the order of things is important. In other words:

|[pic] |"My fruit salad is a combination of apples, grapes and bananas" We don't care what order the fruits are in, they could also be |
| |"bananas, grapes and apples" or "grapes, apples and bananas", its the same fruit salad. |
| | |
|[pic] |"The combination to the safe was 472". Now we do care about the order. "724" would not work, nor would "247". It has to be |
| |exactly 4-7-2. |

So, in Mathematics we use more precise language:

|[pic] |If the order doesn't matter, it is a Combination. |
|[pic] |If the order does matter it is a Permutation. |

| |[pic] |So, we should really call this a "Permutation Lock"! |

In other words:

A Permutation is an ordered Combination.

|[pic] |To help you to remember, think "Permutation ... Position" |

Permutations

There are basically two types of permutation:

1. Repetition is Allowed: such as the lock above. It could be "333". 2. No Repetition: for example the first three people in a running race. You can't be first and second.

1. Permutations with Repetition

These are the easiest to calculate.

When you have n things to choose from ... you have n choices each time!

When choosing r of them, the permutations are:

n × n × ... (r times)

(In other words, there are n possibilities for the first choice, THEN there are n possibilites for the second choice, and so on, multplying each time.)

Which is easier to write down using an exponent of r:

n × n × ... (r times) = nr

Example: in the lock above, there are 10 numbers to choose from (0,1,..9) and you choose 3 of them: 10 × 10 × ... (3 times) = 103 = 1,000 permutations

So, the formula is simply:

|nr |
|where n is the number of things to choose from, and you |
|choose r of them |
|(Repetition allowed, order matters) |

2. Permutations without Repetition

In this case, you have to reduce the number of available choices each time.

|[pic] |For example, what order could 16 pool balls be in? |
| |After choosing, say, number "14" you can't choose it again. |

So, your first choice would have 16 possibilites, and your next choice would then have 15 possibilities, then 14, 13, etc. And the total permutations would be:

16 × 15 × 14 × 13 × ... = 20,922,789,888,000

But maybe you don't want to choose them all, just 3 of them, so that would be only:

16 × 15 × 14 = 3,360

In other words, there are 3,360 different ways that 3 pool balls could be selected out of 16 balls.

But how do we write that mathematically? Answer: we use the "factorial function"

|[pic] |The factorial function (symbol: !) just means to multiply a series of descending natural numbers.|
| |Examples: |
| |4! = 4 × 3 × 2 × 1 = 24 |
| |7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 = 5,040 |
| |1! = 1 |
|Note: it is generally agreed that 0! = 1. It may seem funny that multiplying no numbers together gets you 1, but |
|it helps simplify a lot of equations. |

So, if you wanted to select all of the billiard balls the permutations would be:

16! = 20,922,789,888,000

But if you wanted to select just 3, then you have to stop the multiplying after 14. How do you do that? There is a neat trick ... you divide by 13! ...

|16 × 15 × 14 × 13 × 12 ... | |= 16 × 15 × 14 = 3,360 |
| | | |
|13 × 12 ... | | |

Do you see? 16! / 13! = 16 × 15 × 14

The formula is written:

|[pic] |
|where n is the number of things to choose from, and you |
|choose r of them |
|(No repetition, order matters) |

Examples:

Our "order of 3 out of 16 pool balls example" would be:

|16! |= |16! |= |20,922,789,888,000 |= 3,360 |
| | | | | | |
|(16-3)! | |13! | |6,227,020,800 | |

(which is just the same as: 16 × 15 × 14 = 3,360)

How many ways can first and second place be awarded to 10 people?

|10! |= |10! |= |3,628,800 |= 90 |
| | | | | | |
|(10-2)! | |8! | |40,320 | |

(which is just the same as: 10 × 9 = 90)

Notation

Instead of writing the whole formula, people use different notations such as these:

[pic]

Example: P(10,2) = 90

Combinations

There are also two types of combinations (remember the order does not matter now):

1. Repetition is Allowed: such as coins in your pocket (5,5,5,10,10) 2. No Repetition: such as lottery numbers (2,14,15,27,30,33)

1. Combinations with Repetition

Actually, these are the hardest to explain, so I will come back to this later.

2. Combinations without Repetition

This is how lotteries work. The numbers are drawn one at a time, and if you have the lucky numbers (no matter what order) you win!

The easiest way to explain it is to:

• assume that the order does matter (ie permutations), • then alter it so the order does not matter.

Going back to our pool ball example, let us say that you just want to know which 3 pool balls were chosen, not the order.

We already know that 3 out of 16 gave us 3,360 permutations.

But many of those will be the same to us now, because we don't care what order!

For example, let us say balls 1, 2 and 3 were chosen. These are the possibilites:

|Order does matter |Order doesn't matter |
|1 2 3 |1 2 3 |
|1 3 2 | |
|2 1 3 | |
|2 3 1 | |
|3 1 2 | |
|3 2 1 | |

So, the permutations will have 6 times as many possibilites.

In fact there is an easy way to work out how many ways "1 2 3" could be placed in order, and we have already talked about it. The answer is:

3! = 3 × 2 × 1 = 6

(Another example: 4 things can be placed in 4! = 4 × 3 × 2 × 1 = 24 different ways, try it for yourself!)

So, all we need to do is adjust our permutations formula to reduce it by how many ways the objects could be in order (because we aren't interested in the order any more):

[pic]

That formula is so important it is often just written in big parentheses like this:

|[pic] |
|where n is the number of things to choose from, and you |
|choose r of them |
|(No repetition, order doesn't matter) |

It is often called "n choose r" (such as "16 choose 3")

And is also known as the "Binomial Coefficient"

Notation

As well as the "big parentheses", people also use these notations:

[pic]

Example

So, our pool ball example (now without order) is:

|16! |= |16! |= |20,922,789,888,000 |= 560 |
| | | | | | |
|3!(16-3)! | |3!×13! | |6×6,227,020,800 | |

Or you could do it this way:

|16×15×14 |= |3360 |= 560 |
| | | | |
|3×2×1 | |6 | |

So remember, do the permutation, then reduce by a further "r!"

... or better still ...

Remember the Formula!

It is interesting to also note how this formula is nice and symmetrical:

[pic]

In other words choosing 3 balls out of 16, or choosing 13 balls out of 16 have the same number of combinations.

|16! |= |16! |= |16! |= 560 |
| | | | | | |
|3!(16-3)! | |13!(16-13)! | |3!×13! | |

Pascal's Triangle

You can also use Pascal's Triangle to find the values. Go down to row "n" (the top row is 0), and then along "r" places and the value there is your answer. Here is an extract showing row 16:

1 14 91 364 ...

1 15 105 455 1365 ...

1 16 120 560 1820 4368 ...

1. Combinations with Repetition

OK, now we can tackle this one ...

|[pic] |Let us say there are five flavors of icecream: banana, chocolate, lemon, strawberry and vanilla. You can have three |
| |scoops. How many variations will there be? |
| |Let's use letters for the flavors: {b, c, l, s, v}. Example selections would be |
| |{c, c, c} (3 scoops of chocolate) |
| |{b, l, v} (one each of banana, lemon and vanilla) |
| |{b, v, v} (one of banana, two of vanilla) |

(And just to be clear: There are n=5 things to choose from, and you choose r=3 of them.
Order does not matter, and you can repeat!)

Now, I can't describe directly to you how to calculate this, but I can show you a special technique that lets you work it out.

|[pic] |Think about the ice cream being in boxes, you could say "move past the first box, then take 3 |
| |scoops, then move along 3 more boxes to the end" and you will have 3 scoops of chocolate! |
| |So, it is like you are ordering a robot to get your ice cream, but it doesn't change anything, |
| |you still get what you want. |

Now you could write this down as [pic] (arrow means move, circle means scoop).

In fact the three examples above would be written like this:

|{c, c, c} (3 scoops of chocolate): |[pic] |
|{b, l, v} (one each of banana, lemon and vanilla): |[pic] |
|{b, v, v} (one of banana, two of vanilla): |[pic] |

OK, so instead of worrying about different flavors, we have a simpler problem to solve: "how many different ways can you arrange arrows and circles"

Notice that there are always 3 circles (3 scoops of ice cream) and 4 arrows (you need to move 4 times to go from the 1st to 5th container).

So (being general here) there are r + (n-1) positions, and we want to choose r of them to have circles.

This is like saying "we have r + (n-1) pool balls and want to choose r of them". In other words it is now like the pool balls problem, but with slightly changed numbers. And you would write it like this:

|[pic] |
|where n is the number of things to choose from, and you |
|choose r of them |
|(Repetition allowed, order doesn't matter) |

Interestingly, we could have looked at the arrows instead of the circles, and we would have then been saying "we have r + (n-1) positions and want to choose (n-1) of them to have arrows", and the answer would be the same ...

[pic]

So, what about our example, what is the answer?

|(5+3-1)! |= |7! |= |5040 |= 35 |
| | | | | | |
|3!(5-1)! | |3!×4! | |6×24 | |

In Conclusion

Phew, that was a lot to absorb, so maybe you could read it again to be sure!

But knowing how these formulas work is only half the battle. Figuring out how to interpret a real world situation can be quite hard.

But at least now you know how to calculate all 4 variations of "Order does/does not matter" and "Repeats are/are not allowed".

Similar Documents

Free Essay

Combinations and Permutations.

...Combinations and Permutations What's the Difference? In English we use the word "combination" loosely, without thinking if the order of things is important. In other words: |[pic] |"My fruit salad is a combination of apples, grapes and bananas" We don't care what order the fruits are in, they could also be | | |"bananas, grapes and apples" or "grapes, apples and bananas", its the same fruit salad. | |  |  | |[pic] |"The combination to the safe was 472". Now we do care about the order. "724" would not work, nor would "247". It has to be | | |exactly 4-7-2. | So, in Mathematics we use more precise language: |[pic] |If the order doesn't matter, it is a Combination. | |[pic] |If the order does matter it is a Permutation. | |  |[pic] |So, we should really call this a "Permutation Lock"! | In other words: A Permutation is an ordered Combination. |[pic] |To help you to remember...

Words: 1778 - Pages: 8

Free Essay

Reflection of Life

...Factorials, Permutations and Combinations Factorials A factorial is represented by the sign (!). When we encounter n! (known as 'n factorial') we say that a factorial is the product of all the whole numbers between 1 and n, where n must always be positive. For example 0! is a special case factorial. This is special because there are no positive numbers less than zero and we defined a factorial as a product of the numbers between n and 1. We say that 0! = 1 by claiming that the product of no numbers is 1. The reasoning and mathematics behind this is complicated and beyond the scope of this page, so let's just accept 0! as equal to 1. This works out to be mathematically true and allows us to redefine n! as follows: For example The above allows us to manipulate factorials and break them up, which is useful in combinations and permutations. Useful Factorial Properties The last two properties are important to remember. The factorial sign DOES NOT distribute across addition and subtraction. Permutations and Combinations Permutations and Combinations in mathematics both refer to different ways of arranging a given set of variables. Permutations are not strict when it comes to the order of things while Combinations are. For example; given the letters abc The Permutations are listed as follows Combinations on the other hand are considered different, all the above are considered the same since they have the exact same letters only arranged different. In other words, in combination, you can't...

Words: 895 - Pages: 4

Free Essay

Anna

...Page |1 PERMUTATIONS and COMBINATIONS If the order doesn't matter, it is a Combination. If the order does matter it is a Permutation. PRACTICE! Determine whether each of the following situations is a Combination or Permutation. 1. Creating an access code for a computer site using any 8 alphabet letters. 2. Determining how many different ways you can elect a Chairman and Co-Chairman of a committee if you have 10 people to choose from. 3. Voting to allow 10 new members to join a club when there are 25 that would like to join. 4. Finding different ways to arrange a line-up for batters on a baseball team. 5. Choosing 3 toppings for a pizza if there are 9 choices. Answers: 1. P 2. P 3. C 4. P 5. C Page |2 Combinations: Suppose that you can invite 3 friends to go with you to a concert. If you choose Jay, Ted, and Ken, then this is no different from choosing Ted, Ken, and Jay. The order that you choose the three names of your friends is not important. Hence, this is a Combination problem. Example Problem for Combination: Suppose that you can invite 3 friends to go with you to a concert. You have 5 friends that want to go, so you decide to write the 5 names on slips of paper and place them in a bowl. Then you randomly choose 3 names from the bowl. If the five people are Jay, Ted, Cal, Bob, and Ken, then write down all the possible ways that you could choose a group of 3 people. Here are all of the possible combinations of 3: Jay, Ted, Cal Jay, Ted, Bob Jay, Ted, Ken Jay, Cal...

Words: 1148 - Pages: 5

Premium Essay

Math 221 Discussion Question

...enumeration methods; sum rule, product rule, permutations, combinations along with enumeration methods for indistinguishable objects, how can we devise a strategy to solve problems requiring these methods? A basic concept in the branch of the theory of algorithms called enumeration theory, which investigates general properties of classes of objects numbered by arbitrary constructive objects (cf. Constructive object). Most often, natural numbers appear in the role of the constructive objects that serve as numbers of the elements of the classes in question ("Enumeration", 2013). The Sum/Difference Rules refer to the derivative of the sum of two functions is the sum of the derivatives of the two functions ("Basic Derivative Rules", 2013). The product rule is one of several rules used to find the derivative of a function. Specifically, it is used to find the derivative of the product of two functions. It is also called Leibnitz's Law, and it states that for two functions f and g their derivative (in Leibnitz notation, ). The derivative of f times g is not equal to the derivative of f times the derivative of g: .The product rule can be used with multiple functions and is used to derive the power rule. The product rule can also be applied to dot products and cross products of vector functions. The Leibnitz Identity, a generalization of the product rule, can be applied to find higher-order derivatives ("Definition Of Product Rule", 2013). A permutation in mathematics is one of several ways...

Words: 652 - Pages: 3

Free Essay

Internet Addiction

...permutation In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values. Informally, a permutation of a set of objects is an arrangement of those objects into a particular order. For example, there are six permutations of the set {1,2,3}, namely (1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), and (3,2,1). One might define an anagram of a word as a permutation of its letters. The study of permutations in this sense generally belongs to the field of combinatorics. The number of permutations of n distinct objects is n×(n − 1)×(n − 2)×...×2×1, which number is called "n factorial" and written "n!". Permutations occur, in more or less prominent ways, in almost every domain of mathematics. They often arise when different orderings on certain finite sets are considered, possibly only because one wants to ignore such orderings and needs to know how many configurations are thus identified. For similar reasons permutations arise in the study of sorting algorithms in computer science. In algebra and particularly in group theory, a permutation of a set S is defined as a bijection from S to itself (i.e., a map S → S for which every element of S occurs exactly once as image value). This is related to the rearrangement of S in which each element s takes the place of the corresponding f(s). The collection of such permutations form a symmetric group. The key to its structure is the possibility...

Words: 440 - Pages: 2

Free Essay

Super

... Report page Share Share this 6.3 Probabilities Using Counting TechniquesThis is a featured page In a number of different situations, it is not easy to determine the outcomes of an event by counting them individually. Alternatively, counting techniques that involve permutations and combinations are helpful when calculating theoretical probabilities. This section will examine methods for determining theoretical probabilities of successive or multiple events. Permutation? or Combination? The following flow chart will help determine which formula is suitable for any given question. By simply following a series of "yes" or "no" questions, the appropriate formula can be determined. Flow Ex. 1 - Using Permutations: 6.3 Probabilities Using Counting Techniques - MDM4U1@FMG 6.3 Probabilities Using Counting Techniques - MDM4U1@FMG The specific outcome of Mike starting in lane 1 and the other two starting in lane 2 and lane 3 can only happen one way, so n(A) = 1. Therefore, 6.3 Probabilities Using Counting Techniques - MDM4U1@FMG The probability that Mike will start in the first lane next to his other brothers in lane 2 and 3 is approximately 0.00101. Ex. 1(a) - Using Permutations: Exactly Three People form a line at a grocery store. What is the probability that they will line up in descending order of age? (I.e. oldest, middle and youngest) →Solution using the blank like method: n(A): # of ways they will line up in descending order of age, thus: ...

Words: 1110 - Pages: 5

Free Essay

Applications and Examples of Integration and Expository Method

... The teacher will set up a debate as to who really invented Calculus. b. An essay quiz regarding the topic. Integration Method Integration is the process of unifying the child’s mental, physical, socio-emotional and spiritual energies through learning experience. Emphasis is placed on the development of integrated personality of the child. Learning activities are organized in terms of larger units. The teacher must also know her pupil’s like and dislikes. The child’s nature and experience must be made the starting points in planning and organizing school programs. Steps of the Integration Method. Subject: Probability Topic: Permutations and combinations 1. Introduction of the unit. Start off by explaining the objectives. After that, the teacher will present a pre-test about permutation that should be answered before the class ends. The teacher should correlate the lesson to the past lessons...

Words: 463 - Pages: 2

Free Essay

The Basic Counting Principle-Statistic for Management Notes

... Here n is 3, r is 2 For principle of counting we must have same number of options. In above if S3 and T2 is not allowed, principle of counting doesn’t work If n=5 and r=3 {A,B,C,D,E} How many different ways can we arrange of taking 3 letters at a time? 5 *4*3= 60 ways This is permutation of n different thing taken r at a time 60=(5*4*3*2*1)/(2*1) = 5!/2!=5!(5-3)!=n!/(n-r)! We are talking about linear arrangement not the circular one here nPr= filling r places by n different thing n=5 {A,B,C,D,E} r=3 {A,B,C}, {A,B,D}, {A,C,D}, {A,C,E}………….. [Note: Arrangement is related to permutation. If we are considered about place or position it is permutation question. Selecting is related to permutation. If we are not considered about place or position it is combination question.] nCr, C(n,r)= n!/[(n-r)!r!] n=5 {A,B,C,D,E} r=3 {A,B,C}, {A,B,D}, {A,B,E}, {A,C,D}, {A,C,E},{A,D,E}, {B,C,D},{B,C,E} 3 are selected out of 5 . Above are possible combinations. Permutation: {A,B,C} and {A,C,B} are different because here, in {A,B,C} second place we have B but in {A,C,B} second place we have C Combination: {A,B,C} and {A,C,B} are same because in both of them letters A,B,C are selected....

Words: 399 - Pages: 2

Free Essay

Gmat

...Probability and Combinations Questions With Explanations Collected by Bunuel Solutions by Bunuel gmatclub.com 1. Mary and Joe are to throw three dice each. The score is the sum of points on all three dice. If Mary scores 10 in her attempt what is the probability that Joe will outscore Mary in his? A. 24/64 B. 32/64 C. 36/64 D. 40/64 E. 42/64 Expected value of a roll of one dice is 1/6(1+2+3+4+5+6)=3.5. Expected value of three dices is 3*3.5=10.5. Mary scored 10 so the probability to have more then 10, or more then average is the same as to have less than average=1/2. P=1/2. Answer: B. Discussed at: http://gmatclub.com/forum/mother-mary-comes-to-me-86407.html 2. Denise is trying to open a safe whose combination she does not know. IF the safe has 4000 possible combinations, and she can try 75 different possibilities, what is the probability that she does not pick the one correct combination. A. 1 B. 159/160 C. 157/160 D. 3/160 E. 0 When trying the first time the probability Denise doesn't pick the correct combination=3999/4000 Second time, as the total number of possible combinations reduced by one, not picking the right one would be 3998/3999. Third time 3997/3998 ... And the same 75 times. So we get: [pic] every denominator but the first will cancel out and every nominator but the last will cancel out as well. We'll get 3925/4000=157/160. Answer: C. Discussed at: http://gmatclub.com/forum/4000-possible-combination-84435.html ...

Words: 7620 - Pages: 31

Premium Essay

Combinations Without Repetition In Research

...Combinations without repetition is used to explain how lotteries work. The numbers are drawn one at a time and if one has the lucky numbers, no matter in what order, they win. This can be understood by assuming the order does matter, such as permutation and consequently alter it so the order no longer matters. An example of this is when we go to back to trying to find which 3 options of soccer players were chosen and not the order. We already know when 3 players are chosen out of 10 options of players, this gives us 720 permutations, however many of these are now reduced since the order no longer matters. If for example our 3 values were 3 - 2 - 1, then our possibilities would be reduced as follows. Order does Matter Order...

Words: 280 - Pages: 2

Premium Essay

Statistics Summary

...Statistics Chapter 2 Methods for Describing Sets of Data Quantitative data is information about quantities; that is, information that can be measured and written down with numbers. Qualitative data is information about qualities; information that can't actually be measured. A class is one of the categories into which qualitative data can be classified. The class frequency is the number of observations in the data set that fall into a particular class. The class relative frequency is the class frequency divided by the total number of observations in the data set; that is, class relative frequency = (class frequency) / n. The class percentage is the class relative frequency multiplied by 100; that is, class percentage = (class relative frequency) x 100. Summary of Graphical Descriptive Methods for Qualitative Data Bar Graph: The categories (classes) of the qualitative variable are represented by bars, where the height of each bar is either the class frequency, the class relative frequency, or the class percentage. Pie Chart: The categories (classes) of the qualitative variable are represented by slices of a pie (circle). The size of each slice is proportional to the class relative frequency. Pareto Diagram: A bar graph with the categories (classes) of the qualitative variable (i.e. the bars) arranged by height in descending order from left to right. Summary of Graphical Descriptive Methods for Quantitative Data Dot Plot: The numerical value of each quantitative...

Words: 2367 - Pages: 10

Premium Essay

Harley Davidson Mini Case

...With all of the various different styles and options that Harley Davidson offers, there are >500,000 combinations for a single motorcycle. Large companies like this can support such a large infrastructure for offering so many combinations while smaller plants may not be able to accommodate so many permutations. If a smaller business offered a smaller portfolio with a single bike and options that contained 2 handle bars, 3 luggage bags, and 4 exhaust pipe configurations, there would be a total of 24 permutations which would be easier to accommodate than the larger offering that a company like HD can provide. There are various places in the production chain where a motorcycle can be customized and this customization is currently taking place at the dealership. If HD decided to perform the work at their factories instead of the dealership, there would be pros and cons for the HD firm, the dealers, and the customers. For the HD firm the pros would be faster turnaround for customer purchase and a better guarantee that the customer would purchase any extra options. The cons would be the inability to develop a solid relationship with the customer and a sales representative. With the dealers, the pros would be a quick turnaround as well where buyers would only come in to pick up their custom motorcycles meaning the dealers would be able to keep a lower staff and less of an operation reducing overhead costs. The cons would be no relationship with customers and reduced customer loyalty...

Words: 300 - Pages: 2

Premium Essay

Berlin Wall

...roots and coefficients, formation of quadratic equations with given roots, symmetric functions of roots. Arithmetic, geometric and harmonic progressions, arithmetic, geometric and harmonic means, sums of finite arithmetic and geometric progressions, infinite geometric series, sums of squares and cubes of the first n natural numbers. Logarithms and their properties. Permutations and combinations, Binomial theorem for a positive integral index, properties of binomial coefficients. Matrices as a rectangular array of real numbers, equality of matrices, addition, multiplication by a scalar and product of matrices, transpose of a matrix, determinant of a square matrix of order up to three, inverse of a square matrix of order up to three, properties of these matrix operations, diagonal, symmetric and skew-symmetric matrices and their properties, solutions of simultaneous linear equations in two or three variables. Addition and multiplication rules of probability, conditional probability, Bayes Theorem, independence of events, computation of probability of events using permutations and combinations. Trigonometry: Trigonometric functions, their periodicity and graphs, addition and subtraction formulae, formulae involving multiple and sub-multiple angles, general solution of trigonometric equations. Relations between sides and angles of a triangle, sine rule, cosine rule, half-angle formula and the area of a triangle, inverse trigonometric functions (principal value...

Words: 631 - Pages: 3

Free Essay

Java

...1 | ELEMENTS OF PROGRAMMING | DATA | 1.1.1 | HelloWorld.java | Hello, World | – | 1.1.2 | UseArgument.java | using a command-line argument | – | 1.2.1 | Ruler.java | string concatenation example | – | 1.2.2 | IntOps.java | integer multiplication and division | – | 1.2.3 | Quadratic.java | quadratic formula | – | 1.2.4 | LeapYear.java | leap year | – | 1.2.5 | RandomInt.java | casting to get a random integer | – | 1.3.1 | Flip.java | flippling a fair coin | – | 1.3.2 | TenHellos.java | your first while loop | – | 1.3.3 | PowersOfTwo.java | computing powers of two | – | 1.3.4 | DivisorPattern.java | your first nested loops | – | 1.3.5 | Harmonic.java | harmonic numbers | – | 1.3.6 | Sqrt.java | Newton's method | – | 1.3.7 | Binary.java | converting to binary | – | 1.3.8 | Gambler.java | gambler's ruin simulation | – | 1.3.9 | Factors.java | factoring integers | – | 1.4.1 | Sample.java | sampling without replacement | – | 1.4.2 | CouponCollector.java | coupon collector simulation | – | 1.4.3 | PrimeSieve.java | sieve of Eratosthenes | – | 1.4.4 | SelfAvoidingWalk.java | self-avoiding random walks | – | 1.5.1 | RandomSeq.java | generating a random sequence | – | 1.5.2 | TwentyQuestions.java | interactive user input | – | 1.5.3 | Average.java | averaging a stream of numbers | – | 1.5.4 | RangeFilter.java | a simple filter | – | 1.5.5 | PlotFilter.java | input-to-drawing filter | USA.txt   | 1.5.6 | BouncingBall.java | bouncing ball...

Words: 1619 - Pages: 7

Premium Essay

Nt1310 Unit 6 Certificate Authority

...a parity bit that checks for odd parity. These bits are then changed so that there are odd number of ones in the octet. Only the 56 bits of the key are actually used for the encryption excluding the parity bits. It undergoes 16 steps of operation to create the ciphertext. These steps are known as rounds and has functions like permutations, combinations and substitutions. During the encryption process, care taken to see if these rounds can be carried out even during the decryption process. Even though DES is used widely, it is succeeded by AES for more additional complexity. AES AES is Advanced Encryption Standard. It is the successor to DES and is also a symmetric-key algorithm. It uses 128bits block size and has three different key sizes - 128, 192 and 256 bits. It uses a combination of substitution and permutation. The number for rounds in case of AES depends on the key size. If the key size is 128 bits, it has 10 rounds, if the size is 196 bits, the number of rounds is 12 and if the key size is 256 bits, it has 14 rounds of operation. All the rounds are identical excluding the last round. Each round has a substitution for a single byte, permutation of the rows, mixing operation of the columns and round-key addition. For the process the bits are considering as a 4*4 matrix with bytes. This matrix is known as the state array. All the operations are performed on the input state array which produces the output state array. AES can also be implemented using software due to the...

Words: 1504 - Pages: 7