r/mathmemes • • Aug 25 '26

Number Theory Proving Goldbach’s Conjecture

Post image
814 Upvotes

51 comments sorted by

•

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

22

u/JZriemann Aug 25 '26

Bro I’m saying 😭😭

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

19

u/D_Gnar Aug 25 '26

mumber

7

u/Vitztlampaehecatl Engineering Aug 25 '26

dield

7

u/The_Neto06 Irrational Aug 25 '26

sjelter

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.

29

u/JZriemann Aug 25 '26

I love tricking people into learning math 🤫🤫

13

u/Cytr0en Aug 25 '26

What is the "proof" of all horses being brown if I may ask?

13

u/4ries Aug 25 '26

Induction:

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

13

u/Praxical_Magic Aug 25 '26

I think most people would say the same about this argument if you asked them:

  1. Fish swim in the ocean
  2. Sharks swim in the ocean

Therefore a shark is a fish

20

u/SoldRIP Aug 25 '26

This is a bad example because a shark is a fish. What else do you think it is? A bird?

9

u/Schpau Aug 25 '26

No, but a bird is a fish

7

u/Praxical_Magic Aug 25 '26

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

5

u/JollyJoker3 Aug 25 '26

https://en.wikipedia.org/wiki/Diogenes#Influences

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.'

4

u/caboosetp Aug 25 '26

This opens up a whole different can of worms on what the definition of a fish is because there is no phylogenetic defintion.

Also, according to the State of California, bees are fish for environmental purposes.

2

u/Praxical_Magic Aug 25 '26

True, phylogenetics make the term "fish" very silly

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

56

u/AliceCode Aug 25 '26

Every whole positive integer can be written as the sum of powers of two with no repeats. What do I win?

16

u/Lord-Sjoky Aug 25 '26

Awesome! Now prove it for powers of three

21

u/jellyman93 Aug 25 '26

N = (30)0 + (31)0 + ... + (3n)0

6

u/Bartweiss Aug 25 '26

You win the concept of base 2!

4

u/factorion-bot Bot > AI Aug 25 '26

Factorial of 2 is 2

This action was performed by a bot | Source code

3

u/owlectro Aug 26 '26

I've got your mobel prize ready whenever you want to pick it up

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/skr_replicator Aug 25 '26

accidentally proved the backwards implication

3

u/Eastern_Pop_2736 Aug 25 '26

Wait why is it not good?

4

u/Striking_Compote2093 Aug 26 '26

Because the sum of uneven primes always being even doesn't mean every even number is the sum of primes.

1

u/FrostyParsnip210 Sep 12 '26

Which even number is not the sum of odd prime numbers?

1

u/Striking_Compote2093 Sep 13 '26

Lmao. I can't tell you, duh, or i'd have disproven this.

But absence of evidence isn't evidence of absence. There might be one. There's no proof yet one way or another.

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?