W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/3640Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Okazaki, Hiroyuki | - |
| dc.contributor.author | Aoki, Yosiki | - |
| dc.contributor.author | Shidama, Yasunari | - |
| dc.date.accessioned | 2015-12-06T19:05:36Z | - |
| dc.date.available | 2015-12-06T19:05:36Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 20, Issue 2, 2012, Pages 175-179 | - |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.issn | 1898-9934 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/3640 | - |
| dc.description.abstract | In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based on the source code of the NZMATH, a number theory oriented calculation system developed by Tokyo Metropolitan University [8]. | - |
| dc.description.sponsorship | This work was supported by JSPS KAKENHI 21240001 and 22300285 | - |
| dc.language.iso | en | - |
| dc.publisher | De Gruyter Open | - |
| dc.title | Extended Euclidean Algorithm and CRT Algorithm | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.2478/v10037-012-0020-2 | - |
| dc.description.Affiliation | Okazaki Hiroyuki - Shinshu University, Nagano, Japan | - |
| dc.description.Affiliation | Aoki Yosiki - Shinshu University, Nagano, Japan | - |
| dc.description.Affiliation | Shidama Yasunari - Shinshu University, Nagano, Japan | - |
| dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990. | - |
| dc.description.references | Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990. | - |
| dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990. | - |
| dc.description.references | Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990. | - |
| dc.description.references | Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990. | - |
| dc.description.references | Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990. | - |
| dc.description.references | Czesław Bylinski. The sum and product of finite sequences of real numbers. Formalized Mathematics, 1(4):661-668, 1990. | - |
| dc.description.references | NZMATH development Group. http://tnt.math.se.tmu.ac.jp/nzmath/. | - |
| dc.description.references | Donald E. Knuth. Art of Computer Programming. Volume 2: Seminumerical Algorithms, 3rd Edition, Addison-Wesley Professional, 1997. | - |
| dc.description.references | Rafał Kwiatek and Grzegorz Zwara. The divisibility of integers and integer relative primes. Formalized Mathematics, 1(5):829-832, 1990. | - |
| dc.description.references | Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990. | - |
| dc.description.references | Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990. | - |
| dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990. | - |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2012, Volume 20, Issue 2 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| v10037-012-0020-2.pdf | 268,15 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
