summaryrefslogtreecommitdiff
path: root/080_blog/00038_Theory
diff options
context:
space:
mode:
authorMiguel <m.i@gmx.at>2019-03-07 23:26:17 +0100
committerMiguel <m.i@gmx.at>2019-03-07 23:26:17 +0100
commit52f86ea0075c66e18e4796ad88f45541da8b4de5 (patch)
treea7dcdb140e49ca13ed2315970e3b86e0c6fb9ef3 /080_blog/00038_Theory
parenta9e55a351753af1cfdeb75bdf50ecfd80de129c0 (diff)
some cleanup and such
Diffstat (limited to '080_blog/00038_Theory')
-rw-r--r--080_blog/00038_Theory/00010_Totient-Function/index.md16
-rw-r--r--080_blog/00038_Theory/index.md0
2 files changed, 16 insertions, 0 deletions
diff --git a/080_blog/00038_Theory/00010_Totient-Function/index.md b/080_blog/00038_Theory/00010_Totient-Function/index.md
new file mode 100644
index 0000000..eea75f4
--- /dev/null
+++ b/080_blog/00038_Theory/00010_Totient-Function/index.md
@@ -0,0 +1,16 @@
+# Euler's totient function
+
+And now something completely different. Straight from the World of Number Theory.
+Frankly, I just wanted to show off the powers of my new Estatico functionality
+and give tribute to my all time hero **Leonhard Euler**.
+
+## Definition
+
+For a given value _n_ this function returns the number of positive integers,
+relatively prime to _n_ up to _n_.
+
+## Computing
+
+You can compute it for instance via _Euler's product formula_, multiplying
+over the distinct prime numbers dividing _p_:
+$$\varphi(n) =n \prod_{p\mid n} \left(1-\frac{1}{p}\right)$$
diff --git a/080_blog/00038_Theory/index.md b/080_blog/00038_Theory/index.md
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/080_blog/00038_Theory/index.md