Answer:
362880 ways
Step-by-step explanation:
Given
10 digits
Required
Number of 10 digits that can be formed if no repetition and 2 must always start;
Since digit 2 must always start and no repetition is allowed, then there are 9 digits left
Digit 2 can only take 1 position
9 digits can be arranged without repetition in 9! ways;
Calculating 9!
Number of arrangement = 1 * 362880
Number of arrangement = 362880 ways
The scale factor of DEF : RST is 3/4.
X = 12
Answer:
<h2>
D. </h2>
Step-by-step explanation:
y ≤ 2x + 2 ⇒ 2x → line increasing, ≤ → solid line, y≤ → shade below line
¹/₂x + y < 7
y < -¹/₂x + 7 ⇒ -¹/₂x → line decreasing, < → dashed line, y< → shade below line
y − 3 ≥ 0
y ≥ 3 ⇒ 0x → line parallel to X-axis, ≥ → solid line, y≥ → shade above line
Answer:
x = ln6
Step-by-step explanation:
e^2x - 2e^x - 24 = 0
a = e^x
=> a^2 - 2a - 24 = 0
=> (a + 4)(a - 6) = 0
=> a = -4 => e^x = -4 (invalid because e^x > 0)
=> a = 6 => e^x = 6 => x = ln6