Scribd Logo
Upload

Welcome to Scribd!

  • GoyalBipal - Problems of The Week 8

    Uploaded by

    Bipal Goyal
    13 views2 pages
    1. The document discusses problems involving decimal numbers and finding the smallest number. It provides several numbers as examples, such as 23999, 488, and 27777. 2. It also mentions finding the largest sum of 3 numbers from a set of 9 people, with the constraint that the largest sum must be 16. 3. To solve this, the document lists sending different people (represented by numbers) on different trips, and shows that by sending people 1, 6, 9 on the first trip and accumulating numbers from subsequent trips, they can achieve the target largest sum of 16.

    Original Description:

    Original Title

    GoyalBipal_Problems of the Week 8

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document discusses problems involving decimal numbers and finding the smallest number. It provides several numbers as examples, such as 23999, 488, and 27777. 2. It also mentions finding the largest sum of 3 numbers from a set of 9 people, with the constraint that the largest sum must be 16. 3. To solve this, the document lists sending different people (represented by numbers) on different trips, and shows that by sending people 1, 6, 9 on the first trip and accumulating numbers from subsequent trips, they can achieve the target largest sum of 16.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    13 views2 pages

    GoyalBipal - Problems of The Week 8

    Uploaded by

    Bipal Goyal
    1. The document discusses problems involving decimal numbers and finding the smallest number. It provides several numbers as examples, such as 23999, 488, and 27777. 2. It also mentions finding the largest sum of 3 numbers from a set of 9 people, with the constraint that the largest sum must be 16. 3. To solve this, the document lists sending different people (represented by numbers) on different trips, and shows that by sending people 1, 6, 9 on the first trip and accumulating numbers from subsequent trips, they can achieve the target largest sum of 16.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    mi3143s 12

    Probdems of Jeel 8

    w e taant hesmalet infegoy toit


    denhlal Umbers, then ldeg say
    w a Hhe Sallestdyit o d beig
    denhcal ong fhen the smallest baiy
    inkger k os Hhat Yeay
    7SSSS ill so

    bech
    we_cevld dcr tase ths ino 2,ht
    Lwe ncel b increase fhe denhtal d
    hat would be n ym bers e
    23999 488 277,766 66s

    Mouwevel e Ahor 22,727 we an

    25,777 hich has


    denkicaldigl t and i snaller thah
    al the ab0Ve num bey

    The ansun 7s7771


    2
    Ans' We have 9 peaple (7 ta) )4 ne lns
    Hee largast Sum ot 3 nmken
    e hieh
    asoa Syuare is 16

    hyst we Send 1,6,9


    Yein
    Sen 2,5,9
    Yehwn 9
    Send 3, 4,9
    ehm

    ere we_came at on Ssue, e lat


    sum LonE be 16 as k z aYe
    ho male16 e
    Yema ning Gond 1 in
    Jater add hem t ke l)
    2,S9
    Yen 9
    Send 3, 9
    Ye ftn 9
    Send 1,6,9
    Ve fn 1
    Sth 1,7,
    8
    Al set Min ps fepd T

    You might also like