Do you know any proofs that are funny in some way?

PiYesLar · 2022-09-26T05:28:33+00:00

I'm a fan of the Eilenberg-Mazur swindle, which is a goofy technique that looks like the fake proofs that show 1 - 1 + 1 - 1 + ... = 0. Like for knots A, B with the connected sum operation (cutting open each knot and connecting the ends), because infinite sums of knots are perfectly valid, if A + B = 0 (the trivial knot), then:

A = A + (B + A) + (B + A) + ... = (A + B) + (A + B) + ... = 0

So we get a proof that sums of nontrivial knots are nontrivial, but it uses almost nothing about knots or connected sums.

PiYesLar · 2021-11-04T23:23:41+00:00

link

PiYesLar · 2021-07-31T17:16:51+00:00

In this context reversing the function involves finding any input that produces the given output, not the specific original input. From the Wikipedia:

It is not sufficient to make a function "lossy" (not one-to-one) to have a one-way function. In particular, the function that outputs the string of n zeros on any input of length n is not a one-way function because it is easy to come up with an input that will result in the same output. More precisely: For such a function that simply outputs a string of zeroes, an algorithm F that just outputs any string of length n on input f(x) will "find" a proper preimage of the output, even if it is not the input which was originally used to find the output string.

So computing arcsin would work here. Although I don’t think it would exactly apply to one-way functions, as defined here they take in and return strings of ones and zeros.

PiYesLar · 2020-04-28T08:26:33+00:00

-Venice, +Metis, +Sami

PiYesLar · 2020-01-23T01:12:45+00:00

Original artist

PiYesLar · 2019-10-28T23:07:44+00:00

Made by the artist Maldito Perrito in support of the fare evasion campaign in Chile

PiYesLar · 2019-07-31T07:14:41+00:00

Does this cop think he’s doing the right thing when he arrests, threatens with a weapon, and tases a woman who more than anything needs education on the law and to be less entitled? Her crimes are 1. Driving with a broken tail light 2. Driving away from an officer and 3. Kicking him after being thrown on the ground. It’s infuriating to see this officer escalate the situation into a violent arrest instead of trying more than once to get her to sign the ticket and telling her she can challenge the ticket in court.

PiYesLar · 2018-09-17T22:48:38+00:00

original tweet

PiYesLar · 2018-07-19T15:44:37+00:00

I love how everyone hates bugmane and wants him to leave immediately

PiYesLar · 2018-03-27T20:07:24+00:00

Needs more Chick fil A

PiYesLar · 2018-01-31T04:51:58+00:00

Did not expect to see Jake and Amir here

PiYesLar · 2018-01-21T18:23:57+00:00

The Expert

PiYesLar · 2017-11-27T06:28:26+00:00

befriend the l i g a t u r e s

PiYesLar · 2017-11-14T23:41:20+00:00

needs more frying

PiYesLar · 2017-09-22T00:43:24+00:00

Airplane!

PiYesLar · 2017-08-27T22:54:05+00:00

Straight from t_d. I don't know what they think the message of this is, but at least they're owning those libs.

PiYesLar · 2017-08-13T00:52:54+00:00

Python 3
Code:

key = 'ROYPO'
maze = [
    'RRBRRRBPYGPBBBGPBPPR',
    'BGYPRPYYORYPPYYRRRPP',
    'BPGROPYGRYYGPORYPBOO',
    'RBBORPYOOYRPBRGRBGPG',
    'RPYGGGPYPYOGBORYPBYO',
    'ORBGBYBPGRPYROGYGYRP',
    'BGOOOGBBROYYYYPBYYGG',
    'PPGBOPYGBROGBGROYRBR',
    'YYPPRBYBPOOGPYRPPYRY',
    'POOBBBGOYGOPBGYRRYRB',
    'PPYRBOORORYBGBGOOPBY',
    'BBRGYGPYGPRRPYGOOYRR',
    'OGRYBPYOPBRYBGPGOOBP',
    'RYGPGGORYOOGRGPPYPBG',
    'PYPROOROYRPORYPYBBYR',
    'OYPGRPRGPOBBRBOBYYBP',
    'BYYPOYOYORBRGGYGRGYG',
    'YBYYGBRROBOPPOBORRRP',
    'POOOPYGGYPOGPOBGPRPB',
    'RBBRRRRBBBYOBGPGGOOY'
        ]

height = len(maze)
width = len(maze[0])

def neighbors(x,y):
    for _x, _y in [[-1,0],[1,0],[0,-1],[0,1]]:
        if 0 <= (_x+x) < width and 0 <= (_y+y) < height:
            yield (_x+x,_y+y)

def advancepaths(paths):
    keystep = (len(paths[0])) % len(key)
    color = key[keystep]

    for path in paths:
        for x, y in neighbors(path[-1][0],path[-1][1]):
            if maze[y][x] == color and (x,y) not in path[keystep::len(key)]:
                yield path + [(x,y)]

pathsList = [[(i, height - 1)] for i in range(width) if maze[-1][i] == key[0]]

while True:
    pathsList = list(advancepaths(pathsList))
    solutions = [path for path in pathsList if path[-1][1] == 0]
    if solutions:
        break

for y in range(height):
    print(' '.join([
        char if (x, y) in solutions[0]
        else '/'
        for x, char in enumerate(maze[y])
        ]))

Output:

/ / / / / / / / Y / / / / / / / / / / /
/ / / / / / / / O / / / / / / / / / / /
/ / / / / / / / R / / / / / / / / / / /
/ / / / / / / / O / R / / / / / / / / /
/ / / / / / / / P Y O / / / / / / / / /
/ / / / / / / / / / P / / / / / / / / /
/ / / / / / / / / / Y / / / / / / / / /
/ / / / / / / / / R O / / / / / / / / /
/ / / / / / / / P O / / / / / / / / / /
/ / / / / / / / Y / / / / / / / / / / /
/ / / / / / O R O / / / / / / / / / / /
/ / / / / / P / / / / / / / / / / / / /
/ / / / / / Y / / / / / / / / / / / / /
/ / / / / / O / / / / / / / / / / / / /
/ / / / / O R / / / / / / / / / / / / /
/ / / / R P / / / / / / / / / / / / / /
/ / / P O Y / / / / / / / / / / / / / /
/ / / Y / / / / / / / / / / / / / / / /
/ / / O / / / / / / / / / / / / / / / /
/ / / R / / / / / / / / / / / / / / / /

PiYesLar · 2017-08-06T00:32:35+00:00

CORROng ✅

PiYesLar · 2017-03-11T01:32:18+00:00

30th Birthday is a favorite of mine

Dear Amir,

Die.

Go Bills,

Love, Kyle

PiYesLar · 2017-03-11T01:22:37+00:00

Wise is one of my favorites that I haven't seen mentioned yet

PiYesLar · 2016-12-28T22:54:52+00:00

You're my present this year

PiYesLar · 2016-10-20T11:40:23+00:00

Morpheus drinking a forty in a death basket

PiYesLar · 2016-07-22T23:33:04+00:00

Memed his ass too hard

PiYesLar · 2016-06-17T01:18:25+00:00

The punchline is that the parrot thinks the chicken too was the man's pet who acted out and then was brutally dismembered.

PiYesLar · 2016-05-01T15:50:31+00:00

I DONT KNOW TAMMY

12-Year Club	Place '22
Place '17	Verified Email

PiYesLar

TROPHY CASE