Answer:
C. Bulldogs
Step-by-step explanation:
In this question, we want to compare several numbers with different denominators and find out which number is the least. To compare this number, we have to change the denominator into the same number by finding the least common multiple (LCM) of the 4 numbers. The factor of each number will be:
3= 3 ^1
5= 5^1
8= 2 * 2 * 2 = 2^3
2= 2^1
We can find the LCM by multiplying a higher exponent of each prime number. The LCM will be:3^1 * 5^1 * 2^3 = 120
Each number will be:
Tiger= 2/3 * 40/40= 80/120
Redbird = 4/5 * 24/24= 96/120
Bulldogs = 3/8 * 15/15 = 45/120
Titans = 1/2 * 60/60 = 60/120
As you can see, the team with the lowest chance to play is Bulldogs = 45/120
The first one is B hope this helps
2•10+5•3
10•3
35/30*5 ( do it on both sides )
you'll get 7/6 or 1 1/6
Answer:
84 arrangements
Step-by-step explanation:
First, we need to calculate the total number of roses that the shop owner has. We do this by adding the pink roses and the red roses that the owner has.
342 + 330 = 672 total roses
Now that we have the total number of roses we simply divide by the number of roses needed for each arrangement (8) in order to calculate the total number of arrangements that the owner can make.
672 / 8 = 84 arrangements
Answer:
In programming, a recursive function is a function that calls itself. Recursion is used very commonly in programming, although many simple examples (including some shown in this section) are actually not very efficient and can be replaced by iterative methods (loops or vectorized code in MATLAB).
Step-by-step explanation:
