Stepwise Progression of the Expanded
Euclidean Algorithm in PHP

HINT: The modulo % operator yields the remainder of division and the quotient is ignored.
HENCE: 5 ÷ 2 = 2.5, but 5 % 2 = 1 {1 remaining after dividing 5 by 2}.                         Refresh this page.

16 random numbers 432 372 65 487 313 174 311 453 169 495 292 335 496 46 44 123
multiply by 1 432 372 65 487 313 174 311 453 169 495 292 335 496 46 44 123
sort from left to right 44 46 65 123 169 174 292 311 313 335 372 432 453 487 495 496
shift to the right 0 44 46 65 123 169 174 292 311 313 335 372 432 453 487 495
modulo remainder 44 2 19 58 46 5 118 19 2 22 37 60 21 34 8 1
sort from left to right 1 2 2 5 8 19 19 21 22 34 37 44 46 58 60 118
shift to the right 0 1 2 2 5 8 19 19 21 22 34 37 44 46 58 60
modulo remainder 1 0 0 1 3 3 0 2 1 12 3 7 2 12 2 58
sort from left to right 1 1 1 2 2 2 3 3 3 7 12 12 58      
shift to the right 0 1 1 1 2 2 2 3 3 3 7 12 12      
modulo remainder 1 0 0 0 0 0 1 0 0 1 5 0 10      
sort from left to right 1 1 1 5 10                      
shift to the right 0 1 1 1 5                      
modulo remainder 1 0 0 0 0