Largestrectangle

Consider the problem of constructing the largest rectangle with
perimeter equalling p. This is a constrained optimization

problem where we are seeking for the largest rectangle subject
to constraint on its perimeter. This can be formulated as follows.
Let us assume that l is the length of rectangle and y its width.
Then
Maximize f (x , y )=xy
Subject to 2(x + y )= p
We get y=
p−2 x
2 Then f 1 ( x)=f (x , y)=x ( p−22 x )= px2 −x
2
p p p
'
f ( x)= −2 x=0 ⇒ x= ⇒ y =
2 4 4
implying it is a square.
y
DA B
C
x A
Your
BB D
E A
h
th
B C
G F
The second problem is to maximize area of a rectangle

inscribed in an arbitrary triangle ABC. Let height of ABC be h
and that of the desired rectangle be th. Then area of the
rectang DEFH is th(BC−BG−CF)=th(BC−thCotB−thCotC )
Note that BC=hCotB+hCotC . So
th(BC−(BG +CF))=th(BC−tBC )=BCth(1−t ) is a function of t
1
So area of DEFG=f (t )=BCth(1−t)⇒ f (t)=BC (1−2 t)=0 ⇒ t= 2
'
So rectangle having half the height of ABC has the largest area.
Let ABCD be a large rectangular building of length l and width
w. Inside this building there is a room of length p and width q
l− p w−q
but located symmetrically with corridor of width 2 = 2 . The
problem is to determine the largest length of a stick that can be
crawled along the corridor through the corners. Let any such
stick has endpoints in the corner as ( s , 0 ) and (0 , t) making its
length equalling √❑ The equation of such a line can be written as
x y
+ =1
s t
This equation must satisfy lower left corner of the red rectangle
for the stick to be of the largest length. So
(l− p)/2 (l− p)/2 1 1 2

+ =1⇒ + =
s t s t l− p
So our optimization problem is to maximize
2 2
f ( s , t )=s +t
1 1 2
Subject to + =
s t l− p
So this is a constrained optimization problem. We can express
1
t=
2
−
1 Putting the value of t in the formula for
l− p s
( ) ( )
2 2
2 1s (l− p) 2
f ( s , t )=f 1 ( s ) =s + =s + ¿
2 1 2 s+ p−l¿
−
l−p s
'
f 1 ( s ) =2 s+ 2 ( 2 s+ p−l )
s (l− p) ( l− p ) ( 2 s + p−l )−s ( l− p ) 2
( 2 s+ p−l ) 2
3 2
=0 ⟹ 2 s ( 2 s+ p−l ) +2 s ( l− p ) ( 2 s+ p−l−2 s )
3 2
⟹ ( 2 s+ p−l ) −( l− p ) ( l− p ) =0
⟹ 2 s+ p−l=l− p ⟹ s=l−p From where t=l− p and length of the largest
stick will be (l− p) √❑
Two friends want to undertake a journey from hall to the

playground of distance with the only well trained horse they
have that is capable to carry only one of them at a point. Speed
of horse v ≫ v h m
They want to start the journey together and reach the

destination together in minimum time. How can they plan for the
journey and what is the minimum time required for the journey?
d
x
In order for them to require the same amount of time both of

them should walk the same distance and on horse top as well
they will have to be the same amount of time. So
d− x=
x
v +
( x−
x
v v
vh m m )
vh m v h +v m
x x ( v h−v m ) v m
⟹ d−x= v +
v h m v h ( v h + v m)
x v m [ ( v m+ v h ) + ( v h−v m ) ]
⟹ d−x=
v h (v h + v m)
2 x vm vh
⟹ d−x=
v h (v h + v m)
2 x v m v h+ x v h (v h + v m)
⟹ d=
v h ( v h + v m)
x v h [2 v m + ( v h+ v m ) ]
⟹ d=
v h (v h + v m)
d v h (v h +v m)
⟹ x=
v h [2 v m + ( v h+ v m ) ]
d (v h + v m )
⟹ x=
( v h +3 v m )
Solve the problem for 3 friends and one horse.

Solution: Horse will make backward movement equal amount of
time for the 2nd and 3rd friends. Let d be the total distance and
v ≫ v be the speeds of horse and friends respectively.
h m
x
(x− v )v
2nd friend walks x
v +
vh m m the second fraction being for the
vh m vm+ vh
horse to go back. So the third friend will again have to walk the
same distance. So walking distance for the third friend will be
equated to the first one
d− x=2¿ ]
d= x+2 ¿]
d=2 x ¿]
d (v h+ v m )
x=
v h +5 v m
So if there are n friends then the equation is

d− x=(n−1)¿ ]
d (v h + v m)
Hence x= ❑
v +(2 n−1) v m
h
Exercise 1: Assume that the horse can carry 2 friends at a time,

and you have n friends to undertake the journey. What is the
solution?
Exercise 2. You have n persons to move from one place to another.
You have k buses each can at a time give lift to m persons. What is
the minimum time for giving lift to destination?
Shortest path from a point A to B touch a straight line L.

So you have an empty tub and now you walk to the bank of the
river to fill it with water and then reach your piece of land B to
water it. What is the minimum distance?
There are n sticks (n>1) in a stack. Two persons play the game
with the first player in his first turn never removes all. Every
subsequent player must remove at least one, if there is, and at
most double the number of sticks his opponent removed in his last
turn. Player emptying the stack wins the game. How should the
game be played ?
A
AP+PC>=AC=AP’+P’C
P’
P
16.6.2021
1. There was a carpenter Ali in a village
who built houses only for those who did
not build their own houses. Who built
carpenter Ali’s house? Paradox
2. Rahim says,”I am a liar.” What is Rahim
actually? Paradox
3. You arrive at a place where the road got
divided into two branches one leading to
Post Office and the other to a university,
which not known. A man standing on the
fork speaks the truth and lies alternately.
What is the single question for finding the
university branch?
4.
Answer: Which way to post office are you going to show to the
next person?
5. The horse problem can be generalized by having m horses
and n friends for the journey with m<n.
23.6.2021(Assignment)
6.A couple invited 4 couples in a dinner party. Those
who did not know each other got acquainted by
shaking hands. You can only assume that husband
and wife know each other. At the end of the party
while leaving land lord (host husband) asked
everybody else how many people he/she shook hands
with, to which everybody responded with a different
number. How many people did the host husband
shake hands with?
7. Dirac’s mathematical problem. 3 friends caught fish
and then being tired went to sleep. At night the first
friend woke up and distributed fish equally and threw
an extra fish into the sea, kept his share separately
and all remaining together, and then fell asleep. The
second repeated the same, so is the third friend. In
the morning all of them woke up and found the same
number of fish they caught. How many fish did they
catch?
8. 5 friends gathered some coconuts. Being tired

they fell asleep. At night 1st friend got up divided the
pile into equal shared, took his share and the extra
one coconut was given to the monkey. The piles were
put together again. This was done exactly by all 5
friends. In the morning all of them woke up and
divided the pile equally with one extra coconut to the
monkey again. What is the minimum number of
coconuts?
9.There are 50 coins on the table with 10 heads up. Now
you are blindfolded. You are allowed to toggle the coins
as you like. You are then supposed to divide them into
two piles not necessarily having the same number of
coins so that each pile has equal number of heads up.

Largestrectangle

Uploaded by

Copyright:

Available Formats

Largestrectangle

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Largestrectangle

Uploaded by

Copyright:

Available Formats

Consider the problem of constructing the largest rectangle with

perimeter equalling p. This is a constrained optimization

The second problem is to maximize area of a rectangle

(l− p)/2 (l− p)/2 1 1 2

Two friends want to undertake a journey from hall to the

They want to start the journey together and reach the

In order for them to require the same amount of time both of

Solve the problem for 3 friends and one horse.

So if there are n friends then the equation is

Exercise 1: Assume that the horse can carry 2 friends at a time,

Shortest path from a point A to B touch a straight line L.

8. 5 friends gathered some coconuts. Being tired

You might also like