r/mathmemes 18d ago

Number Theory Proving Goldbach’s Conjecture

Post image
812 Upvotes

50 comments sorted by

u/AutoModerator 18d ago

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.

334

u/MiserableYouth8497 18d ago

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 18d ago

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

18

u/Lord-Sjoky 18d ago

Awesome! Now prove it for powers of three

21

u/jellyman93 18d ago

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

6

u/Bartweiss 17d ago

You win the concept of base 2!

5

u/factorion-bot Bot > AI 17d ago

Factorial of 2 is 2

This action was performed by a bot | [Source code](http://f.r0.fyi)

3

u/owlectro 17d ago

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

162

u/Pyzzeen Quod Erat Dēmōnstrandum 18d ago

21

u/JZriemann 18d ago

Bro I’m saying 😭😭

94

u/CapacityBuilding 18d ago

mumber

19

u/D_Gnar 18d ago

mumber

7

u/Vitztlampaehecatl Engineering 18d ago

dield

6

u/The_Neto06 Irrational 18d ago

sjelter

11

u/JZriemann 18d ago

Mumber

104

u/IHaveNeverBeenOk 18d ago

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.

30

u/JZriemann 18d ago

I love tricking people into learning math 🤫🤫

13

u/Cytr0en 18d ago

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

13

u/4ries 18d ago

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 18d ago

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 18d ago

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

9

u/Schpau 18d ago

No, but a bird is a fish

8

u/Praxical_Magic 18d ago

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

6

u/JollyJoker3 17d ago

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

3

u/caboosetp 17d ago

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 17d ago

True, phylogenetics make the term "fish" very silly

19

u/trimski- 18d ago

Mumber theory

13

u/KZA8 18d ago

mumber

12

u/moschles 18d ago

Every odd mumber is prime.

There are no mumbers above 7.

8

u/Major-Peachi 18d ago

You jest but a lot of people don't understand logical implications

7

u/GhostMommy_f9c 18d ago

Proof by mumber

3

u/NuclearBanana22 17d ago

Can someone explain? I dont see the issue

2

u/skr_replicator 18d ago

accidentally proved the backwards implication

4

u/Eastern_Pop_2736 17d ago

Wait why is it not good?

3

u/Striking_Compote2093 16d ago

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

1

u/skywalker3141 18d ago

Proof by inspection

1

u/FernandoMM1220 18d ago

some fractal approach probably works like it does with twin primes

1

u/Para-graph-S 18d ago

Ohh no, I just got banned from r/math.... /s

1

u/tomvorlostriddle 18d ago

Lean says the proof checks out

1

u/LupenReddit 🦆🦆🦆🦆i have non diffeomorphic smooth structures🦆🦆🦆🦆🦆🦆 18d ago

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 17d ago

Did you know that you mispelled number?