Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Problem of The Week Problem D and Solution The Second of Three Average Problems

    Uploaded by

    Rajiv Kabad
    The document describes a problem involving tokens in a bag with numbers stamped on them. The average of all tokens was originally 56, but after removing a token with 68, the average of the remaining tokens was 55. This allows determining that there were originally 13 tokens in the bag, with a total value of 728. The largest number that could be on any single token is 649.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Problem of The Week Problem D and Solution The Second of Three Average Problems

    Uploaded by

    Rajiv Kabad
    37 views1 page
    The document describes a problem involving tokens in a bag with numbers stamped on them. The average of all tokens was originally 56, but after removing a token with 68, the average of the remaining tokens was 55. This allows determining that there were originally 13 tokens in the bag, with a total value of 728. The largest number that could be on any single token is 649.

    Original Description:

    amc problem of the week

    Original Title

    POTWD-13-NA-01-S

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a problem involving tokens in a bag with numbers stamped on them. The average of all tokens was originally 56, but after removing a token with 68, the average of the remaining tokens was 55. This allows determining that there were originally 13 tokens in the bag, with a total value of 728. The largest number that could be on any single token is 649.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    37 views1 page

    Problem of The Week Problem D and Solution The Second of Three Average Problems

    Uploaded by

    Rajiv Kabad
    The document describes a problem involving tokens in a bag with numbers stamped on them. The average of all tokens was originally 56, but after removing a token with 68, the average of the remaining tokens was 55. This allows determining that there were originally 13 tokens in the bag, with a total value of 728. The largest number that could be on any single token is 649.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    WWW.C E M C .U WAT E R LO O.

    C A | T h e C E N T R E fo r E D U C AT I O N i n M AT H E M AT I C S a n d CO M P U T I N G

    Problem of the Week


    Problem D and Solution
    The Second of Three Average Problems
    Problem
    Some tokens are placed in a bag. Each of the tokens has a positive integer stamped on one of
    its sides. The other side is blank. It is possible that more than one token in the bag has the
    same number stamped on it. The average of all the tokens in the bag is 56. If a token with the
    number 68 on it is removed from the bag, the average number on the remaining tokens is 55.
    Determine the largest possible integer that could appear on one of the tokens in the bag.

    Solution
    To calculate an average, determine the sum of the numbers in the set and divide by the
    number of numbers in the set. It follows that the sum of the numbers in a set is the average
    times the number of numbers in the set.
    Let n represent the number of tokens in the bag.
    The total of the numbers on all of the tokens in the bag is 56n. After the token with the
    number 68 stamped on it is removed, the total of the numbers on the remaining tokens is
    (56n 68) and there are (n 1) tokens remaining in the bag. The average of the tokens
    remaining in the bag is 55 so it follows that
    56n 68
    n1
    56n 68
    56n 68
    n

    = 55
    = 55(n 1)
    = 55n 55
    = 13

    Since n = 13, there were originally 13 tokens in the bag and the total of the tokens in the bag
    was 56n = 56(13) = 728.
    To determine the highest possible value on a token, stamp eleven of the tokens with the
    smallest possible positive integer, namely 1. The twelfth token has the number 68 stamped on
    it. The largest possible value that could be stamped on the remaining token is,
    728 11 1 68 = 649.
    As an extension, consider how the answer would change if no two tokens were stamped with
    the same number.

    You might also like