The least of the common factors of two or more numbers is the least common factor of the numbers.
Now, she writes 4 notes every 1 hour.
so in 2 hours she has written 8 notes, and the remaining is 50 - 8 or 42.
in 3 hours has written 12 notes, and remaining are 50 - 12, or 38, and so on.
now, how many hours will it take her to them all? or, how many times does 4 go into 50? 50 /4 or 12.5.
so it will take her 12 hours and a half to do them all, at that time, the remaining notes are 0, because she's done, and the hours are 12 and a half.
By answering the question and reading the question
There are two solutions for this problem. It depends if order matters or not. Since it is not mentioned in the problem, it is safe to assume that order does not matter and that choosing can be done at random. Then, this is a combination problem:
nCr = n!/r!(n-r)!
where n=13 because there are <span>13 qualified candidates</span>, and r=8 because you choose 8 chiefs at a time
nCr = 13!/8!(13-8)! = 1,287 ways
Answer:
x-intercept = 12, y-intercept = 4
Step-by-step explanation:
To find the x and y intercept, substitute 0 in for both values.
<u>Substitute 0 into x:</u>
2(0) + 6y = 24
6y = 24
<u>Divide each side by 6:</u>
y = 4
<u>Substitute 0 into y:</u>
2x + 6(0) = 24
2x = 24
<u>Divide each side by 2:</u>
x = 12