You would assume that in this figure, the number of colored sections with which are not colored with respect to a " touching " colored section, would be half of the total colored sections. However that is not the case, the sections are not alternating as they still meet at a common point. After all, it notes no two touching sections, not adjacent sections. Their is no equation to calculate this requirement with respect to the total number of sections.
Let's say that we take one triangle as the starting. This triangle will be the start of a chain of other triangles that have no two touching sections, specifically 7 triangles. If a square were to be this starting shape, there are 5 shapes that have no touching sections, 3 being a square, the other two triangles. This is presumably a lower value as a square occupies two times as much space, but it also depends on the positioning. Therefore, the least number of colored sections you can color in the sections meeting the given requirement, is 5 sections for this first figure.
Respectively the solution for this second figure is 5 sections as well.
The answer is:
Answer:
<u>C. 1.05</u>
if u mark as brainly thatll be cool
Answer:
can't prove a nt with info given
Step-by-step explanation:
x+y=7 _ eqn1
x-y=3_ eqn2
add eqn1 and eqn2
x+y=7
+ x-y=3
= 2x= 10
x=5
x+y=7
5+y=7
y=7-5
y=2 proved
