Skip to content

Instantly share code, notes, and snippets.

@Rudxain

Rudxain/Euclid-Euler theorem example.md

Last active December 18, 2022 04:27
Show Gist options
  • Save Rudxain/d25ccad3949afd44e2ad6dd169c41d7a to your computer and use it in GitHub Desktop.
Save Rudxain/d25ccad3949afd44e2ad6dd169c41d7a to your computer and use it in GitHub Desktop.
Download ZIP
Attempt to use binary to explain the Euclid-Euler theorem
Raw
Euclid-Euler theorem example.md

Use binary 111110000 as example...

Add up the powers of 2, then use bit shift/multiplication/addition identities to simplify the sum of all divisors. You'll get the original Perfect number

Divisors: 1, 10, 100, 1000, 10000, 11111, 111110, 1111100, 11111000

(WIP) I'm planning on improving this, then I'll make a YT video or a GHP-blog/post about it

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment