A fort is a convex polygon 700m in perimeter.Patrols walk around the fort staying exactly 10m from it's walls.How far does the patrol walk in one circuit ?
Good luck.I don't even know what a convex polygon is!
My first question would be are they walking inside or outside,but as the question doesn't say,I suspect it doesn't matter!
@venda saidIf it were inside, the question wouldn't be answerable. (Consider a fort 10m wide and 70m long...)
A fort is a convex polygon 700m in perimeter.Patrols walk around the fort staying exactly 10m from it's walls.How far does the patrol walk in one circuit ?
Good luck.I don't even know what a convex polygon is!
My first question would be are they walking inside or outside,but as the question doesn't say,I suspect it doesn't matter!
(A convex polygon, by the way, is a rectangle, or a triangle, or any multi-lined shape with only external angles. A star, for instance, is not one - it has some reflex angles and is therefore concave.)
Anyway, the answer is
That's because, if you make a picture, you wil see that
The paper doesn't give a numerical answer but there is an explanation:-
The path proceeds in straight lines that are parallel and equal in length to the walls interleaved with arcs of a circle 10m in radius.The arcs combine to make a full circle
Way beyond me I'm afraid.
@venda saidDraw it. Start by looking up what a convex polygon is, draw some (start with a rectangle, it's easiest to think about), then draw how you would walk a fixed distance around it. It's easier to see than to talk about.
The paper doesn't give a numerical answer but there is an explanation:-
Hidden content removed
Way beyond me I'm afraid.
@venda saidI can do it in...
A chess variant is played on a large board but the knights L shaped move is 7 squares in one direction and 10 in another.If I want to move a knight one square horizontally,what are the fewest moves that I must make ?
Reasoning:
A railway system has 700 stations connected in a circle so that sometimes travellers have to call at 350 stations.New high speed services are proposed by the government that directly links stations 25 places apart,reducing the number of stations that have to be visited.The opposition argues that stations 28 apart should be linked instead.
Which proposal leads to the fewest visits in the worst case
@venda saidThe worst point for any system of direct links is the one that is just shy of 350, halfway between the direct links.
A railway system has 700 stations connected in a circle so that sometimes travellers have to call at 350 stations.New high speed services are proposed by the government that directly links stations 25 places apart,reducing the number of stations that have to be visited.The opposition argues that stations 28 apart should be linked instead.
Which proposal leads to the fewest visits in the worst case
With direct links of 25, the worst case is
With direct links of 28, the worst case is
Given that
Edit: the solution may well be wrong, because I forgot to consider
Edit: I think the given solution is OK. All that changes is that we do the small steps at the beginning of the trip, rather than the end.
@venda said
I asked lots of people what their favourite season is:
16 didn't choose summer,14 didn't choose Autumn,15 didn't choose winter and 12 didn't choose spring.
How many people did I ask ?
x=a+b+c+d
x=16+a
x=14+b
x=15+c
x=12+d
b+c+d=16
We can transform the last three equations thus:
b=a+2
c=a+1
d= a+4
After substituting b,c and d in equation 1 we get x=a+a+2+a+1+a+4 or x=4a+7
and substituting in equation 6 we get 16= a+2+a+1+a+4 or 16=3a+7
leading to a=3 and x=19.
So you asked 19 people, 3 choose summer, 5 choose Autumn, 4 choose winter and 7 choose spring.