Answer:
The largest number of elephants which Daniel could have is 2007
Step-by-step explanation:
The theorem behind it is if u and v are coprime positive interger then
N= 2UV -u-v
Where u = 28 v=37
N= 2×28×37- 28-37
N= 2007
Answer:
0.20
Step-by-step explanation:
Given : The number of side dishes for the lunch menu =6
The number of ways to select 3 dishes from 6 :
Total outcomes :
If applesauce and broccoli is already selected , then we need to select only one dish out of remaining 4 dishes.
Number of ways to select 1 dish from 4 :
Favorable outcomes:
Now, the theoretical probability that applesauce and broccoli will both be offered on Monday :-
Hence, the theoretical probability that applesauce and broccoli will both be offered on Monday = 0.20
Step-by-step explanation:
Answer:
a = 5 c =11
Step-by-step explanation:
Answer:
0.75 is the larger number
Step-by-step explanation:
If you shorten 0.725, it is 0.72 vs 0.75, making 0.75 the larger number.