Answer: 200
Step-by-step explanation:
174 rounded to the nearest hundred is:
200
When rounding to the nearest hundred, like we did with 174 above, we use the following rules:
A) We round the number up to the nearest hundred if the last two digits in the number are 50 or above.
B) We round the number down to the nearest hundred if the last two digits in the number are 49 or below.
C) If the last two digits are 00, then we do not have to do any rounding, because it is already to the hundred.
pls mark brainliest!
Answer:
well it's 9/25 or 0.36% or (36%) only
Step-by-step explanation:
So you add all the numbers up it would be 25, divide the numerator by the denominator and get 0.36%, i can't remember if you divide .36 by 100 or not but anyway you get 36%.
But I hope i have helped you in anyway.
Answer:
Sally has been measuring the tree for 4 months
Step-by-step explanation:
The correct question is as follows;
Sally has been measuring the tree in her yard for a science project. The tree has grown 1/2 of an inch each month and grown a total of 2 inches taller. How many months has Sally been measuring this tree?
.........................................................................................
Solution;
The tree has grown 1/2 of an inch each month and has grown a total of 2 inch taller.
We now need to know the number of months in which the measuring has been taking place.
To know the number of months, we simply need to divide the change in height which is 2 inch by the individual month growth rate which is 1/2 inch
So mathematically, that would be 2/1/2 = 2 * 2 = 4 months
Answer:
The last answer is correct.
Step-by-step explanation:
Answer: 1 .Thus for a graph to have an Euler circuit, all vertices must have even degree. The converse is also true: if all the vertices of a graph have even degree, then the graph has an Euler circuit, and if there are exactly two vertices with odd degree, the graph has an Euler path.
2. A graph has an Euler circuit if and only if the degree of every vertex is even. A graph has an Euler path if and only if there are at most two vertices with odd degree.
Step-by-step explanation:
Can i have branily plz
