Skip to content

Fix math dots #228

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 6, 2023
Merged

Fix math dots #228

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions docs/04-algorithms/01-recursion/index.mdx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,7 @@ $$

**解法 2**

他には、次のようにして $a_1,a_2,a_3,\cdots$ のように順番に求めていくこともできます。
他には、次のようにして $a_1,a_2,a_3,\dots$ のように順番に求めていくこともできます。

<ViewSource path="/recursion/recurrence_relation_dp.ipynb" />

Expand Down Expand Up @@ -113,7 +113,7 @@ $$
次のような数列になっています。

$$
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, \cdots
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, \dots
$$

<ViewSource path="/recursion/fib.ipynb" />
Expand Down Expand Up @@ -286,7 +286,7 @@ $$
リュカ数列は次のようになります。

$$
2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, \cdots
2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, \dots
$$

:::info
Expand Down Expand Up @@ -332,7 +332,7 @@ $$
トリボナッチ数列は次のようになります。

$$
0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, 149, 274, 504, \cdots
0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, 149, 274, 504, \dots
$$

:::note
Expand Down
2 changes: 1 addition & 1 deletion docs/04-algorithms/06-dp/index.mdx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ import Hint from "@site/src/components/Hint";

動的計画法の説明に必ずといってもいいほどよく使われるフィボナッチ数列を例に説明していきます。

フィボナッチ数列 $F_n$ ( $0, 1, 1, 2, 3, 5, 8, 13, 21, 34 \cdots$ )は、次のように定義されるのでした。
フィボナッチ数列 $F_n$ ( $0, 1, 1, 2, 3, 5, 8, 13, 21, 34,\dots$ )は、次のように定義されるのでした。

$$
\begin{align*}
Expand Down