A group of monkeys have N bananas in day 1. In the next each day, these monkeys eat half the number of current bananas plus one more banana. When the number of the banana n is odd, its half is counted as the lower bound. For example, when n = 21, half of n should be 10, and 10+1=11 bananas will be eaten on this day. • Write a program to compute the number of bananas N in the first day, based on the current day d and current number of bananas n. The input of the program should be the current day d and current number of bananas n, and the output of the program should be the number of bananas N in the first day. We assume that before day d, the number of bananas n in every previous day is even. For example, if in day 3 we have n3 = 12, then the number of bananas in day 2 should be n2 = (n3 +1)∗2 = 26, and the original number of bananas in day 1 should be N = n1 = (n2 +1)∗2 = 54.
A group of monkeys have N bananas in day 1. In the next each day, these monkeys eat half the number of current bananas plus one more banana. When the number of the banana n is odd, its half is counted as the lower bound. For example, when n = 21, half of n should be 10, and 10+1=11 bananas will be eaten on this day. • Write a program to compute the number of bananas N in the first day, based on the current day d and current number of bananas n. The input of the program should be the current day d and current number of bananas n, and the output of the program should be the number of bananas N in the first day. We assume that before day d, the number of bananas n in every previous day is even. For example, if in day 3 we have n3 = 12, then the number of bananas in day 2 should be n2 = (n3 +1)∗2 = 26, and the original number of bananas in day 1 should be N = n1 = (n2 +1)∗2 = 54.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
A group of monkeys have N bananas in day 1. In the next each day, these monkeys eat half the number of current bananas plus one more banana. When the number of the banana n is odd, its half is counted as the lower bound. For example, when n = 21, half of n should be 10, and 10+1=11 bananas will be eaten on this day.
• Write a program to compute the number of bananas N in the first day, based on the current day d and current number of bananas n. The input of the program should be the current day d and current number of bananas n, and the output of the program should be the number of bananas N in the first day. We assume that before day d, the number of bananas n in every previous day is even. For example, if in day 3 we have n3 = 12, then the number of bananas in day 2 should be n2 = (n3 +1)∗2 = 26, and the original number of bananas in day 1 should be N = n1 = (n2 +1)∗2 = 54.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education