Week 3 Math230

Problem

A

The question establishes there is printers and wants to know the many possibilities pages can be arranged. To find this solution we can look at this as

* * over and over again untill it is instances of being multiplied.

we do this because you have choices for times. so math logic this is

B

we need to find how the solution to set the first page to color and last page to color strictly and find the many possibilites that exist for the remaining pages of the number for pages we have a total of printers.

to do this we reconizge as the exponet and subtract from it as there is less possibilites and those are strict to first and last ok. so we have

we have 2 printers or (options) capable of printing color for the first and last page so we need to establish this , lets not be thrown off we are focused on the printer choice one or the other so we have choices with strict possibilities applied as we take away the first and last option we have * = for the first and last page

so this is 4 *

C

to solve this i used the counting problem , i learned this in zylabs and i believe this refrences the breakfast combinations example where |D × M × S| = |D| × |M| × |S|).

there is 5 sets and 5 printers so we can use to get

sets are

as A

as B

and so forth to

we do not have a set defined as

Problem

A

George is ahead of Dave, so function f(x) = x.

B

ok this one was fun and i understand this ( i think lol)
we have the function = x when dave first before george

we are dierected that a swap occurs for dave and george so that T is now the order.

T is so George is first and Dave is after. so we have swapped and our output is
(Emy, Ian, George, Homa, Jim, Alex, Bobby, Frank, Dave, Cathy)

C

Yes, it is a k-to-

every element in the set, points to an ouput , that number or variable is defined by the element it came from

like a chicken hatching a chicken, if the chicken hatches a dog it is not k to 1

= because theere the elements dave and george follow the output using the arugement and fucntion if its not true its swapped and thus making a second case, so k

Well either i am misunderstanding the material or this is becoming a bit easy as i know it and over complicating it. We have s defined in our question. as ,,
we know that this is when we have to do a swap for george or dave and we can conclude that well since this is all the possibilites in the set S and T equals S we can use inverse laws to say they have the same vaule expect that we are not feeding T twice into the function so we can divide it by half and find t.

T = ,,

Problem