Exercise 14.4.13. Fill in the blanks with the appropriate variables in the following proof of the proposition. (*Hint*) Proof: For any integer { we may write { = ak + b, where be Z <1> · It follows that =7>k+<> = (7<4>k)p<5> = (7k)<>> = (id)<>, = 7 <10>. = id. However, we know that Therefore r = id if and only if < 12 > < k, and we also know that < 13 > is the smallest positive integer such that 714> = id. Hence it must be the case that b = < 15 > , which is the same thing as saying that mod(e, < 17 > ) = 0.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Please do exercise 14.4.13 please show step by step and explain.

The hint states "The first blank should be replaced by k"

Definition 14.4.12. The order of a permutation 7 is the smallest positive
integer k such that * = id. As before, the order of T is denoted by the
notation |T|.
A
Proposition: Let 7 be a permutation, and let k = |7|. Then r = id if and
only if mod(e, k) = 0.
Exercise 14.4.13. Fill in the blanks with the appropriate variables in the
following proof of the proposition. (*Hint*)
Proof: For any integer l we may write l = ak + b, where b e Z <1> . It
follows that
=7>k+<> = (7<4>-k)p<5> = (7k)<>>Z> = (id)<>,> =7 10>.
Therefore 7
< 12 > < k, and we also know that < 13 > is the smallest positive
integer such that 714> = id. Hence it must be the case that b = < 15 >,
which is the same thing as saying that mod(e, < 17 > ) = 0.
= id if and only if r11>
= id. However, we know that
Transcribed Image Text:Definition 14.4.12. The order of a permutation 7 is the smallest positive integer k such that * = id. As before, the order of T is denoted by the notation |T|. A Proposition: Let 7 be a permutation, and let k = |7|. Then r = id if and only if mod(e, k) = 0. Exercise 14.4.13. Fill in the blanks with the appropriate variables in the following proof of the proposition. (*Hint*) Proof: For any integer l we may write l = ak + b, where b e Z <1> . It follows that =7>k+<> = (7<4>-k)p<5> = (7k)<>>Z> = (id)<>,> =7 10>. Therefore 7 < 12 > < k, and we also know that < 13 > is the smallest positive integer such that 714> = id. Hence it must be the case that b = < 15 >, which is the same thing as saying that mod(e, < 17 > ) = 0. = id if and only if r11> = id. However, we know that
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,