Ask your own question, for FREE!
Mathematics 15 Online
OpenStudy (anonymous):

Check, please

terenzreignz (terenzreignz):

I'm here.

OpenStudy (anonymous):

OpenStudy (anonymous):

thanks a lot!!!

OpenStudy (anonymous):

OpenStudy (anonymous):

OpenStudy (anonymous):

the last part is ok, we checked already

terenzreignz (terenzreignz):

so part A?

OpenStudy (anonymous):

Part1

OpenStudy (anonymous):

Part One in attachment 1 first. Can you read it well? my computer gives out the bad paper

terenzreignz (terenzreignz):

I can read it...

terenzreignz (terenzreignz):

It all boils down to what fr = ?

OpenStudy (anonymous):

to the least , no need to get fr if it's not the least length

terenzreignz (terenzreignz):

You need it so that you can simplify the long expressions involving fr...

terenzreignz (terenzreignz):

From your drawing, it would seem \[\huge fr = r^{-1}f\]

OpenStudy (anonymous):

not inverse, TJ

terenzreignz (terenzreignz):

Are you sure? Start at any point, you'll find that travelling fr is the same as going back one reverse \(\large (r^{-1})\) and then switching lanes (f)

OpenStudy (anonymous):

|dw:1366717567543:dw|

terenzreignz (terenzreignz):

I suggest starting here instead, for clarity...|dw:1366717669772:dw|

OpenStudy (anonymous):

for i) if I start at node 1 , go to the right 5 times, and then moving along f 5 times, and then go to the left 2 times, and then up along f 1 time. I stop at node 4. so, my least length to go from 1 --> 4 is r^3

terenzreignz (terenzreignz):

Hang on... thinking :D

terenzreignz (terenzreignz):

okay, \[\huge fr = r^{-1}f\]\[\huge rf = fr^{-1}\]

OpenStudy (anonymous):

ok, I can go on that way to check , it's quite easier and more logic than mine

terenzreignz (terenzreignz):

Maybe it is easier to derive a formula first for this.. \[\huge f^nr^n\]

OpenStudy (anonymous):

we meet there. apply yours i got the same answer

terenzreignz (terenzreignz):

You can check, but it seems \[\huge f^n r^n = r^{(-1)^nn}f^n\]

OpenStudy (anonymous):

can you tell me something about the order in the stuff, something like fr is order2 .... Quite confuse

terenzreignz (terenzreignz):

Well of course :) Simply because \[\huge (fr)^2=frfr = ffr^{-1}r=1\] Thus, fr = 2, since \(\large (fr)^2=1\)

OpenStudy (anonymous):

so, it will correspond to a if a^2 =1, right?

terenzreignz (terenzreignz):

I guess so, if you're looking for isomorphisms... but we haven't considered any other group besides this one \(\Large <f,r>\)

OpenStudy (anonymous):

yes, I think about isomorphisms, not this. because you give out the formula already and that works well, I can self checking .

OpenStudy (anonymous):

about partB in paper 1 do you have a rule for checking the inverse?

terenzreignz (terenzreignz):

Wait, just remember these rules for part 1 \[\huge fr = r^{-1}f\]\[\huge rf = fr^{-1}\] \[\huge f^nr^n = r^{(-1)^nn}f^n\]\[\huge r^nf^n = f^nr^{(-1)^nn}\] \[\huge (fr)^n=(fr)^{n(\mod 2 \ )}\]\[\huge (rf)^n=(rf)^{n(\mod 2 \ )}\]

terenzreignz (terenzreignz):

Now working on part B...

OpenStudy (anonymous):

you mean the remainder in (mod2) , for example if I have (fr)^5 = (fr)^5*1 =

terenzreignz (terenzreignz):

No, 5(mod 2) = 1

terenzreignz (terenzreignz):

Just the remainder, you do not multiply it by anything :)

OpenStudy (anonymous):

no, n(mode2) is the whole number, is the remainder only, right? misunderstood, only. so far so good so (fr)^5 = fr since 2|5 =1 mode2

terenzreignz (terenzreignz):

Yes, so (fr)^5 = (fr)^1 = fr ok? :)

OpenStudy (anonymous):

yeap

terenzreignz (terenzreignz):

Okay, part B...inverses any particular item you want to do?

OpenStudy (anonymous):

general formula, and check mine, hihihi..

OpenStudy (anonymous):

hey,TJ for f^nr^n I don't get, give me example

OpenStudy (anonymous):

I have to copy every thing into my note. this stuff never known before. My prof said very fast and just go over them in 1hour and a half

terenzreignz (terenzreignz):

It's not that hard... You can think of it this way... \[\huge f^nr^n = \left\{\begin{array}{11}r^{-n}f^n \quad \text{n is odd}\\r^nf^n \quad \ \ \ \text{n is even}\end{array}\right.\]

terenzreignz (terenzreignz):

So for example \[\huge f^8r^8 = r^8f^8\]\[\huge f^9r^9=r^{-9}f^9\]

OpenStudy (anonymous):

yes, it's better from your previous note, quite clear

OpenStudy (anonymous):

you know why? because you confused me when r^(-1)n*n f^n

terenzreignz (terenzreignz):

It's more compact that way. I don't like piecewise functions :D

OpenStudy (anonymous):

ok, inverse

terenzreignz (terenzreignz):

Okay, it would only make sense to put up the basic inverses, some of these you may have already figured out... \[\huge r^{-n}=fr^nf\] \[\huge f^{-1} = f\]

terenzreignz (terenzreignz):

Now, when taking inverses, you take them in reverse. Let me show you what I mean...

OpenStudy (anonymous):

got it

terenzreignz (terenzreignz):

I cannot read part B, number (v) could you write it down?

OpenStudy (anonymous):

fr^3 f

terenzreignz (terenzreignz):

Okay... \[\huge fr^3f\] There may be faster ways to get inverses, but here's the method that would work every time... Get the inverses, one part at a time, STARTING FROM THE RIGHT.

terenzreignz (terenzreignz):

\[\huge (fr^3f)^{-1} = ?\]

OpenStudy (anonymous):

r^3

terenzreignz (terenzreignz):

So... inverse, starting from the right \[\huge fr^3\color{red}f\rightarrow \color{blue}f\]\[\huge f\color{red}{r^3}f\rightarrow f\color{blue}{fr^3f}\]\[\huge \color{red}fr^3f\rightarrow ffr^3f\color{blue}f\]

terenzreignz (terenzreignz):

And yes, \[\huge ffr^3ff = r^3\]

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!