Aaron takes a square sheet of paper with one corner labelled as . Point is chosen at random inside the square and Aaron folds the paper so that and coincide. He cuts the sheet along the crease and discards the piece containing . Let be the probability that the remaining piece is a pentagon. Find the integer nearest to .
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.
EDIT : point A is the bottom right vertex of square
It is not very hard to think that locus of limiting position of the required point P is indeed the boundry of shaded region , with the knowledge of this fact the problem becomes almost trivial .
We want all points that lie inside of the boundry of the shaded region ,
So required probability = total area of square area of shaded region
Take the side length 1 {as the side length doesn't effect probability} and on simple calculations you will find that the area of shaded region is 2 π − 1 which would be numerically equal to the probability as area of square equals 1 .
Thus required probability is 0 . 5 7 0 7 9 6