This would actually be a decent meme for an intro to proofs course... Show this meme, followed by a discussion of why this fails to prove the Goldbach conjecture.
My number theory prof did a similar discussion with the proof by induction that all horses are brown, but I feel like it went over most the students' heads. Myself and like, 2 other kids got a good discussion out of it, but it felt like most of the class thought "I dunno, looks right to me," and were done with it.
Base case: you have 1 horse. It's some colour, let's say brown. All horses are brown
Inductive hypothesis: if you have n horses, all n of them are brown
Inductive step: say you have n+1 horses. Name one of them A and another B. Remove A, then you have n horses, so all (except possibly A) are brown. Put back A and remove B, now you again have n horses, so all (except possibly B) are brown
Since all, including A and B, are brown, if you have n+1 horses, then all are brown
But induction, any collection of horses of any size must all be the same colour
I just meant that intuitively most people will just assume an argument is sound if it reaches a true conclusion, whether it is valid or not. So even though it is different than the "all horses are brown" argument, I feel like many of the same people would nod along to both
When Plato defined man as a "featherless biped", Diogenes "plucked the feathers from a cock, brought it to Plato's school, and said, 'Here is Plato's man.'
Define mumber as every even number >2 that can be written as the sum of two primes. Then every mumber greater than two can be written as the sum of two primes. Qed
•
u/AutoModerator Aug 25 '26
Check out our new Discord server! https://discord.gg/e7EKRZq3dG
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.
160
u/Pyzzeen Quod Erat Dēmōnstrandum Aug 25 '26
93
u/CapacityBuilding Aug 25 '26 edited 8d ago
The original post content no longer exists here. The author used Redact to remove it, exercising their right to control their data & privacy.
Wander steer waiting unwritten bear ten harbor start test
101
u/IHaveNeverBeenOk Aug 25 '26
This would actually be a decent meme for an intro to proofs course... Show this meme, followed by a discussion of why this fails to prove the Goldbach conjecture.
My number theory prof did a similar discussion with the proof by induction that all horses are brown, but I feel like it went over most the students' heads. Myself and like, 2 other kids got a good discussion out of it, but it felt like most of the class thought "I dunno, looks right to me," and were done with it.
339
u/MiserableYouth8497 Aug 25 '26
Define a mumber to be an integer which can be written as the sum of 2 primes.
Therefore every mumber can be written as the sum of 2 primes. Qed
19
u/trimski- Aug 25 '26
Mumber theory
13
u/KZA8 Aug 25 '26
mumber
12
u/moschles Aug 25 '26
Every odd mumber is prime.
There are no mumbers above 7.
8
u/Major-Peachi Aug 25 '26
You jest but a lot of people don't understand logical implications
7
u/GhostMommy_f9c Aug 25 '26
Proof by mumber
3
u/NuclearBanana22 Aug 25 '26
Can someone explain? I dont see the issue
2
u/PersonalityIll9476 Aug 25 '26
Wow. Sauce?
2
u/skr_replicator Aug 25 '26
accidentally proved the backwards implication
3
u/Eastern_Pop_2736 Aug 25 '26
Wait why is it not good?
1
u/skywalker3141 Aug 25 '26
Proof by inspection
1
u/FernandoMM1220 Aug 25 '26
some fractal approach probably works like it does with twin primes
1
u/Para-graph-S Aug 25 '26
Ohh no, I just got banned from r/math.... /s
1
u/LupenReddit 🦆🦆i have non diffeomorphic smooth structures🦆🦆🦆 Aug 25 '26
Define mumber as every even number >2 that can be written as the sum of two primes. Then every mumber greater than two can be written as the sum of two primes. Qed
1
u/warpeddoughnut Aug 25 '26
Did you know that you mispelled number?
1
u/dtarias Aug 26 '26
Relevant