Answer and Step-by-step explanation:
Every group homomorphism ϕ:Zn→Zm extends in a unique way to a linear transformation T:Qn→Qm of vector spaces over Q.
Moreover, ϕ is injective iff T is injective. But T being injective implies n≤m.
Applying this to both ϕ and ϕ−1, we conclude that n≤m≤n.
NOTE:
The proof and step-by-step explanation is in the attachment below
The answer is 6 square inches because if you turn 1 and 1/2 into 3/2 you can then turn 4 into 4/1 which also turns to 8/2 so that times 3/2 = 12/2 which turns to 6/1 which is 6
The answer is 6 square inches
Answer:
Step-by-step explanation:
Part A
2x-3y =21 in slope-intercept form is y=2/3x-7 one you graph the equation it would be a parallel to the equation shown above so there are no intersections
PART B
y=1/3x^2 and y= 2/3x - 5
1/3x^2 = 2/3x-5
1/3x^2=2/3x-5
then u multiply everything by 3
1/3x^2*3 =2/3x *3-5*3
the three for 1/3*3 cancels out so you are left with
1x^2= 2x -15
1x^2-2x+15=0
You can not factor it and well i guess there is no intersection
im sorry if i got this wrong bc i had a similar question just different numbers and i tried to solve this one the way i sloved mine so im not sure of my answer for part b
Answer:
<h3>A = 5b</h3><h3>B = 4x</h3><h3>C = 2b</h3><h3>D = 2a</h3>
Step-by-step explanation:

Answer:
The probability that he teleports at least once a day = 
Step-by-step explanation:
Given -
Evan lives in Stormwind City and works as an engineer in the city of ironforge in the morning he has three Transportation options teleport ride a dragon or walk to work and in the evening he has the same three choices for his trip home.
Total no of outcomes = 3
P( He not choose teleport in the morning ) = 
P( He not choose teleport in the evening ) = 
P ( he choose teleports at least once a day ) = 1 - P ( he not choose teleports in a day )
= 1 - P( He not choose teleport in the morning )
P( He not choose teleport in the evening )
= 
= 