Index-1              Index-2              Home Page

Print at least 5 possible values

Problem-1:

·         An ice cream truck visits Mr. Akhtar's neighborhood every 4 days during the summer. Unfortunately, he missed it today. When can Mr. Akhtar expect the ice cream truck to visit her neighborhood again? Print at least 5 possible values. 

  Problem-2:
·         During the summer months, one ice cream truck visits Adina's neighborhood every 4 days and another ice cream truck visits her neighborhood every 5 days. If both trucks visited today, when is the next time both trucks will visit on the same day?











Hints:
To find the Least Common Multiple of two or more whole numbers, follow this procedure:
  1. Make a list of multiples for each whole number.
  2. Continue your list until at least two multiples are common to all lists.
  3. Identify the common multiples.
The Least Common Multiple (LCM) is the smallest of these common multiples

Find the LCM of 12 and 15. 



Common multiples of 12 and 15 are 60 and 120

The least common multiple of 12 and 15 is 60.
Solution:  
LCM = 60  


Source Code

Problem-1:

Problem-2: 

2 comments:

  1. /* problem 2 */
    #include
    #include
    int main()
    {
    int a,b,truck1=4,truck2=5,t,gcd,lcm;
    a=truck1;
    b=truck2;
    printf("posibility of vist same day is:");
    while(b!=0)
    {
    t=b;
    b=a%b;
    a=t;
    }
    gcd=a;
    lcm=(truck1*truck2)/gcd;
    printf("%d",lcm);
    return 0;
    }

    ReplyDelete
  2. Id:201820505
    Batch:58th
    #include
    #include
    int main()
    {
    int a,b,truck1=4,truck2=5,t,gcd,lcm;
    a=truck1;
    b=truck2;
    printf("posibility of vist same day is:");
    while(b!=0)
    {
    t=b;
    b=a%b;
    a=t;
    }
    gcd=a;
    lcm=(truck1*truck2)/gcd;
    printf("%d",lcm);
    return 0;
    }

    ReplyDelete