Ask your own question, for FREE!
Mathematics 13 Online
OpenStudy (rootbeer003):

help?

satellite73 (satellite73):

no

OpenStudy (rootbeer003):

satellite73 (satellite73):

ok one or two as long as they are not geometry

satellite73 (satellite73):

what a weird question

satellite73 (satellite73):

they want you to compute \[10\div \frac{1+\sqrt 5}{2}\]

OpenStudy (rootbeer003):

6.2?

satellite73 (satellite73):

yes

OpenStudy (rootbeer003):

satellite73 (satellite73):

no idea

satellite73 (satellite73):

"Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the same vertex. "

OpenStudy (rootbeer003):

prob choice 2

satellite73 (satellite73):

whatever that means got an example in your book?

OpenStudy (rootbeer003):

no i dont

satellite73 (satellite73):

then how the hell are you supposed to do this?

OpenStudy (rootbeer003):

its choice 2

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!