Answer:
11x
Step-by-step explanation:
Since there like terms you can combine them
5x+6x=11x
if not is there more to this problem so i can fully understand
i hope this helps :)
Answer:
5453.3 gallon's I think I'm not sure
Answer:
5 5/9, 5 1/2 and 5.05
Step-by-step explanation:
From greatest to least, find the decimal of each value 5 1/2,5.05,5 5/9.
5 1/2 = 5.5
5.05
5 5/9 = 5.55556...
The greatest is 5 5/9 followed by 5 1/2 and lastly 5.05.
Answer:
∠B ≅ ∠F ⇒ proved down
Step-by-step explanation:
<em>In the </em><em>two right triangles</em><em>, if the </em><em>hypotenuse and leg</em><em> of the </em><em>1st right Δ ≅</em><em> the </em><em>hypotenuse and leg</em><em> of the </em><em>2nd right Δ</em><em>, then the </em><em>two triangles are congruent</em>
Let us use this fact to solve the question
→ In Δs BCD and FED
∵ ∠C and ∠E are right angles
∴ Δs BCD and FED are right triangles ⇒ (1)
∵ D is the mid-point of CE
→ That means point D divides CE into 2 equal parts CD and ED
∴ CD = ED ⇒ (2) legs
∵ BD and DF are the opposite sides to the right angles
∴ BD and DF are the hypotenuses of the triangles
∵ BD ≅ FD ⇒ (3) hypotenuses
→ From (1), (2), (3), and the fact above
∴ Δ BCD ≅ ΔFED ⇒ by HL postulate of congruency
→ As a result of congruency
∴ BC ≅ FE
∴ ∠BDC ≅ ∠FDE
∴ ∠B ≅ ∠F ⇒ proved
Answer:
Answer for the question:
To compute a19 mod N, the modular exponential algorithms that we studied would do 8 modular multiplications (5 squarings and 3 multiplications by a). What is the minimum number of modular multiplications needed to compute a19 mod N if you are free to use any sequence of modular multiplications.)
is given in the attachment.
Step-by-step explanation:
