Results 1 to 4 of 4

Math Help - Euclidean Algorithm Problem

  1. #1
    Newbie
    Joined
    Oct 2009
    Posts
    1

    Euclidean Algorithm Problem

    There were 63 piles of fruit put together. There are 7 different kinds of fruit. The piles were divided evenly among 23 travelers. Whats the number of fruit in each pile?

    hint: consider the equation 63x + 7 = 23y

    i have the equation done, 63(28) + 7 = 23(77)
    but i don't exactly know what the numbers represent. My assumption is there are 207 pieces of fruit in each pile. lcm(63,23) = 1449, 1449/7 = 207. But i'm sure thats wrong. any ideas?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Grandad's Avatar
    Joined
    Dec 2008
    From
    South Coast of England
    Posts
    2,570
    Thanks
    1

    More information please

    Hello macrobes17

    Welcome to Math Help Forum!
    Quote Originally Posted by macrobes17 View Post
    There were 63 piles of fruit put together. There are 7 different kinds of fruit. The piles were divided evenly among 23 travelers. Whats the number of fruit in each pile?

    hint: consider the equation 63x + 7 = 23y

    i have the equation done, 63(28) + 7 = 23(77)
    but i don't exactly know what the numbers represent. My assumption is there are 207 pieces of fruit in each pile. lcm(63,23) = 1449, 1449/7 = 207. But i'm sure thats wrong. any ideas?
    Are you sure you have given us the exact wording of the question? I can't understand the meaning of the equation 63x + 7 = 23y.

    The implication is that there were the same number of pieces of fruit in each of 63 piles. If this number is x, then there were (obviously) 63x pieces of fruit altogether. So where does the number of different types of fruit come in? What justification is there for adding the number of different types of fruit (7) to the number of pieces of fruit to give 63x + 7? That just doesn't make any sense.

    I think there must be some information that's incorrect or missing here.

    Grandad
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Super Member Deadstar's Avatar
    Joined
    Oct 2007
    Posts
    722
    207 for minimum pile size is wrong. It could be 23 in which case all travelers get 63 pieces of fruit. Also in the pile that each traveler gets there will be exactly 9 of each of the 7 different fruits.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Super Member
    Joined
    Jan 2009
    Posts
    591
    Quote Originally Posted by macrobes17 View Post
    There were 63 piles of fruit put together. There are 7 different kinds of fruit. The piles were divided evenly among 23 travelers. Whats the number of fruit in each pile?
    hint: consider the equation 63x + 7 = 23y
    i have the equation done, 63(28) + 7 = 23(77)
    but i don't exactly know what the numbers represent. My assumption is there are 207 pieces of fruit in each pile. lcm(63,23) = 1449, 1449/7 = 207. But i'm sure thats wrong. any ideas?
    If the 63 piles do NOT have to have the same number of each kind of fruit, then you'll need your 1449 pieces of fruit, so each traveler will get 23 pieces of fruit.
    Which means that each traveler will not receive the same number of each kind of fruit.

    HOWEVER,
    IF each of the 63 piles contain the same number of each kind of fruit and each traveler must receive the same number of each kind of fruit then the calculation will yield something different.

    Need a little clarification about the content of the piles and the distribution among the travelers.

    You may need \left( \dfrac{1449 \cdot 7}{63} = \right) 161 pieces of fruit in each pile.
    .
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Problem dealing with Euclidean Algorithm/gcd
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 10th 2011, 08:56 PM
  2. [SOLVED] Euclidean Algorithm
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: September 5th 2010, 07:45 PM
  3. Euclidean algorithm
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: January 19th 2010, 12:13 PM
  4. GCD and the Euclidean Algorithm
    Posted in the Discrete Math Forum
    Replies: 6
    Last Post: January 3rd 2010, 04:20 AM
  5. Replies: 1
    Last Post: June 23rd 2009, 06:44 AM

Search Tags


/mathhelpforum @mathhelpforum