Answer:
70
Step-by-step explanation:
- for the value of difference to be largest, the minuend should be maximum(most possibly) and the subtrahend should be minimum
[in A-B=X, A is minuend and B is subtrahend ]
- so, $a.b should be maximum. as there is a condition that 4 digits should be distinct, the product will be maximum if we choose 2 maximum valued numbers from the given numbers. so, one of them should be 9 and the other should be 8.
therefore, $a.b=9*8=72
- as mentioned above, c.d$ should be minimum. this will be possible only when we choose 2 minimum valued numbers from the given numbers. so, one of them should be 1 and the other should be 2.
therefore, c.d$ = 1*2 = 2
- hence, the difference = 72-2 = 70
- thus, the largest possible value of the difference $a.b - c.d$ = 70
Answer:(–4.5, –2.5)
(4.5, 6)
(1.3, 3.5)
Step-by-step explanation:
Answer: The GREATEST number of bookmarks that Logan can make = 31.
Step-by-step explanation:
GIven: Total petals = 95
Number of petals required for each bookmark = 3
Number the number of bookmarks can be prepared from 95 petals = 95 ÷ (Petals required of each bookmark)
= 95÷3
![=31\dfrac{2}{3}\ \ \ \approx31\text{ [Round to the nearest whole number.]}](https://tex.z-dn.net/?f=%3D31%5Cdfrac%7B2%7D%7B3%7D%5C%20%5C%20%5C%20%5Capprox31%5Ctext%7B%20%20%20%20%5BRound%20to%20the%20nearest%20whole%20number.%5D%7D)
i.e. The GREATEST number of bookmarks that Logan can make = 31.
24:15 would be the simplified version, if that's what you meant.
Answer:it would be exactly to the other side of y
Step-by-step explanation:
like say -2,1 would reflect as 2,1
