Answer:
<em>Solution in the attachment above..</em>
<h3>
<em><u>Hope it helps uh. !!!</u></em></h3><h2 /><h2>
<em><u>Stay</u></em><em><u> </u></em><em><u>Safe</u></em><em><u>!</u></em></h2>
The problem here takes a brilliant mind to answer this. This problem can easily be answered using programming because we can not then and there push all the possibilities using paper and pen.
The answer is 3816547290.
Trying all the possibilities starting form 1000000080 (we are sure that the last number should be 0). Then traversing that number until 9999999990. Each traverse, check the number if its divisible to n, so on and so forth.
The gcf of 8 & 18 is 2 because no other number can go into both except 2
the lcm is 72 because thats the lowest number that both of them can be multiplied to get
The store sold 33 mugs, since 115.50 divided by 3.50 equals 33. Hopefully I am correct! Have a good day.
