Answer:
x-axis: (18,0)
y-axis: (0,12)
quadrant 1: (4.5, 10.6)
quadrant 2: (-15, 21)
quadrant 3: (–3/4, –4 1/9)
quadrant 4: (3, –7)
Find the greatest number that divides 36,45 and 63 without leaving a remainder
2 answers:
You might be interested in
Answer: 4950
Step-by-step explanation:
The number of possible combinations of n things taken r at a time is given by :-
Total nonnegative integers less than 100 ={0,1,2,... ,99} = 100
So, the number of combinations of choosing 2 out of them =
So, the number of ways to choose a set of two nonnegative integers less than 100 = 4950