can any one tell me how to do question 1, 3,4,5,6,7,8? and when u have answer plz remember to explain ur steps thnx
![]()
hello, I could give answer to your first question
when a square is inscribed in a circle, the length of the diagnol of the square =the diameter of the circle
2^(1/2)side of square = diagonal of square
area of square = 1/2 * diagonal * diagonal
S1 = 2 (diagonal of S1 =2)
when a circle is inscribed in a square, length of square = diameter of circle
diameter of O2= length of S1 = 2^(-1/2)* diagonal of S1 = 2^(1/2)
S2 = 1/2 * 2 = 1
Sn = 2*[(1/2)^(n-1)]

Hello, kansai!
Here's #5 . . .
5. For the matrices:and
(a) State the value of:
(b) Calculate:![]()
means the element in the
row and the
column. .Hence:
. . . .Similarly:
The elements of matrixwould have been written:
. . .![]()
. . .
. . . I assume this means the inverse of
The steps are long and messy . . . so I'll omit them.
. . .

Hello, kansai!
Here's #3 . . .
For the map given on the right
(a) Represent the map with a network.
(b) Find the degree of each vertex.
(c) State whether the network is traceable and explain the reason.(b) A: degree 2Code:(a) A - - - - - B | / | \ | / | \ | C | \ | / | \ | / | \ D - - - - - E - - -F
. . .B: degree 4
. . .C: degree 2
. . .D: degree 3
. . .E: degree 3
. . .F: degree 2
(c) A network is traceable if it has at most two vertices of odd degree.
This network has two odd vertices (D and E) and hence is traceable.

Hello, kansai!
I don't "trust" #4 . . . It has some disturbing errors and the meaning is unclear.
. . Can you provide the original wording?
A petty point: I assume it refers to The "NYS school system".4. The NYS school has four committees.
Each of these committees meet once a month.
Membership on these committees is as follows:
. . Committee A: Anna, John, Steven, Tom
. . Committee B: Debra, Jane John
. . Committee C: Annie, Debra, Larry, Tom
. . Committee D: Bobby, Debra, Grace, Mary, Steven
. . Committee E: Anna, Larry, Tom.
(a) Draw a network to illustrate the connectivity among the committees. .?
(b) Design a schedule with minimum timeslots for the committee meeting without conflicts. .??
I would assume that Annie is the same person as Anna, that someone mistyped the names.
. . But do I dare make that assumption?
The most glaring errors is that there are five committees.
(a) Connectivity is a term used in network theory, but not like this.
. . I assume they mean "common memberships" ?
(b) Minimum timeslots is a very sloppy term.
Does it mean "the shortest meetings"?
. . How about: "I call the meeting to order. .I will entertain a motion to adjourn . . ."
Does it mean "the shortest time-span" for the four (five?) meetings?
. .Schedule them consecutively with a one-minute break in between
. . (to allow the ten people to switch seats).
It is obvious that no two committees can meet at the same time.
. . So what is the question?
If I am correct about part (a), this should suffice:Code:B / | \ / | \ / | \ A - - - + - - - D / \ | / / \ | / / \ | / E - - - - - C
From my understanding of this question it works out like this.
the diagnol of the square (d) = the diameter of the circle (d), so the area =
= the length of one of the square's side
since s^2 is the area of the square this is the answer for
.
Now the next circle has the diameter equal to the height of the square, so...
and now you apply the first formula to find the area of
This shows us that the area of
Considering me and malaygoel got different answers, could a third party check my work?
it might be that I'm tired, buy I can't seem to think where you got the 2^(-1/2) from. However, you can see our equations differ,diameter of O2= length of S1 = 2^(-1/2)* diagonal of S1 = 2^(1/2)
mine=yours=
However, there is a certain value of d that would make our equations the same.
but why would you say the diameter is 2?