Concept explainers
The following method can be used to generate a random permutation of a sequence of n terms. First, interchange the nth term and the r(n)th term where r(n) is a randomly selected integer with 1< r(n)< n. Next, interchange the (n - i)st term of the resulting sequence with its r(n - i)st term where r(n -1) is a randomly selected integer with 1< r(n -1)< n -1, Continue this process until j - n. where at the jth step you interchange the (n - j+i)st term of the resulting sequence with its r(n - j+i)st term, where r(n - j+1) is a randomly selected integer with 1< rfn - j -1)< n - j+1. Show that when this method is followed, each of the n! different permutations of the terms of the sequence is equally likely to be generated. [Hint: Use mathematical induction, assuming that the probability that each of the permutations of n -1 terms produced by this procedure for a sequence of n -1 terms is i/(n -1)!.]
Want to see the full answer?
Check out a sample textbook solutionChapter 7 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
- Calculate the first eight terms of the sequences an=(n+2)!(n1)! and bn=n3+3n32n , and then make a conjecture about the relationship between these two sequences.arrow_forwardConsider the sequence defined by an=68n. Is an=421 a term in the sequence? Verify the result.arrow_forwardGiven the recursively defined sequence a1=1,a2=3,a3=9, and an=an13an2+9an3, use complete induction to prove that an=3n1 for all positive integers n.arrow_forward
- Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
- Algebra and Trigonometry (MindTap Course List)AlgebraISBN:9781305071742Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage LearningCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning