Extended Euclidean Algorithm - видео

The Wolfram Demonstrations Project contains thousands of free interactive visualizations with new entries added daily. The greatest common divisor of two integers a and b can be found by the Euclidean algorithm by successive repeated application of the division algorithm. The extended Euclidean algorithm not only computes gcda b but also returns the numbers s and t s... Contributed by: Stefan Porubsky Based on a program by: Michael Trott,
Источник видео: RuTube.ru (Обучение)