Its not really possible since there was no law stating you can go in between two intercepting lines, even if you calculate its trajectory f to z its still impossible, compute F(x) to -∞ if you go the graph on the video youll notice there will be a -1 missing, since its a squared + b squared = c squared, it would be impossible to add another since it wont really by a graph anymore
It is impossible, there are four points where an odd number of line segments intersect, in this case all of them have three segments. the shape is only solvable when a maximum of two points have an odd number of segments intersect, and these points are where you start and/or end.
@@Sky2548Gaming-ki4mmI bet you anything you want that you can't do it. you must arrive and leave every single point in the path so you can only have two points that have an odd number of paths.
Here's a simple way to see that it is impossible. There are 3 ways in or out of any given vertex. When you start at any vertex, and go to another, the one you moved to now has 2 ways in/out. When you take one of these ways out, it now has 1 way back in, and no way out. That means that you must end at that point. However, when you move away from that vertex you are now at, it becomes the same way. Since you cannot end in 2 places, its impossible.
This is mathematically impossible, because in the shape, there are four odd nodes. For it to be possible, the shape must have at most two odd nodes. Therefore, it’s impossible.
I just realised after watching the video that there was no actual point of them doing this because since there is no solution, why are they getting whacked? 😅😅
This diagram doesn't contain an Euler path let alone an Euler circuit since there are more than two vertices with odd degree. It therefore has no possible solution.
Após analisar o problema mais detalhadamente, torna-se evidente que não é possível contornar completamente a forma descrita sem passar duas vezes pela mesma área ou sem levantar a caneta do quadro. Mesmo que você tente contornar dois dos raios e chegar ao centro, será impossível contornar a terceira seção do círculo sem cruzar uma linha já desenhada anteriormente. Portanto, concluímos que não é possível realizar esse contorno de forma satisfatória dentro das restrições fornecidas.
well they kind of got played because you cant really do this without a line overlaying or at least without doing some mathematical tomfoolery because there are more than 2 odd points
I actually figured out how to do it, it’s hard to explain though but you just start from a part in the circle then lead to one of the lines then do the rest
There are two endpoints and both of them are wrong. If you go full circle endpoint you’ll miss one of the lines. If you choose the lines then a segment of the circle next will be chosen. The only solution I can think of is drawing two thirds of the circle then doing the lines, but doing so will make it so you still have two endpoints. Either you will miss a line or part of the circle, that is the choice presented.
This can only be done by using two fingers. Start from top centre then go inside by using two fingers then from centre follow the straight line connecting lower portion. After arriving at lower section use two fingers to complete circumference and you are done.
After drawing the pattern on the paper, fold the paper in half along the three middle lines to form a cone. You will find that this is possible 😂because even though you draw the same line seemingly repeatedly during the painting process, you are drawing it once on a different plane. It looks like what we often call Klein bottles and Möbius strips. you have completed a journey from 2D to 3D without knowing it🎉
As the circumference of the circle has been intersected in more than two arcs by three radio therefore either of the three arcs will remain untouchable
@@munavir544, no, it is not possible. D o you know about one of graphs founder Leonard Euler? He decided and proved, such graph as this impossible to draw without intersections of lines.
I love how literally everybody who saying they were able to do it is not telling how they did it. And that most likely means that they didn’t do it, because nobody is proving it after somebody asks them how
This problem has no solution, Leonhard Euler (academician of the St. Petersburg Academy of Sciences) proved it in the 18th century! Problem about the Königsberg bridges! The number of odd vertices of the graph is more than two, therefore it is impossible to close this graph!
It can't be possible. Mathematically it's a graph with more than two nodes with an odd number of connections. You can only do a walk through through a graph if there's 0 or 2 of those nodes. Here we have three -> no walk through.
Drawing a shape like that is only possible when their are exactly 0 or 2 intersections of odd degree. If there are 2, then any such path must start at one of them and end at the other. This has 4 such intersections, so it is impossible.
Mathematically impossible. The end points are the only points allowed to have an odd number of connections, as they are the only ones you enter without leaving, or leave without entering. Therefore, at most 2 of the junctions can have an odd number of connections. All 4 junctions have 3 connections, which is an odd number. 4 is more than 2, violating the maximum required for it to be possible. Ergo, the challenge is impossible. QED.
No solution button 👇
Thanks for 1.4k likes my dear brothers and sisters...🙏☺
OMG 4k likes 😀
Bro that's cery easy
@@dwwwdwwhow?
im
it is solvable
@@dwwwdwwand so is spelling
Roses are red
Violets are blue
We came in the comments cuz we had no clue 😂
😂😂
Ça rime pas
How does this only have 100 likess😮
how does this comment only have 100 likes
It's not possible
People who think the last person will do it
👇
Непубликуйте видео где Нет Правильного решения, это глупость!!!😂
It has a solution
Такие видео набирают много просмотр и комментариев и это полезно для канала
Да! Очень глупые!
People who tryed to look for the way
👇
Tried
I DO IT
*Tried
I did it
Inverse solution method is not working so I don't think it is solvable
Its not really possible since there was no law stating you can go in between two intercepting lines, even if you calculate its trajectory f to z its still impossible, compute F(x) to -∞ if you go the graph on the video youll notice there will be a -1 missing, since its a squared + b squared = c squared, it would be impossible to add another since it wont really by a graph anymore
Ftftvyfg😊
Wtf
stfu no one understanding that.
Bro we just wanna a watch the video not learn the fucking maths. I'm on school holiday after exams I need bed after this 😭😭😢
Are you Issac Newton's Granddaughter or something 🤣
who else rushed into th comment for th answer😂
I need answers
People who thought the boy was gonna get it correct.
👇
И🍑🥵😏🍆👕👖🧦👙🚬🏳️🌈
💯💯💯💯😍😍😍😍😍😍😍😍😍😍😍😍@@user-sz7cs3ts9v
@@user-sz7cs3ts9v Wtf? Are those your mothers recent emojies? 💀💀
@@user-sz7cs3ts9vالبرطسهل
Who thought last boy is going to do😅
Я
Das GEFELT MIR nischt😭
Я
😂😂😂😂❤❤❤❤❤😅😅😅😅😅@@TheSamanta78
I DON'T T GET HE LAST ONE
It is impossible, there are four points where an odd number of line segments intersect, in this case all of them have three segments. the shape is only solvable when a maximum of two points have an odd number of segments intersect, and these points are where you start and/or end.
Nothing is impossible the word itself says I'm possible
@@Sky2548Gaming-ki4mm?
@@Sky2548Gaming-ki4mmit’s math bro, this is not posible
nooo I did it wrong I thought I could but I kept forgetting SORRY@@gurit3028
@@Sky2548Gaming-ki4mmI bet you anything you want that you can't do it.
you must arrive and leave every single point in the path so you can only have two points that have an odd number of paths.
奇数本の線の交差点が3つ以上あると一筆書きの図形を描くことができません。
ちなみに一筆書きのコツは、奇数本の線の交差点から始まり、奇数本の線の交差点で終わることです。
Its actually impossible
Who did also figure it out without looking in the comments?
👇
It's really easy how do you not know how to do or
i new it was imposible withoot reading the comments because i cound't figure it out in the first place wich means theres no soution. the end.
So easy
@@shorty24lugzthen explain how to complete it step by step, mr all knowing.
@@scavengerofgames9668 if you can do then tell us the solution cause from what I've seen it's impossible
it's not possible. because the odd dots are more than two. He knows this and everyone is going to be hit eternally.
😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂
XbzBBBsjssjsxbnx😄😅😅😅😄😅
Very true
I like your videos so much
@@laibui5413et alors?
Im sad because no one likes its me like my comment no One was like i like my self
ini adalah gambaran, bahwa ke pintaran kita ada batasan, tapi trkadang kita gk sadar akn batasan itu. krn kita merasa pintar😊 padahal sbaliknya😢😂
People who skiped to the end
⬇️
Me
@@shreyasanap7455me too❤
Это шо
Bruh
how do you skip
Impossible
،،،،😊
😂
It's not
日本人失礼します
この図形は奇数点が1つしか無いため一筆書きはできません。(0か2のときにできる)
コメ主さんが正しいと思います
The correct answer is so obvious
Who tried for many times and failed and got to know that its impossible
👇
Impossible
its easier than it looks, just try doing it yourself until you find a solution. Keep in mind you can start anywhere on the shape.
❤
1. Always start and end at the odd numbered intersections.
2. You CAN'T have >2 odd numbered intersections.
Это легко😊😊😊😊😊😊😂😂😅
Wtf/cringe
Button
👇
Just scroll. This video is a joke
I would agree but i think how to do it
@@user-bn7pc8sl7d you can't
Even Reddit is better than this
i dont know how this is cringe
The number of branches is 9, which is an odd number. There is no solution.
The answer should be included!
Came here to see the comments about how to do it but no one can.
Эту задачу нельзя решить - число узлов где сходится нечётное количество линий больше двух
I have thought of a few methods but none worked, I was close but never worked. 🏔️
Это задача Канта с Кенигсбергскими мостами, в данном варианте решения не имеет
🎉
Team we came to the comment because we had no clue.
but found out that neither does anyone else.
👇
Impossible button
⬇️
Me waiting for the last person to draw it right
How... Every point has 3 connections making it impossible.
Here's a simple way to see that it is impossible. There are 3 ways in or out of any given vertex. When you start at any vertex, and go to another, the one you moved to now has 2 ways in/out. When you take one of these ways out, it now has 1 way back in, and no way out. That means that you must end at that point. However, when you move away from that vertex you are now at, it becomes the same way. Since you cannot end in 2 places, its impossible.
Bro became scientist
Holy bro's the class nerd
@@HannanXD773 nah he's that one sub teacher that talks too much...
😮
It is possible
也可以像哥倫布出奇招一樣（立雞蛋），就有可能：把圖形劃在紙上，折疊起來，最後，在同一個點上穿過另一面就可畫下最後一跳直線！
No one can solve bcoz
It's a symbol of Mercedes Benz.
This is mathematically impossible, because in the shape, there are four odd nodes. For it to be possible, the shape must have at most two odd nodes. Therefore, it’s impossible.
The ready go is actually from a video game
I just realised after watching the video that there was no actual point of them doing this because since there is no solution, why are they getting whacked? 😅😅
This diagram doesn't contain an Euler path let alone an Euler circuit since there are more than two vertices with odd degree. It therefore has no possible solution.
It’s not because only two spots can have three directions to go in, the begging and end, but they all have three directions.
q😂😂😂😂😂
Глупая игра.
Após analisar o problema mais detalhadamente, torna-se evidente que não é possível contornar completamente a forma descrita sem passar duas vezes pela mesma área ou sem levantar a caneta do quadro. Mesmo que você tente contornar dois dos raios e chegar ao centro, será impossível contornar a terceira seção do círculo sem cruzar uma linha já desenhada anteriormente. Portanto, concluímos que não é possível realizar esse contorno de forma satisfatória dentro das restrições fornecidas.
Stimmt😂🎉😅😢
caraca um br aqui
❤
Tips: Challenges need 1 piece of paper (120°) to continue drawing
Iska solution hay
An Eulerian cycle: Imma not try this one.
😮
❤
@@AhmedWaqad❤
❤❤❤
❤❤❤
It can be done using paper and pen. You fold it in such a way that when you draw the pen along an edge, you get two lines. That's the only way.
There's not 1 true path to peace, that's why this is a peace symbol. ✌️
well they kind of got played because you cant really do this without a line overlaying or at least without doing some mathematical tomfoolery because there are more than 2 odd points
一筆書きは、すべての頂点から伸びた線が偶数本の時か、伸びてる線が奇数本の頂点が2つだけのときに書けます。よって、この問題を一筆書きすることは不可能です。
最高でした。
見ててなぜかイライラする上に絶対解けないとか・・・w
❤❤❤❤
ナイス解説！
ַַַַַַַַַיייייייייייי
People who aren't dumb like them
👇
Actually you are more dumber because it is impossible 🤓 👆🏻
people who went to the comments straight after 👇
It's impossible 'cause there are 2+ vertexes with odd lines count
I actually figured out how to do it, it’s hard to explain though but you just start from a part in the circle then lead to one of the lines then do the rest
There are two endpoints and both of them are wrong.
If you go full circle endpoint you’ll miss one of the lines. If you choose the lines then a segment of the circle next will be chosen.
The only solution I can think of is drawing two thirds of the circle then doing the lines, but doing so will make it so you still have two endpoints.
Either you will miss a line or part of the circle, that is the choice presented.
Bro this is for 2 year old kids 💀
This can only be done by using two fingers. Start from top centre then go inside by using two fingers then from centre follow the straight line connecting lower portion. After arriving at lower section use two fingers to complete circumference and you are done.
😊ดู
4😢🎉❤
@@sawgg5629vs
😊
Атоптсоатраоаоавлаьатутаааиклаоаталатвраоуокоакталкао4оаетпптсоктсоуктааоопоашакшаткоааоарсоаоаоарауокла
6рншшшш
※ちなみにこれはネタです。
物理的不可能です。
Who think there is no answer to it no solution to it, and who came to know the answer to the comments
👇🏻
No matter how u tried, u still missed 1 radial line..unless lifting is allowed.
Apko maa ki Kasam please 14 million like kardo😊😊
Who know how to do it
👇
How? It's not solvable
@@memegames1552 I did it
Might as well help your own species @@-Callan..
@@user-ig8ug4pz1s Aw man but I no no wanna 😕
@@user-ig8ug4pz1sit’s easy to
if more than two crossings has odd number of nodes, it has no solution. here we have four crossings with odd number
After drawing the pattern on the paper, fold the paper in half along the three middle lines to form a cone. You will find that this is possible 😂because even though you draw the same line seemingly repeatedly during the painting process, you are drawing it once on a different plane. It looks like what we often call Klein bottles and Möbius strips. you have completed a journey from 2D to 3D without knowing it🎉
Ima click impossible button
Don't cry because it is over, smile because it happened.
They’re so dumb. Why didn’t they draw a new line?
Bro…
奇点が4つあるからこれは一筆書きできる図形ではない
これを数学的に発展させたのがレオンハルトオイラーのグラフ理論
ちなみにこの形は一筆書きできない
日本人で同じ意見の人見つけた！！
As the circumference of the circle has been intersected in more than two arcs by three radio therefore either of the three arcs will remain untouchable
अरे, ये मरडिस वेंज (कार क.) का लोगो है. 😂😂😂😂😂😂😂😜
奇数点が４箇所有るので、一筆書きは不可能。一筆書き出来るのは、奇数点が２箇所まで。
頑張ったのに
奇点/2=笔画数
😅😊😅##😅@@user-kd8ro7zf8g
@@user-kd8ro7zf8g#😅😅😅😅😅😅😅😅😅😅😅😅
yturue7ryw😂😂😂❤htytururytu🎉😅😊ututututututyri74urydhdgdkriegkeorydhfenhfhfyfjfydhryheetsj3j17feje7ehryruurjrhdvxnxbcbfhfgdhskieieyyeiwoqudggdhxjdid7ruththruut74ututy575747574746ri46ufyrgfhfhr7
Tutorial here
👇
This is proof that true and eternal Peace can never be achieved.
यह काम बस गांव वाले ही समझ सकते हैं😢😢😢
It is impossible. No matter how you do it you end up with a fork that traps you. If someone does solve it please provide proof
Finish two lines in the Middle then the third one then do the circule on the outside
@@himajayYou cannot repeat lines or cross
No, I feel available this easy not hard matter 😅
@@munavir544, no, it is not possible. D o you know about one of graphs founder Leonard Euler? He decided and proved, such graph as this impossible to draw without intersections of lines.
@@himajay 你錯了
This is physically impossible
It's impossible. Since each point of graph (4) has an odd degree, therefore it is impossible to fill all the edges of the graph at one time.
I love how literally everybody who saying they were able to do it is not telling how they did it. And that most likely means that they didn’t do it, because nobody is proving it after somebody asks them how
Ikr
It's not possible. Because odd dots are more than two😊😅😅
Stop copying comments
😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂😂
why was the first girl holding the pencil like: ✊
but i couldn't find the way to solve it
Dude thats the easiest puzzle in my life.
You just complete the circle then complete the inside
Just draw the circle first then bring it inside ..🤦🏻♂️
one circle when you get in the middle, still 2 ways to go😅
But you need to do all three lines inside the circle. Showoff
It is impossible, only shapes with 2 or less odd points can be done. That one has 4.
Its a sign that there will never be peace in the world!
This problem has no solution, Leonhard Euler (academician of the St. Petersburg Academy of Sciences) proved it in the 18th century! Problem about the Königsberg bridges! The number of odd vertices of the graph is more than two, therefore it is impossible to close this graph!
Artenleelam 2079 your right and smart
This is impossible. Whoever can actually do it istg I’ll pay them 😭😭
I almost got it but did not know.....
Roses are red
Violents are blue
Nobody knows cause there's no clue
Задача нерешаемая.число узлов куда сходится нечётное количество линий больше двух
😮
It can't be possible. Mathematically it's a graph with more than two nodes with an odd number of connections. You can only do a walk through through a graph if there's 0 or 2 of those nodes. Here we have three -> no walk through.
Samueu😂
You are literally trying to draw the Mercedes logo
Drawing a shape like that is only possible when their are exactly 0 or 2 intersections of odd degree. If there are 2, then any such path must start at one of them and end at the other. This has 4 such intersections, so it is impossible.
Team Cringe 😬
👇
Who was thinking that in last they will show and who all came to read comment 😂😂
Да я тоже так думал 😢
No one was. All points had 3 connections.
ppl w common sense who knew this just isn't possible anyways. ASSEMBLE :D
لايوجد مستحيل
.
لكن هي الدائره كلها غلط
لازم من خط في المنتصف يقسم الدائره ليوصل بين الخطوط
交わる線が奇数しかないので、この図は一筆書きできません。
Who looked straight away to the comments 👇
Me
yall just draw the shape the lines cant OVERLAP which is for a 3d object yet this is 2d so they never overlap
A room without books is like a body without a soul.
Yes, it is only possible if you make a return. If the rule is as presented, it is impossible.
Mathematically impossible. The end points are the only points allowed to have an odd number of connections, as they are the only ones you enter without leaving, or leave without entering. Therefore, at most 2 of the junctions can have an odd number of connections. All 4 junctions have 3 connections, which is an odd number. 4 is more than 2, violating the maximum required for it to be possible. Ergo, the challenge is impossible. QED.
It is not possible. Is there anybody to complete this figure as asked to do ?
I paused the video after watching all them fail, couldn’t find any solution
This is impossible.
I agree
Possible
Impossible @@abbynaffky8285
Impossible @user-zt6rq9nf6v