brazil-enem 2022 Q99

brazil-enem · Other · enem__day2 Not Maths
In order to classify the best routes in a traffic application, a researcher proposes a model based on electrical circuits. In this model, the current represents the number of cars passing through a point on the track in the interval of 1 s. The potential difference (p.d.) corresponds to the amount of energy per car necessary for displacement of 1 m. Similarly to Ohm's law, each route is classified by its resistance, with the one with greater resistance being the most congested. The application shows the routes in increasing order, that is, from the route of least to greatest resistance.
As a test for the system, three possible routes are used for a trip from A to B, with the values of p.d. and current as shown in the table.
Routep.d. $\left( \frac{\mathrm{J}}{\text{car} \cdot \mathrm{m}} \right)$Current $\left( \frac{\text{car}}{\mathrm{s}} \right)$
15104
26084
35753

In this test, the ordering of the routes indicated by the application will be:
(A) $1,2,3$.
(B) $1,3,2$.
(C) $2,1,3$.
(D) $3,1,2$.
(E) $3,2,1$.
In order to classify the best routes in a traffic application, a researcher proposes a model based on electrical circuits. In this model, the current represents the number of cars passing through a point on the track in the interval of 1 s. The potential difference (p.d.) corresponds to the amount of energy per car necessary for displacement of 1 m. Similarly to Ohm's law, each route is classified by its resistance, with the one with greater resistance being the most congested. The application shows the routes in increasing order, that is, from the route of least to greatest resistance.

As a test for the system, three possible routes are used for a trip from A to B, with the values of p.d. and current as shown in the table.

\begin{center}
\begin{tabular}{ c | c | c }
\hline
Route & p.d. $\left( \frac{\mathrm{J}}{\text{car} \cdot \mathrm{m}} \right)$ & Current $\left( \frac{\text{car}}{\mathrm{s}} \right)$ \\
\hline
1 & 510 & 4 \\
\hline
2 & 608 & 4 \\
\hline
3 & 575 & 3 \\
\hline
\end{tabular}
\end{center}

In this test, the ordering of the routes indicated by the application will be:\\
(A) $1,2,3$.\\
(B) $1,3,2$.\\
(C) $2,1,3$.\\
(D) $3,1,2$.\\
(E) $3,2,1$.