From a2be4ac62bfd95ce8007af0de925a675bd782fa2 Mon Sep 17 00:00:00 2001
From: John MacFarlane <jgm@berkeley.edu>
Date: Thu, 6 Jul 2023 12:20:01 -0700
Subject: Add typst reader tests.

Closes #8942.
---
 test/typst-reader.typ | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 test/typst-reader.typ

(limited to 'test/typst-reader.typ')

diff --git a/test/typst-reader.typ b/test/typst-reader.typ
new file mode 100644
index 000000000..3b7541be1
--- /dev/null
+++ b/test/typst-reader.typ
@@ -0,0 +1,28 @@
+#set page(width: 10cm, height: auto)
+#set heading(numbering: "1.")
+
+= Fibonacci sequence
+The Fibonacci sequence is defined through the
+recurrence relation $F_n = F_(n-1) + F_(n-2)$.
+It can also be expressed in _closed form:_
+
+$ F_n = round(1 / sqrt(5) phi.alt^n), quad
+  phi.alt = (1 + sqrt(5)) / 2 $
+
+#let count = 8
+#let nums = range(1, count + 1)
+#let fib(n) = (
+  if n <= 2 { 1 }
+  else { fib(n - 1) + fib(n - 2) }
+)
+
+The first #count numbers of the sequence are:
+
+#align(center, table(
+  columns: count,
+  ..nums.map(n => $F_#n$),
+  ..nums.map(n => str(fib(n))),
+))
+
+#include "undergradmath.typ"
+
-- 
cgit v1.2.3