Walk down same street only once

Home Forums Maths and Numerical Reasoning Walk down same street only once


This topic contains 2 replies, has 2 voices, and was last updated by  kathyayani-adluri 1 year, 1 month ago.

Viewing 3 posts - 1 through 3 (of 3 total)
  • Author
  • #89164


    How do we solve these kind of problems please?
    Jason and his friends are delivering leaflets around the local housing estates.
    Jason wants to choose a housing estate where he won’t have to walk down the same street more
    than once (he can pass over the same corners more than once). On which of these five street
    plans is this possible?




    These questions need you to first identify the type of corners/vertices as either ODD (an odd number of roads leading to that corner) or EVEN (an even number of roads leading to them).Do this for all of the road plans bearing in mind the following …

    The correct route, that is the one where the same corners can be passed over but not the same road, is the one where there are 2 or less ODD vertices (corners), any more than it is not possible, so all even vertices is also possible.

    Once you know how to do these, they provide an easy mark.

    Hope that helps.



    Thanks a lot… It does help…

Viewing 3 posts - 1 through 3 (of 3 total)

You must be logged in to reply to this topic.