Mathematics Homework Solutions
Problem
#27706

Lowest Common Multiple Application Word Problem

Five children collect N pieces of Halloween candy and decide to split it evenly among them. When they try to divide it they have two pieces of candy left over. One of the children leaves, taking the 26 pieces of candy she collected with her. The remaining four children try to split the N-26 remaining pieces of candy and discover that they have one piece of candy left over. Frusterated, a second child leaves, taking 24 pieces of candy and the remaining three children split the N-26-24 pieces of candy left between them, delighted to discover that it can be split exactly three ways. What is the smallest (positive, of course) value for N for which this is possible? Are there other values of N for which this is possible also?

Attached file(s):
Attachments
e3.rtf  View File

Attachment Content Summary (Note: view attachment at the above link before purchasing. Actual attachment content may vary slightly from that shown below.)

e3.rtf
PLEASE FOLLOW THE INSTRUCTIONS:



1. No programming

2. Show all steps

3. Explain your solution process in words

4. Proofs need to be explained primarily in words. If there is a lot
of algebra, explain the process in words as well.

5. ANSWER ALL PARTS OF THE QUESTION





Solution Summary

Lowest common multiples are used to solve a word problem. The solution is detailed and well explained.

Solution
What is this?
By OTA - Overall OTA Rating
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
  • Plain text response
  • Attached file(s):
    • e3.rtf
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Least Common Multilpes - A. Find the LCM (84, 108). Show how you obtained your answer. B. Suppose LCM (18,A) = 72. What are the possible values, if any, for A? Explain your answer.
  • Symmetric groups - symmetric groups: G = Sn. (i) Let g1, g2 belong G be two disjoint cycles, and let g = g1g2. Prove that o(g) = lcm { o( g1), o(g2)}, where lcm stands for the least common multiple. (ii) L ...
  • LCM/ GCD proof - Prove for all positives integers x and y that Lcm(5x,7y) = 5* 7 * x*y ----------------------- gcd(x*gcd(5,y),7y)
  • Rings - In Zn x Zm (integers modulo n and m respectively) find the characteristic of the ring.
  • Fractions and LCM Word Problems - A water tank has an inlet pipe and a drain pipe. A full tank can be emptied in 30 minutes if the drain is opened and an empty tank can be filled in 45 minutes with the inlet pipe opened. If both pipes ...
Browse