Puzzle, draw this without taking your pen off your paper? ?!


Question: Puzzle, draw this without taking your pen off your paper!? !?
see if you can do this if you can i need you to tell me, i cant figure it out

you cant take you pen off the paper or go over a line that you already drew

http://s443!.photobucket!.com/albums/qq160!.!.!.

there are two pics one is numbered!. Use the numbers to explain what you did
ex!.
1-3straight line, 3-4 curved line, 4-1straightline!.!.!.!.(this isnt how it starts btw it is just an example)Www@Enter-QA@Com


Answers:
You can do this by a trick!. Take a sheet of plain paper!. Fold it to 1/3 size!. Start drawing a straight line from the face sheet to the folded one!.(4 - 1) the pen reaches the folded sheet then draw straight line
1 -3 and again draw 4 -1 which it reaches the face sheet!.
Now the face sheet lines would like like this " | | " with this base one can complete the rest without removing the pen or draw over the line!.

Www@Enter-QA@Com

This is actually solvable, it just requires some trickery!. First draw all the outside rounds, then do an hourglass pattern inside!. Draw a line along the side that hasn't been drawn on yet, and then *carefully, and without creasing* fold the edge of the paper over!. Arc over to the other line, and then finish the drawing!. Unfold the paper, and make sure no one looks on the other side!. There you go, you just made an impossible drawing!Www@Enter-QA@Com

i know how to do it its just hard to explain!.
do ark 4 to one then bottom line of that then go down then go up the loop then diagnol then loop up then go down line then across then rightWww@Enter-QA@Com

Sabbu is rightWww@Enter-QA@Com

No, sorry, that is really hard!.Www@Enter-QA@Com

This puzzle is impossible!. The reason for this is that more than two vertices have an odd number of edges!. In fact, they ALL have an odd number of edges!.

For each time you arrive at a vertex, you must leave the vertex!. So coming and going comes in pairs!. You cannot visit a vertex with an odd number of pairs, cover all adjacent edges, then get away!. So the exception is where you start and end -- you can cover all edges connected to these, but never for the vertexes that you neither started nor ended at!.

also, notice that the graph is in every way symmetrical, so it doesn't matter where you start!. You can "brute force it" by trying everything from say, vertex 1 to see that it can't be done!.

In this case, if any one line were to be deleted from the puzzle then it would become possible (because then only two vertexes would have an odd number of edges, and then those would be where you start and end)!.Www@Enter-QA@Com



The answer content post by the user, if contains the copyright content please contact us, we will immediately remove it.
Copyright © 2007 enter-qa.com -   Contact us

Entertainment Categories