Dhelia wants to grow rose, orchid, and jasmine trees in her garden. Planting a rose trees requires a 2 square meters, planting b orchid trees requires 5 b square meters, and planting c jasmine trees requires c 3 square meters. If she plants 1 0 trees, what is the minimum amount of space (in square meters) that her garden will occupy?
This problem is posed by Dhelia D.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We note that the area covered by n rose trees is less than than the area of n orchid trees for n < 5 , i.e. n 2 < 5 n ⟹ n < 5 ⟹ 1 ≤ n ≤ 4 . We also note that n 3 ≤ 5 n ⟹ n 2 ≤ 5 ⟹ 1 ≤ n ≤ 2 . We also however note that n 3 < n 2 ⟹ n < 1 , which yields no solutions for n . From this so far we have that there will be 4 non-rose trees since that minimises the area and so we'll have 6 rose trees for an area of 3 0 . The remaining 4 are to be orchid/jasmine trees. We now note that n 3 = n 2 ⟹ n = 1 . Since n 2 < n 3 for all n > 1 , we take 1 Jasmine tree and 3 orchid trees. Hence the minimal area is:
3 0 + 3 2 + 1 3 = 4 0 .
(Sadly enough, I accidentally put in the wrong answer 3 times in a row =[)
Would also work wid 6 orchids, 1 Jasmine and 3 roses, since 3^2 - 2^2 = 5, which may also increase d no. by 5
Log in to reply
Yes. This is another solution for exactly the reason that you provided. I did notice this other solution, but it was irrelevant so I left it out.
Log in to reply
the answer is completely relevant
Log in to reply
@Diltang Tong – I didn't think that it is, because the question asks for the minimum amount of garden space, not for all of the possible arrangements of trees.
Ben, what level math are you currently learning?
Log in to reply
If you mean at school, I am not learning math. If you mean on the website, I just used a checkpoint and got it over with.
Since the 7th grade, I have been learning mathematics independently using resources from the Internet. I am not learning a specific "level" of math, I just follow whatever interests me. Because of this, there are certain subjects, especially combinatorics and geometry, that I am relatively behind on.
I have most recently been interested in number theory and combinatorics, among other unrelated things.
beauty
it can also be 6 orchid, 3 rose and 1 jasmine
2 rose, 1 jasmine and 7 orchids..
another possibility is rose 2 trees,orchid 7 trees,jasmine 1trees then how you functions did not show??
Great Explanation ... thanks
Clearly we don't want to have too many jasmine trees, as that would take up a lot of space.
Let's see what we can do with no jasmine trees.
We want to minimize a 2 + 5 b where a and b are integers that sum up to 10. If we have a = 2 or a = 3 , this will be minimized at a value of 44.
Now let's have one jasmine tree. This is 1 square meter.
Now we want to minimize a 2 + 5 b , this time where they sum up to nine. This is minimized at a = 2 . We have 2 2 + 7 × 5 + 1 3 = 4 0 .
Now let's try two jasmine trees. This is 8 square meters.
This time a and b sum to 8, minimized at a = 2 and b = 6 , giving 2 2 + 6 × 5 + 8 = 4 2 . Uh-oh, we're getting bigger.
Clearly getting even more jasmine trees is not the solution. The minimum amount of space is therefore equal to 4 0 ■ .
Let a , b , c be the number of rose orchid and jasmine trees.As we have one equation given but three variables. The area required is p a + b + c = 1 0 a 2 + 5 b + c 3 = p p = 5 0 + ( a 2 − 5 a ) + ( c 3 − 5 c ) Deciding the values for a and c for the minimum value of ∗ ∗ ( a 2 − 5 ) ∗ ∗ a n d ∗ ∗ c 3 − 5 c ∗ * respectively independently. Take into consideration that a and c are non-negative integers we get the value of p as 4 0
Treat the problem like a marginal problem in economics. Find the lowest additional area required for each sucessive tree. The first one will be either a jasmine or rose, each requiring 1 square meter, and the second would be the other one. Third would be a rose tree, because going from 1^2 to 2^2 is 3, which is less than 5 or 7 (for orchid or jasmine). After the 2 rose and one jasmine, the rest must be orchid, because that has the lowest value. So 7 orchid. 7 * 5 + 2^2 + 1 = 35 + 4 + 1 = 40.
Okay so I thought it like this: Consider the equation: a+b+c = 10, a, b, c are non-negative integers.
Now, we need to minimize a 2 + 5b + c 3
Clearly, we have the inequality c <= a <= b. Setting c = 1 and trying out the few initial cases, answer comes out to be 40.
Firstly- THIS QUESTION IS NOT COMBINATORICS- IT'S CALCULUS
Solution: a + b + c = 1 0
b = 1 0 − a − c
let D denote the Area
D = a 2 + 5 b + c 3
Subbing in rearranged expression for b we get
D = a 2 + 5 ( 1 0 − a − c ) + c 3
D = a 2 − 5 a + c 3 − 5 c + 5 0
For now as long as a + b ≤ 9 we're fine- we can think of a and c as being independent.
It is just a case of differentiating which I won't bother to type and finding the nearest integer values to where these these minimum points occur.
So minimum for a 2 − 5 a occurs at a = 2 5 nearest value is 2 (or 3 gives the same answer) Minimum is 2 2 − 5 ( 2 ) = − 6 = 3 2 − 5 ( 2 )
Minimum for c 3 − 5 c occurs at c 2 = 3 5 after differentiating nearest integer c is 1 or 2 .
1 3 − 5 ( 1 ) = − 4 and 2 3 − 5 ( 2 ) = − 2 so minimum is − 4 .
So minimum for D is − 6 − 4 + 5 0 = 4 0
We can introduce 3 variables r,o,j which represent the number of each type of tree. This allows us to form an equation for the area A which we can then minimise. A = 5 o + r 2 + j 3 We have the constraint such that r + o + j = 1 0 We can then rearrange for o o = 1 0 − r − j And substitute this into the original equation A = j 3 + r 2 − 5 j − 5 r + 5 0 A = j ( j 2 − 5 ) + r ( r − 5 ) + 5 0 Now we minimise A for this we know that j and r have to be greater than 0 By inspection the minimum returned from j ( j 2 − 5 ) Is − 4 w h e n j = 1 The minimum returned from r ( r − 5 ) Is − 6 w h e n r = 2 o r r = 3 We know that the sum has to be 10 r + o + j = 2 + o + 1 = o + 3 or r + o + j = 3 + o + 1 = o + 4 o = 7 o r o = 6 Subbing these values into A A = 5 ( 7 ) + 2 2 + 1 3 = 4 0 and A = 5 ( 6 ) + 3 2 + 1 3 = 4 0 Hence minimum A is 40
Let a , b and c be the numbers of rose, orchid and jasmine trees we require, accordingly.
Note that since the area required for rose trees and jasmine trees grows exponentially, they remain optimal up until a certain number. In this case, that number is 5 , since the area required for the orchid trees increased by 5 for each tree, meaning that a single tree will need 5 square meters. Every area smaller than that is in our favor.
Therefore, we may take rose and jasmine trees until the area required for them goes above 5 .
Rose trees
We are have to take exactly 2 rose trees in order for their area to be smaller than 5 , meaning that a = 2 .
Jasmine trees
We may take a single jasmine tree in order for the area required for it to be smaller than 5 , meaning that c = 1 .
Orchid trees
The rest of the trees we require will be orchid, since any higher value for the previous two will result in greater area. Thus, b = 1 0 − 3 ⇒ b = 7 .
Finally, the total area for this set of trees would be P = a 2 + 5 b + c 3 ⇒ P = 4 0 .
I think what the question requires is that the increase in space caused by the increase in one tree must be less than five, for if it is greater than five then orchid trees would be more optimal. You solution still works out even though it is flawed.
Log in to reply
I don't understand what you mean. That's exactly what I was trying to point out in my solution. Could you please elaborate a bit further what you consider wrong or flawed in it? Thanks in advance!
Log in to reply
Also, you have an error. In the third bullet under Rose Trees, 3 trees require eight square meters.
You were basing how many of each tree you need off of the fact of how many square meters a certain number of Rose Trees or Jasmine Trees would require. The key thing to note is what was in Nathaniel's solution, how the differences between consecutive amounts of trees are minimized.
For example, the difference between consecutive amounts of Orchid Trees will be a constant 5. When the difference between consecutive amounts of the other two trees are greater than five, it is clear that the Orchid Tree would be a more optimal choice because it will use less square meters. You had been basing it off of, not the difference, but the whole number of square meters needed for consecutive amounts of trees.
For Rose Trees, 0 trees = 0 sq m, 1 tree = 1 sq m, 2 trees = 4 sq m, 3 trees = 9 sq m, 4 trees = 16 sq m, etc. The differences between consecutive amounts of trees would therefore be 1, 3, 5, 7,... Since these differences tend to get larger, we cut it off when the sequence gets above five, which is at three Rose Trees. Your method examined the square meters of each rose tree amount, not the differences.
Also note that having 2 rose trees and 7 orchids comes out to be the same as 3 rose trees and 6 orchids in square meters.
I hope you understand. :)
Log in to reply
@Bob Krueger – Ah, I see your point now. Thank you very much :)
the min. values of a^2 and c^3 would be 1 so let us assume 1 rose and 1 jasmine and hence 10-2=8 orchid trees. so total area req.=1^3 + 1^2 +5 8 =42. let us assume 2 rose trees 1 jasmine tree now orchid will be 7 hence total area req. 2^2=4 + 1^3=1 + 7 5=35 which sum upto 40. which is min. area
well.... the most rapidly increasing quantity is c^3 coz its derivative being 3c^2 so increasing no. of jasmines will never give me a mininum.... so taking c=1 now rate of change of a^2 being 2a .... i'd like to keep 2a<5b so i assume two values of a i.e 2 &3
for both these values the result of a^2 + 5b + c^3 = 40
3 apple trees + 1 jasmine tree + 6 orchid trees
I'll just say that if you already built n trees and going to build 1 more trees, how many more sq.m. do you need.
Here's the pattern of number of sq.m. do you need more to build. (Start from building 1 tree, then how many more.)
Rose: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19. (Why is it increasing like that? 1 + 3 + 5 + . . . + ( 2 n − 1 ) = n 2 .)
Orchid: 5, 5, 5, 5, 5, 5, 5, 5, 5, 5.
Jasmine: 1, 7, 19, 37, 61, 91, 127, 169, 217, 271.
You can choose to build any trees, but we don't need to increase the number of spaces we need.
In this one, you choose rose first, then choose jasmine, then choose rose, and so on....
Start(1, 5, 1) -> (3, 5, 1) -> (3, 5, 7) -> (5, 5, 7)
Do this 10 steps and we get {R,J,R,R,O,O,O,O,O,O} or {R,J,R,O,O,O,O,O,O,O}.
Therefore, the minimum = 3 2 + 5 × 6 + 1 3 = 4 0 . (another one also gets 40.)
grow 2 rose trees, 7 orchid and 1jasmine tree....because cube of any no. produces large no. so we must take cube of less no.as we have taken only one...
sqrt = raiz quadrada
A = x² + 5y + z³ x + y + z = 10 --> y = 10 - x - z
portanto A = x² - 5x + z³ - 5z + 50
dA/dx = 2x - 5 = 0 --> x = 2,5 dA/dz = 3z² - 5 = 0 --> z = sqrt(5/3)
P = (2,5 ; sqrt(5/3))
d²A/dx² = Axx = 2 d²A/(dx . dz) = Axz = 0 d²A/(dz . dx) = Azx = 0 d²A/dz² = Azz = 6z
H(2,5 ; sqrt(5/3)) = Axx(2,5 ; sqrt(5/3)) . Azz(2,5 ; sqrt(5/3)) - Axz(2,5 ; sqrt(5/3)) . Azx(2,5 ; sqrt(5/3)) H(2,5 ; sqrt(5/3)) = 2 . 6 . sqrt(5/3) H(2,5 ; sqrt(5/3)) = 12 . sqrt(5/3) > 0
Axx(2,5 ; sqrt(5/3)) + Azz(2,5 ; sqrt(5/3)) = 2 + 6 . sqrt(5/3) > 0
H > 0 e Axx + Azz > 0 então P = mínimo
substituindo o ponto P na área A(2,5 ; sqrt(5/3)) = 39,45
arredondando A(2,5 ; sqrt(5/3)) = 40
Please, advise me if im wrong. The question can be re-written as follows:
"Find the minimum value of a 3 + b 2 + 5 c where a + b + c = 1 0 and they are non-negative integers".
5 n < n 2 if n ≥ 6 . So, if I want to minimize, shouldn't I take c = 6 ? (this is the point in which I want you to advise me)
Then, our expression turns to be a 3 + b 2 + 3 0 , with a + b = 4 . We can check the five cases, but clearly the minimum is when a = 1 and b = 3 . This yields 1 3 + 3 2 + 3 0 = 4 0 .
Well, I see now that c is not necessarily 6 . But it should be ≥ 6 , so one get 5 possibilities for c , and finding the triplets ( 1 , 3 , 6 ) and ( 1 , 2 , 7 ) , both yields a minimum of 4 0 . I guess it's valid now since checking 5 values isn't a very difficult job.
First, you want to keep the Jasmine Trees as Small As Possible since they cover the most space. Keep it at 1. Since There are 9 trees left, you want to use a 3 - 6 split. Since 3^2 is less than 6^2, use 3^2 instead. That gives you 9 so plant 3 rose trees. 9+1=10. The Remaining 6 "seeds" can be used to plant orchid trees which requires a decent amount of space. 5(6)= 30. 9 + 30 + 1= 40.
Slight care has to be taken in justifying why that is indeed the minimum. For example, why do we use 1 Jasmine tree, instead of 0? Also, why must we want to use a 3-6 split and nothing else?
The ambiguity here is that Dhelia wants to grow rose, orchid, and jasmine trees. This implies that she wants to grow ALL of them. The answer assumes that she may grow 0 of one kind of tree. This initially threw me off, but I eventually got it.
This seems more of an Hit and Trial approach rather than real solving...This can be done much more elegantly by simple algebra
Problem Loading...
Note Loading...
Set Loading...
Let R ( n ) , O ( n ) , and J ( n ) denote the amount of space in square meters required to plant n Rose, Orchid, or Jasmine trees, respectively. We will now find the increase of each function when adding one more tree.
O ( n + 1 ) = 5 ( n + 1 ) = O ( n ) + 5
R ( n + 1 ) = ( n + 1 ) 2 = R ( n ) + 2 n + 1
J ( n + 1 ) = ( n + 1 ) 3 = J ( n ) + 3 n 2 + 3 n + 1
For minimal garden space, we will increase the most efficient functions at each stage, until we reach 1 0 trees. We will compare the efficiency of the other trees to the Orchids, because O ( n ) has a constant increase of 5 (square meters) per tree.
When is the increase in R ( n ) less than of O ( n ) ?
2 n + 1 < 5 ⇒ n < 2 , meaning that we can take two Rose trees.
When is the increase in J ( n ) less than of O ( n ) ?
3 n 2 + 3 n + 1 < 5 ⇒ n < 1 , meaning that we can take one Jasmine tree.
We now have a total of three trees, and the rest will be seven Orchid trees. Summing the areas, we get,
R ( 2 ) + J ( 1 ) + O ( 7 ) = 4 + 1 + 3 5 = 4 0