/sci/ - Science & Math

[Anonymous No.5286670]

Since gravity "stretches" time, making one second longer in an area with high gravity than in an area with low gravity, does this also apply to matter?

[Anonymous No.5286672]

Does what also apply to matter? I don't understand the question.

[Anonymous No.5286676]

>>5286672
Like, an inch is shorter in an area with high gravity than it is in an area with low gravity. Or maybe matter is just closer together. I don't know.

[Anonymous No.5286684]

spaghettification.

[Anonymous No.5288414]

>>5286670
Is i'z doin iz rite 0p?

[Anonymous No.5288441]

>>5286684
http://www.youtube.com/watch?v=0hq_e4Agd1k
http://en.wikipedia.org/wiki/Spaghettification

[Anonymous No.5288495]

>>5286670
Pic: easy to see it is impossible
3 rooms with 5 doors, each room must be "entrance" or "exit" to these rooms (3 of one, 2 of the other). No matter how you assign these you can't join them together with one line, because one line can only handle *one* additional entrance and *one* additional exit.
Your puzzle is bad, plz2feelbad

[Anonymous No.5288512]

>>5288495
and for the record: this problem is called "Seven bridges of Königsberg"

[Anonymous No.5288536]

>>5288512
And an easy proof if you know a bit of graph theory, just set the "outside" as a node.

[Anonymous No.5288552]

[Anonymous No.5288557]

>>5288536

[Schaiffe !zribfvVT8o No.5288579]

>>5288552
You missed a door.
Do not bother wasting your time trying to complete this; it is impossible.

[Anonymous No.5288599]

>>5288552
you missed one more like this

[Anonymous No.5288606]

What's so hard about this, again?

[Anonymous No.5288613]

>>5288606
I think the idea is that you don't change the problem.

[Anonymous No.5288616]

>>5288606
Nice try, faggot.

[Anonymous No.5288618]

>>5288613

what did he change?

here's another solution.

[Lillith No.5288620]

>>5288606
I like the fact that you did this on your iphone you corporate whore. TI-83 modded into a cell phone masterrace reporting in

[Anonymous No.5288621]

>>5288618
Nice try, faggot.

[Anonymous No.5288623]

It never says you can't go through walls guys, checkmate.

[Anonymous No.5288624]

>>5288618
missed a door

>>5288606
this seems legit. Only thing i can think of that is making faggots complain is that the path is crossing itself, but that is never stated to be a constraint of the problem. Well done.

[Anonymous No.5288626]

>>5288624

He changed the course, adding one door to each of the top rooms dumbass

[Anonymous No.5288650]

I'm not graph theory-ist but I seem to remember something from those classes that you can't do things like this with an odd number of objects.

[Anonymous No.5288652]

>>5288650
Actually it can be solved. Graph theory tells us that a solution exists, but the proof is non-constructive. We don't know how the solution looks like.

[Anonymous No.5288654]

>>5288626
Oh fuck. Well ignore me then. I suck cocks.

[Anonymous No.5288664]

>>5288606
you made another door in the top, almost had me fooled

[Anonymous No.5288757]

>>5288650
According to my book
>a connected graph is Eulerian if and only if the degree of each vertex is even
>a connected graph is semi-Eulerian if and only if it has exactly two vertices of odd degree.
Let the rooms (counting the outside as a room) be vertices and the doors edges. To claim that this problem is possible to solve is equivalent to claim that the graph is Eulerian or semi-Eulerian.
But we can see that there are three vertices with degree 5 (three rooms that have 5 door), so the graph is neither Eulerian nor semi-Eulerian, and so the problem has no solution.

[Anonymous No.5288770]

[Anonymous No.5288774]

>>5288770
>mfw when I realized I missed one

[Anonymous No.5288842]

>>5286676
I would venture to say not since you'd still have electrons in said matter keeping everything structured and bonded.

[Envy Is Greed !ItYZwk.ZX2 No.5289038]