If the truck can carry 1000 apples at a time, Bananaville is 1000 miles away from Appleland and you pay one apple per mile, then it's impossible to deliver any apple to Bananaville, because on 1000 miles you'll pay 1 apple * 1000 miles = 1000 apples as a tax. So no matter if you go once, twice, three times or a hundred times there - you'll be never able to deliver any apple.
Answer: The highest number of apples you can get to Bananaville is 0.
Answer:
because AC and BD bis => AX = XC; BX = XD
ΔAXD ≅ ΔCXB (SAS) because: AX = CX
DX = BX
m∠AXD = m∠BXC ( 2 opposing angles)
because ΔAXD ≅ ΔCXB (SAS)
=> AD = BC and m∠DAX = m∠BCX
because m∠DAX = m∠BCX => AD//BC
ABCD has AD = BC and AD//BC => ABCD is a parallelogram
Step-by-step explanation:
i. 171
ii. 162
iii. 297
Solution,
n(U)= 630
n(I)= 333
n(T)= 168
i. Let n(I intersection T ) be X

<h3>ii.
n(only I)= n(I) - n(I intersection T)</h3><h3>
= 333 - 171</h3><h3>
= 162</h3>
<h3>
iii. n ( only T)= n( T) - n( I intersection T)</h3><h3>
= 468 - 171</h3><h3>
= 297</h3>
<h3>
Venn- diagram is shown in the attached picture.</h3>
Hope this helps...
Good luck on your assignment...
The answer is 3 and 3.16227766017