GitHub - bicmr-ai4math/sol-2-16: For positive integers $a, s, t$, prove that $a^{\mathrm{gcd}(s,t)}-1=\mathrm{gcd}(a^s-1,a^t-1)$. As a bonus, it can be proven that for any positive integer $n>1$, $n \nmid 2^n-1$.

bicmr-ai4math / sol-2-16 Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

For positive integers $a, s, t$, prove that $a^{\mathrm{gcd}(s,t)}-1=\mathrm{gcd}(a^s-1,a^t-1)$. As a bonus, it can be proven that for any positive integer $n>1$, $n \nmid 2^n-1$.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.gitignore		.gitignore
Main.lean		Main.lean
Sol-2-16-bonus.lean		Sol-2-16-bonus.lean
Solution_of_2-16_en.pdf		Solution_of_2-16_en.pdf
Solution_of_2-16_zh.pdf		Solution_of_2-16_zh.pdf
lake-manifest.json		lake-manifest.json
lakefile.lean		lakefile.lean
lean-toolchain		lean-toolchain
sol-2-16-original.lean		sol-2-16-original.lean

About

For positive integers $a, s, t$, prove that $a^{\mathrm{gcd}(s,t)}-1=\mathrm{gcd}(a^s-1,a^t-1)$. As a bonus, it can be proven that for any positive integer $n>1$, $n \nmid 2^n-1$.

Activity

Custom properties

0 stars

0 watching

0 forks

Report repository