diff options
| author | Liam Sanft <liam.sanft@gmail.com> | 2023-03-22 09:04:26 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-03-22 09:04:26 +0100 |
| commit | ea3cf39f15c80fb703a616a505f59671ac4042da (patch) | |
| tree | 0c56862c609633bb7626ae3c31b44268086a7339 | |
| parent | 25acefeb5b0cf0977ad01fe3128d494d9617a2cf (diff) | |
Fix typo in README (#111)
Fixed a typo in the README example image and text version of the code example.
- Fixes #101
| -rw-r--r-- | README.md | 5 |
1 files changed, 3 insertions, 2 deletions
@@ -37,9 +37,10 @@ A [gentle introduction][tutorial] to Typst is available in our documentation. However, if you want to see the power of Typst encapsulated in one image, here it is: <p align="center"> - <img alt="Example" width="900" src="https://user-images.githubusercontent.com/17899797/226325459-6baa66fa-4c11-4eba-8f04-ef0fa796aa50.png"/> + <img alt="Example" width="900" src="https://user-images.githubusercontent.com/38260698/226794868-90911832-433a-4575-be88-42d582589403.png"/> </p> + Let's dissect what's going on: - We use _set rules_ to configure element properties like the size of pages or @@ -77,7 +78,7 @@ Let's dissect what's going on: = Fibonacci sequence The Fibonacci sequence is defined through the - _recurrance relation_ $F_n = F_(n-1) + F_(n-2)$. + _recurrence relation_ $F_n = F_(n-1) + F_(n-2)$. It can also be expressed in closed form: $ F_n = floor(1 / sqrt(5) phi.alt^n), quad |