Euclid's Division Algorithm is a method used to find the ___ of two numbers, say a and b where a> b

8 apples are left.

step-by-step explanation:

10-2=8

10 apples

take 2

now u have 8

answer: evaluate the objective function at each vertex to determine which - and -values, if any, maximize or minimize the function. example: find the minimum value and maximum value of the objective function f ( x , y ) = 4 x + 5 y , subject to the following constraints

15% chance.

step-by-step explanation:

3/10 times, the 5 year old will get a tablet. 5/10 times, the 13 yer old will get a tablet. multiply both fractions to get 15/100 times, both would have a tablet.

i think its a and d

step-by-step explanation: