# Question for big brains.....

To solve this you must know what is eulerian trail.......So get its info at https://www.youtube.com/watch?v=CQNH2ifOAQE

then tell me how you are gonna make a smallest eulerian trail, means the figure with least edges that makes it eulerian trail. Also tell me to which popular puzzle it is derived of and how......???

Note by Yashasvini Sharma
4 years, 1 month ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

friends the smallest Eulerian trail is the smallest diagram drawn by 3 utility problem...... You can get more info at http://www.iosrjournals.org/iosr-jce/papers/Vol16-issue2/Version-10/C0162101322.pdf

- 4 years, 1 month ago

The answer is IMPOSSIBLE.....

- 4 years, 1 month ago

READ QUESTION,,,,WHAT IMPOSSIBLE???????? :(

- 4 years, 1 month ago