Answer:
A prime number has exactly two factors, 1 and itself. For example, 13 is a prime number because the only factors of 13 are 1 and 13
<em>if this is what you are looking for..</em>
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
1 Pretzel and 5 Bags of Popcorn
(WORK SHOWN BELOW)
Answer:
If you need to know the intercepts, then standard form is easier because you can just plug in 0s. slope intercept is easier if you want to graph
Step-by-step explanation:
What is a 10x10 grid and what model is 40%
