Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit375ca6b

Browse files
authored
log n -> \log n
1 parent4cdc4df commit375ca6b

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎src/algebra/fibonacci-numbers.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -159,7 +159,7 @@ $$
159159
160160
where $F_1 = 1, F_0 = 0$.
161161
162-
Thus, in order to find $F_n$ in $O(log n)$ time, we must raise the matrix to n. (See [Binary exponentiation](binary-exp.md))
162+
Thus, in order to find $F_n$ in $O(\log n)$ time, we must raise the matrix to n. (See [Binary exponentiation](binary-exp.md))
163163
164164
```{.cpp file=fibonacci_matrix}
165165
struct matrix {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp