Problem 7)
The answer is choice B. Only graph 2 contains an Euler circuit.
-----------------
To have a Euler circuit, each vertex must have an even number of paths connecting to it. This does not happen with graph 1 since vertex A and vertex D have an odd number of vertices (3 each). The odd vertex count makes it impossible to travel back to the starting point, while making sure to only use each edge one time only.
With graph 2, each vertex has exactly two edges attached to it. So an Euler circuit is possible here.
================================================
Problem 8)
The answer is choice B) 5
-----------------
Work Shown:
abc base 2 = (a*2^2 + b*2^1 + c*2^0) base 10
101 base 2 = (1*2^2 + 0*2^1 + 1*2^0) base 10
101 base 2 = (1*4 + 0*2 + 1*1) base 10
101 base 2 = (4 + 0 + 1) base 10
101 base 2 = 5 base 10
Answer:
13x
Step-by-step explanation:
7x+6x=13x. But since i do not have a second part of the question i can not tell you what x equals
3.14 is the decimal for pi
Say, for example, you have an improper fraction (it usually is if you're trying to convert to a mixed number) like: 55/7
You would take the highest number that is divisible by the denominator, which in this case is 7 (7x7=49; 7x8 would be 56 and we don't want that)
You subtract the number you got (49) from the original numerator (55).
That will give you 6.
Now, you put the whole number (7) before the fraction (6/7)
