caisin/typst
1
0
Fork 0
mirror of https://github.com/typst/typst synced 2025-05-13 12:36:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix typo in README (#111)

Browse Source 
Fixed a typo in the README example image and text version of the code example.
- Fixes #101
This commit is contained in:
Liam Sanft 2023-03-22 09:04:26 +01:00 committed by GitHub
parent 25acefeb5b
commit ea3cf39f15
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
README.md
View File

@ -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 However, if you want to see the power of Typst encapsulated in one image, here
it is: it is:
<p align="center"> <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> </p>
Let's dissect what's going on: Let's dissect what's going on:
- We use _set rules_ to configure element properties like the size of pages or - 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 = Fibonacci sequence
The Fibonacci sequence is defined through the 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: It can also be expressed in closed form:
$ F_n = floor(1 / sqrt(5) phi.alt^n), quad $ F_n = floor(1 / sqrt(5) phi.alt^n), quad