How large the limit it need to calculate the answer using Extended Euclidean algorithm
Extended Euclidean algorithm is well-known for solving Diophantine Equation.But I found sometimes it makes integers out of bound and get wrong.Is there a way to proof that such algorithm bounds the integers in a proper limitations based on how large the absolute value of the given integers are.
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en9 |
|
OtterZ | 2025-09-10 10:35:17 | 3208 | (published) | |
| en8 |
|
OtterZ | 2025-07-22 06:54:16 | 12 | ||
| en7 |
|
OtterZ | 2025-07-22 06:52:34 | 326 | ||
| en6 |
|
OtterZ | 2025-07-22 05:08:39 | 1 | Tiny change: '{C}\rfloor' -> '{C}\rfloor$' | |
| en5 |
|
OtterZ | 2025-07-22 05:08:30 | 98 | ||
| en4 |
|
OtterZ | 2025-07-21 17:04:58 | 250 | Tiny change: ' + B}{C}]} in $\oper' -> ' + B}{C}]}$ in $\oper' | |
| en3 |
|
OtterZ | 2025-07-21 16:50:53 | 407 | ||
| en2 |
|
OtterZ | 2025-04-27 09:47:44 | 0 | (saved to drafts) | |
| en1 |
|
OtterZ | 2025-04-27 09:45:53 | 381 | Initial revision (published) |
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 149 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
