Questions on Permutations.
Show older comments
The number of possible permutations nPr (combinations of letters in this problem) by taking r letters out of a total number of n letters is given by: nPr = n!/(n-r)! n! = n*(n-1)*(n-2).. but stops before n-n so the value of n! is never zero. This is called a factorial. Using this formula determine how many password combinations can be created from our 26 letter alphabet if each password has to be 7 letters long. Check out the built in function in MATLAB called factorial. For example to get 5! In MATLAB use: factorial(5).
1 Comment
Steven Lord
on 19 Oct 2020
This sounds like a homework assignment. If it is, show us the code you've written to try to solve the problem and ask a specific question about where you're having difficulty and we may be able to provide some guidance.
If you aren't sure where to start because you're not familiar with how to write MATLAB code, I suggest you start with the MATLAB Onramp tutorial (https://www.mathworks.com/support/learn-with-matlab-tutorials.html) to quickly learn the essentials of MATLAB.
If you aren't sure where to start because you're not familiar with the mathematics you'll need to solve the problem, I recommend asking your professor and/or teaching assistant for help.
Answers (0)
Categories
Find more on Startup and Shutdown in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!