To reduce a fraction divide the numerator and the denominator by their greatest common factor, GCF. ... The numerator and the denominator of the fraction are coprime numbers (no common prime factors, GCF = 1), the fraction cannot be reduced (simplified): irreducible fraction.
Answer:
Again! Option D is the answer!
Please mark my answer as the brainliest since I have you the answer so quickly!
Answer:
Step-by-step explanation:
Note that we have in total 18 items. Even though we are given information regarding the amounts of items per type, the general question asks the total number of ways in which you can pick 5 out of the 18 objects, without any restriction on the type of chosen items. Therefore, the information regarding the type is unnecessary to solve the problem.
Recall that given n elements, the different ways of choosing k elements out of n is given by the binomial coefficient 
.
Therefore, in this case the total number of ways is just 
Please, post just one problem at a time, or (if you post more than one), indicate which one you want to focus on first. Even more important, please do whatever you can to get started on each problem; I'm sure you know at least some basics.
What does "intersecting" mean? Look it up if you're not sure.
Then what would "two intersecting lines" look like? Draw the graph, or at least explain in words what the graph would look like.
