I was a bit bored, and came up with this conjecture - Euler's unsolvability conjecture. If a problem that euler has tried to solve, but he could not, then that problem is unsolvable (by unolvable, either a analytic closed form solution does not exist, or if he was trying to find a polynomial solution to np problem). I know this is not a proper conjecture/or proper maths, but this community is closest to what i want to say.

crosspost of https://piefed.social/c/linguistics_humor/p/1691997/many-or-much

cross-posted from: https://mander.xyz/post/45557065

pro choice

EDIT: fix image

I'm learning to use Rocq, I felt very powerful.

cross-posted from: https://lemmy.today/post/34911225

Ramanujan, Perelman, and someone from 4chan who wanted to optimize watching anime

Context:

In ZFC set theory (which most of modern maths is built upon). The natural numbers are defined as recursions of empty sets.

Ie. 0 = ∅ (the empty set)

1 = {∅} = {0}

2 = {∅, {∅}} etc…

• Invidious
• Youtube

Real title:
Differentiation of Differentiation by Zundamon's Theorem

For anyone out of the loop

cross-posted from: https://lemmy.world/post/30756980

Oh really?

In a user manual I came across recently.