Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Find the permutations of \({\rm{\{ 1,2,3,4,5\} }}\) that correspond to these integers with respect to the correspondence between Cantor expansions and permutations as described in the preamble to Exercise 14 .

a) 3

b) 89

c) 111

Short Answer

Expert verified

a. The permutation is 23145.

b. The permutation of \({\rm{\{ 1,2,3,4,5\} }}\) that corresponds to cantor integer 89 is 35421 .

c. The permutation is 52431 .

Step by step solution

01

Definition of Concept

Functions: It is a expression ,rule or law which defines a relationship between one one variable and another variables.

02

Find the permutation

(a)

Considering the given information:

The set \({\rm{\{ 1,2,3,4,5\} }}\)& cantor integer 3 .

Using the following concept:

If cantor digits are \({{\rm{a}}_{\rm{1}}}{\rm{,}}{{\rm{a}}_{\rm{2}}}{\rm{,}}{{\rm{a}}_{\rm{3}}}{\rm{\& }}{{\rm{a}}_{\rm{4}}}\)then cantor expansion is

\({{\rm{a}}_{\rm{1}}}{\rm{(1!) + }}{{\rm{a}}_{\rm{2}}}{\rm{(2!) + }}{{\rm{a}}_{\rm{3}}}{\rm{(3!) + }}{{\rm{a}}_{\rm{4}}}{\rm{(4!) = }}\)Canter integer.

Because there are five symbols like \({\rm{1, 2,3, 4, 5}}\)

The cantor digits are 4 i.e. \({{\rm{a}}_{\rm{1}}}{\rm{,}}{{\rm{a}}_{\rm{2}}}{\rm{,}}{{\rm{a}}_{\rm{3}}}{\rm{,}}{{\rm{a}}_{\rm{4}}}\)

By cantor expansion.

\(\begin{array}{l}{\rm{ = }}{{\rm{a}}_{\rm{1}}}{\rm{(1) + }}{{\rm{a}}_{\rm{2}}}{\rm{(2) + }}{{\rm{a}}_{\rm{3}}}{\rm{(6) + }}{{\rm{a}}_{\rm{4}}}{\rm{(24) = 3}}\\{\rm{ = }}{{\rm{a}}_{\rm{1}}}{\rm{ = 1,}}{{\rm{a}}_{\rm{2}}}{\rm{ = 1,}}{{\rm{a}}_{\rm{3}}}{\rm{ = 0\& }}{{\rm{a}}_{\rm{4}}}{\rm{ = 0}}\\{{\rm{a}}_{\rm{1}}}{\rm{ = 1}}\end{array}\)

The number of integers less than 2 and follows 2 are 1

So, the permutation is \({\rm{21}}....\) (1)

\({{\rm{a}}_{\rm{2}}}{\rm{ = 1}}\)

The number of integers between 3 and 1 that are less than or equal to 3.

As a result, the permutation is \({\rm{31}}...{\rm{(2)}}\).

Using equation (1) & (2), we have the permutation \({\rm{231}}....\) (3)

\({{\rm{a}}_{\rm{3}}}{\rm{ = 0}}\)

Number of integer less than \({\rm{4 \& }}\)follows 4 are 0

So, the permutation is \({\rm{2314}}.....{\rm{(4)}}\)

\({{\rm{a}}_{\rm{4}}}{\rm{ = 0}}\)

Number of integers less than 5 & follows 5 are 0

The required number of permutations is\({\rm{ = 23145}}\).

Therefore, the required permutation of \({\rm{\{ 1,2,3,4,5\} }}\) that corresponds to cantor integer 3 is 23145 .

03

Find the permutation

(b)

Considering the given information:

The set \({\rm{\{ 1,2,3,4,5\} }}\)& cantor integer 89 .

Using the following concept:

If cantor digits are \({{\rm{a}}_{\rm{1}}}{\rm{,}}{{\rm{a}}_{\rm{2}}}{\rm{,}}{{\rm{a}}_{\rm{3}}}{\rm{\& }}{{\rm{a}}_{\rm{4}}}\)then cantor expansion is

\({{\rm{a}}_{\rm{1}}}{\rm{(1!) + }}{{\rm{a}}_{\rm{2}}}{\rm{(2!) + }}{{\rm{a}}_{\rm{3}}}{\rm{(3!) + }}{{\rm{a}}_{\rm{4}}}{\rm{(4!) = }}\)Canter integer.

By using cantor expansion.

\(\begin{array}{l}{{\rm{a}}_{\rm{1}}}{\rm{(1!) + }}{{\rm{a}}_{\rm{2}}}{\rm{(2!) + }}{{\rm{a}}_{\rm{3}}}{\rm{(3!) + }}{{\rm{a}}_{\rm{4}}}{\rm{(4!) = 89}}\\{{\rm{a}}_{\rm{1}}}{\rm{(1) + }}{{\rm{a}}_{\rm{2}}}{\rm{(2) + }}{{\rm{a}}_{\rm{3}}}{\rm{(6) + }}{{\rm{a}}_{\rm{4}}}{\rm{(24) = 89}}\\{\rm{1(1) + 2(2) + 2(6) + 3(24) = 89}}\\{{\rm{a}}_{\rm{1}}}{\rm{ = 1,}}{{\rm{a}}_{\rm{2}}}{\rm{ = 2,}}{{\rm{a}}_{\rm{3}}}{\rm{ = 2,}}{{\rm{a}}_{\rm{4}}}{\rm{ = 3}}\end{array}\)

Number of integers less than 2 is 1 , so string is \({\rm{21}}.....\) (1)

\({{\rm{a}}_{\rm{2}}}{\rm{ = 2}}\)

Number of integers less than 3 &follow 3 is 2.

So string is 321

\({{\rm{a}}_{\rm{3}}}{\rm{ = 2}}\)

Number of integers less than 4 &follow 4 is 2

So string is 3421

\({{\rm{a}}_{\rm{4}}}{\rm{ = 3}}\)

Number of integers less than 5 & follow 5 is 3

So string is 35421

Thus, required permutation is 35421 .

Therefore, the required permutation of \({\rm{\{ 1,2,3,4,5\} }}\) that corresponds to cantor integer 89 is 35421 .

04

Find the permutation

(c)

Considering the given information:

The cantor integer 111, set \({\rm{\{ 1,2,3,4,5\} }}\)

Using the following concept:

Cantor expansion is given as.

\({{\rm{a}}_{\rm{1}}}{\rm{(1!) + }}{{\rm{a}}_{\rm{2}}}{\rm{(2!) + }}{{\rm{a}}_{\rm{3}}}{\rm{(3!) + }}{{\rm{a}}_{\rm{4}}}{\rm{(4!) = }}\)Canter integer.

By using cantor expansion.

\(\begin{array}{l}{\rm{ = }}{{\rm{a}}_{\rm{1}}}{\rm{(1!) + }}{{\rm{a}}_{\rm{2}}}{\rm{(2!) + }}{{\rm{a}}_{\rm{3}}}{\rm{(3!) + }}{{\rm{a}}_{\rm{4}}}{\rm{(4!) = 111}}\\{\rm{ = }}{{\rm{a}}_{\rm{1}}}{\rm{(1) + }}{{\rm{a}}_{\rm{2}}}{\rm{(2) + }}{{\rm{a}}_{\rm{3}}}{\rm{(6) + }}{{\rm{a}}_{\rm{4}}}{\rm{(24) = 111}}\\{\rm{ = 1(1) + 2(2) + 2(6) + 3(24) = 111 }}\\{\rm{so, }}{{\rm{a}}_{\rm{1}}}{\rm{ = 1,}}{{\rm{a}}_{\rm{2}}}{\rm{ = 2,}}{{\rm{a}}_{\rm{3}}}{\rm{ = 2,}}{{\rm{a}}_{\rm{4}}}{\rm{ = 4}}\end{array}\)

Since, all of them is non-zero so, 1 is at the right most place. \({{\rm{a}}_{\rm{4}}}{\rm{ = 4}}\)that implies 5 is at the leftmost place. \({a_2} = 1 \Rightarrow 3\)Will be at the left from 1 and 2 is at the left of 3 but 4 is just the immediate left of 3 .

As a result, the permutation required is 52431

Therefore, the permutation required is 52431 .

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Prove Pascalโ€™s identity, using the formula for(nr) .

Give a formula for the coefficient ofxkin the expansion of(x2โˆ’1/x)100, where Kis an integer.

What is meant by a combinatorial proof of an identity? How is such a proof different from an algebraic one?

This procedure is used to break ties in games in the championship round of the World Cup soccer tournament. Each team selects five players in a prescribed order. Each of these players takes a penalty kick, with a player from the first team followed by a player from the second team and so on, following the order of players specified. If the score is still tied at the end of the 10 penalty kicks, this procedure is repeated. If the score is still tied after 20 penalty kicks, a sudden-death shootout occurs, with the first team scoring an unanswered goal victorious.

a) How many different scoring scenarios are possible if the game is settled in the first round of 10 penalty kicks, where the round ends once it is impossible for a team to equal the number of goals scored by the other team?

b) How many different scoring scenarios for the first and second groups of penalty kicks are possible if the game is settled in the second round of 10 penalty kicks?

c) How many scoring scenarios are possible for the full set of penalty kicks if the game is settled with no more than 10 total additional kicks after the two rounds of five kicks for each team?e1โˆ’1โˆ’x2

Prove the hockeystick identity\(\sum\limits_{k = 0}^r {\left( {\begin{array}{*{20}{c}}{n + k}\\k\end{array}} \right)} = \left( {\begin{array}{*{20}{c}}{n + r + 1}\\r\end{array}} \right)\).whenever\(n\)and\(r\)are positive integers,

a) using a combinatorial argument.

b) using Pascal's identity.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free