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

Commit53639d5

Browse files
Update src/algebra/factorization.md
Co-authored-by: Oleksandr Kulkov <adamant.pwn@gmail.com>
1 parent54fec62 commit53639d5

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎src/algebra/factorization.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -190,7 +190,7 @@ Therefore, we will try to perform the $\gcd$ multiple times, while we compute $M
190190
191191
Some composite numbers don't have factors $p$ s.t. $p-1$ is $\mathrm{B}$-powersmooth for small $\mathrm{B}$.
192192
For example, for the composite number $100~000~000~000~000~493 = 763~013 \cdot 131~059~365~961$, values $p-1$ are $190~753$-powersmooth and $1~092~161~383$-powersmooth correspondingly.
193-
We will have to choose $B>= 190~753$ to factorize the number.
193+
We will have to choose $B\geq 190~753$ to factorize the number.
194194
195195
In the following implementation we start with $\mathrm{B} = 10$ and increase $\mathrm{B}$ after each each iteration.
196196

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp