If we are asked to find the maximum number of ways there are to make a 5-digit number lock code, is repetition allowed?

step-by-step explanation:

idk the answer i want to say 10 but then it would be equal so try 9 but then yeah so yeah we love edgen

answer:   the paragraph proof is mentioned below.

step-by-step explanation:

given: in a δxwy where

such that, ∠wzx ≅ ∠yzx and zw≅zy

we have to prove that: segment zx is a perpendicular bisector of segment wy.

prove: since, zw≅zy ⇒ ∠wzy is a supplementary angle.

then, ∠wzy= 180°

⇒∠wzx + ∠yzx = 180° ( because xz divides ∠wzy into two parts)

but, ∠wzx ≅ ∠yzx ( given)

⇒∠wzy+∠wzy=180° ( by substitution)

⇒2∠wzy=180°

⇒∠wzy=90°

⇒∠wzy=∠yzx =90°

therefore, xz⊥wy where wz=zy

⇒zx is a perpendicular bisector of wy.

answer:

the answer is b) divide by -4 on each side and flip the sign.

step-by-step explanation:

we first need to start by dividing. this is because it is a multiplication problem to start.

we also need to make sure we flip the sign because any time you multiply or divide by negative numbers, the sign must be flipped.