Ravi has a gold chain with N links, such that links are numbered from 1 to N. Ravi wants to cut the links into groups of one or more links, in such a way that he can pay salary to Ritika by paying any number of links she may ask for her work on contract basis. But since cutting a gold chain comes with the cost, he has to be very smart while cutting it. One cut means a link is cut at one place.
Q1. If N = 865, then what is the minimum number of cuts that Ravi should make?
Q2. If Ravi made 8 cuts, then what is the maximum possible value of N?
Answers
Ravi has a gold chain with N links, such that links are numbered from 1 to N. Ravi wants to cut the links into groups of one or more links, in such a way that he can pay salary to Ritika by paying any number of links she may ask for her work on contract basis. But since cutting a gold chain comes with the cost, he has to be very smart while cutting it. One cut means a link is cut at one place.
Q1. If N = 865, then what is the minimum number of cuts that Ravi should make?
Q2. If Ravi made 8 cuts, then what is the maximum possible value of N?
Answer:
Q.1. If N= 865, then what is the minimum number of cuts that Ravi should make?
answer- 7 cuts.
Q.2. If Ravi made 8 cuts, then what is the maximum possible value of N?
answer- 866.
Explanation:
Given Data= N= 865
n= no. of cuts= no. of single links.
no. of sets = n+1
values of sets-
(n+1),(2n+2),(4n+4),(8n=8),(16n+16),(32n+32)....................
n= no. of cuts= no. of single links= 7
no. of sets= 8
Values of sets = 3,6,13,27,54,108,216,432,865.
The below image shows you the detailed calculations of the above question.
To learn more click here-
https://brainly.in/question/48483183
To learn more click here-
https://brainly.in/question/5612348
