solve problem 69 in uiua
This commit is contained in:
@@ -0,0 +1,14 @@
|
|||||||
|
# project euler 69
|
||||||
|
|
||||||
|
# euler totient function
|
||||||
|
# n ? Φ(n)
|
||||||
|
Φ ← ⁅×/×-⊸÷⊙1◴⊸°/× # from uiua discord by maweo
|
||||||
|
|
||||||
|
# find n that maximizes n÷Φ(n)
|
||||||
|
# range ? max_n÷Φ(n)
|
||||||
|
s ← ▽⊸(=⊸/↥÷)⊸≡Φ
|
||||||
|
|
||||||
|
s +1⇡1e6
|
||||||
|
|
||||||
|
# online solution
|
||||||
|
# https://uiua.org/pad?src=0_17_0-dev_2__IyBwcm9qZWN0IGV1bGVyIDY5CgojIGV1bGVyIHRvdGllbnQgZnVuY3Rpb24KIyBuID8gzqYobikKzqYg4oaQIOKBhcOXL8OXLeKKuMO34oqZMeKXtOKKuMKwL8OXICMgYnkgZGlzY29yZDptYXdlbwoKIyBzb2x1dGlvbgojIHJhbmdlID8gbWF4X27Dt86mKG4pCnMg4oaQIOKWveKKuCg94oq4L-KGpcO3KeKKuOKJoc6mCgpzICsx4oehMWU2Cg==
|
||||||
Reference in New Issue
Block a user