MrRubix's Riddle/Problem Thread: Rebirth

[ieatyourlvllol]

Originally Posted by MrRubix

Have any others, ieat?

p = np

[MrRubix]

D: oh noes


Here's a fairly cool one (don't use Google for this -- it's actually not hard, and is kinda rewarding to figure it out on your own):

Prove that the sum of a triangle's angles will always equal 180 degrees.

[ieatyourlvllol]

Here's another...

FFR purchases a race car. What number is assigned to it?

[pntballa18]

Originally Posted by ieatyourlvllol

Hehe, Rubix beat you guys to it.

definitely posted the answer first

[dore]

Originally Posted by ieatyourlvllol

Here's another...

FFR purchases a race car. What number is assigned to it?

202

[ieatyourlvllol]

Haha, dore got it immediately. -_-

[dore]

it randomly clicked... dunno why

[MrRubix]

I don't follow that one, haha

[dore]

I like how the number applies as well.

[Reach]

Number problems

1, 6, 20, 51, 189, 517, 2197, 4823, 14496, ?

[ieatyourlvllol]

#3 (this one is sorta cheesy/corny lol)

You're playing some good ol' Super Smash Bros with your friend FFR. How many times does Link fire his bow at Yoshi before the match is over?

[dore]

L is parallel to M
Side AB lies on M
C lies on L
angle x and angle x' are equal because of whatever theorem that is
same with the angle y's
x'+y'+z=180 because of that other theorem
ergo x+y+z=180

EDIT
k I had a diagram but it's not showing up so just guess
nm there it is

[MrRubix]

Nice, Dore

[dore]

Originally Posted by ieatyourlvllol

#3 (this one is sorta cheesy/corny lol)

You're playing some good ol' Super Smash Bros with your friend FFR. How many times does Link fire his bow at Yoshi before the match is over?

294, else 13... I like 294 better for the context of the problem but if it's 13 then ok

[ieatyourlvllol]

You're correct once again. I should ban you from answering these, lmao.

#4 (probably easy)

Choppy crystals
Balance
Smooth grains

All three embody a single character.

[dore]

that's why i did white text 'cause I didn't want to ruin it for everyone else

[clarinet89]

gah! this thread makes my head hurt

[Quasar889]

Ok, a new problem. Calculus.
Take a non-zero number N.
The sum (1 + 1 + 1 + .... + 1) has N copies of the integer 1 in it.
Therefore, (1 + 1 + 1 + 1 + ... + 1) (with N ones) = N.
Multiply both sides by N.
Now the left hand side distributes.
(N + N + N + N + N ...) = N^2
Take the derivative with respect to N.
Because the derivative is a linear operator, it too distributes over sums.
Now we have:
(1 + 1 + 1 + 1 + 1 .... ) = 2*N
N = 2N
Because N is non-zero,
1 = 2.

Disprove. There are two reasonable flaws. Find both of them.

and because N is non-zero

[ieatyourlvllol]

Thread...losing...momentum...must...save...

#5

Silence isn't always golden, in which case, what is it?

[Reach]

Originally Posted by ieatyourlvllol

Thread...losing...momentum...must...save...

#5

Silence isn't always golden, in which case, what is it?

Blue.



Nobody bothered with my last problem. So...

Eight hooks are attached to the corners of a giant cubical wooden box, one hook at each corner. String is stretched between each and every pair of hooks. Rubix walks along the strings, always remaining in contact with one of them and changing directions only at the hooks, not at any other points at which two or more strings are contiguous. Rubix never walks along the same length of string twice, although he may pass another string at an angle. Of the twenty-eight string segments between pairs of hooks, what is the maximum number Rubix may traverse under these conditions?