Scribd Logo
Hochladen

Willkommen bei Scribd!

  • Number Theory: Die Hard Unique Factorization: Did It With Buckets: 3 Gal. & 5 Gal. 3 Gal. & 9 Gal. Now Gal. & Gal.?

    Hochgeladen von

    Kariem Mohamed Ragab Hamed
    47 Ansichten3 Seiten
    This document discusses generalized versions of the "Die Hard" problem of filling buckets with specific gallon amounts of water. It introduces the problem of filling buckets with a and b gallons and shows that the amounts can be any multiple of the greatest common divisor (gcd) of a and b. The document then claims and proves that the amounts can also be any linear combination of a and b gallons, by filling bucket a repeatedly and pouring into bucket b until the desired amount is reached. It concludes that this process does not require counting the number of fills, as filling bucket a and pouring into b until b is full will achieve the linear combination.

    Originalbeschreibung:

    mit

    Originaltitel

    MIT6 042JS15 Hard Primes

    Copyright

    © © All Rights Reserved

    Verfügbare Formate

    PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document discusses generalized versions of the "Die Hard" problem of filling buckets with specific gallon amounts of water. It introduces the problem of filling buckets with a and b gallons and shows that the amounts can be any multiple of the greatest common divisor (gcd) of a and b. The document then claims and proves that the amounts can also be any linear combination of a and b gallons, by filling bucket a repeatedly and pouring into bucket b until the desired amount is reached. It concludes that this process does not require counting the number of fills, as filling bucket a and pouring into b until b is full will achieve the linear combination.

    Copyright:

    © All Rights Reserved
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    47 Ansichten3 Seiten

    Number Theory: Die Hard Unique Factorization: Did It With Buckets: 3 Gal. & 5 Gal. 3 Gal. & 9 Gal. Now Gal. & Gal.?

    Hochgeladen von

    Kariem Mohamed Ragab Hamed
    This document discusses generalized versions of the "Die Hard" problem of filling buckets with specific gallon amounts of water. It introduces the problem of filling buckets with a and b gallons and shows that the amounts can be any multiple of the greatest common divisor (gcd) of a and b. The document then claims and proves that the amounts can also be any linear combination of a and b gallons, by filling bucket a repeatedly and pouring into bucket b until the desired amount is reached. It concludes that this process does not require counting the number of fills, as filling bucket a and pouring into b until b is full will achieve the linear combination.

    Copyright:

    © All Rights Reserved
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 3

    Mathematics for Computer Science

    Generalized Die Hard

    MIT 6.042J/18.062J

    Did it with buckets:


    Number Theory:

    3 gal. & 5 gal.


    Die Hard

    3 gal. & 9 gal.


    Unique factorization

    Now a gal. & b gal.?

    Albert R Meyer March 5, 2012 lec 5M.1 Albert R Meyer March 5, 2012 lec 5M.2

    Generalized Die Hard Generalized Die Hard

    Under Die Hard rules, Under Die Hard rules,


    gal.’s in each bucket are gal.’s in each bucket are
    linear combinations multiples of gcd(a,b)
    of a and b of a and b

    Albert R Meyer March 5, 2012 lec 5M.3 Albert R Meyer March 5, 2012 lec 5M.4

    1
    Generalized Die Hard Generalized Die Hard
    Claim: Can get any multiple of Claim: Can get any linear
    gcd(a, b) into a bucket combination of a, b into a
    (if there’s room for it). bucket (if there’s room for it).
    Namely, say 0 ≤ sa +tb < b.
    Get sa +tb into the b gal.
    bucket as follows:
    Albert R Meyer March 5, 2012 lec 5M.5 Albert R Meyer March 5, 2012 lec 5M.6

    Generalized Die Hard Generalized Die Hard


    assume s > 0. do s times:
    fill bucket a, pour into b In fact, no need to count:

    — if b fills, empty it. fill bucket a, pour into b

    total fills = sa — if b fills, empty it


    0 ≤ amount left < b — until desired gal.’s in b !

    # b emptyings must be -t
    Albert R Meyer March 5, 2012 lec 5M.7 Albert R Meyer March 5, 2012 lec 5M.8

    2
    MIT OpenCourseWare
    http://ocw.mit.edu

    6.042J / 18.062J Mathematics for Computer Science


    Spring 2015

    For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms .

    Das könnte Ihnen auch gefallen