idunnololz

“Hellfire” in my ass

I dont see any sex depicted in the image :/

No that’s why they don’t leave it lying around. So they can listen to the testies and you can’t.

Or what happens when you fall asleep first at your own sleep over.

As a married person i can confirm this trick doesn’t work. It will just make your daydreams even less ethical :/.

Well do don’t know for sure that the popsicle stick owner isnt paying for the eggs on installments.

I say unzip first. And then figure out whether it was a good idea after.

I’m going to do it now just to spite you

Dude spoilers

No fudging way.

My man

I too have a sendentary job haha

I have a scale and normally weigh 140g for one meal. I might be fat. :x

I mean after I die it will be very difficult. So maybe up to a point.

But it doesnt work for memes without text or videos/gifs :/

Absolute legend. I have been meaning to do this. One day when i am extremely bored I’m going to run my meme library through AI to describe every meme and then tag all of them. Then host all the memes and make them seaechable. I’ve been thinking aboot it for 3 years and haven’t done it yet though.

I took a peek and it is sort of dumb but logically “sound”. Specifically the indictive step.

In the inductive step you assume the statement is true for some number n and use this statement to prove the statement n + 1 is true. If you can do that then you can prove the induction step.

So in this example the statement we assume is true is given n horses, all of them are the same color. To prove the statement for n + 1 horses we look at the n + 1 horses. Then we exclude the last horse. By excluding the last horse we have a set of n horses. By the induction statement this set of horses must all be the same color. So now we’ve proven the first n horses are the same color.

Next we can exclude the first horse. This also gives us a set of n horses. By the induction statement all these horses must also be the same color. Therefore all n + 1 horses must be the same color.

This sounds really dumb but the proof works in the induction step.

The logical issue is that the base case is wrong which is necessary for a complete proof by induction.

GL