# Solution to SGU #173 Coins

The transformation X contains two steps: Cyclic left shift Turn over (totally several times) k-th coin if i-th coin and …

Skip to content
# Simple Note

## Full of worms

# Category: Mathematics

# Solution to SGU #173 Coins

The transformation X contains two steps: Cyclic left shift Turn over (totally several times) k-th coin if i-th coin and …

### April 2015

# The Solution to MSBOP 2015 Warmup

### February 2015

# Extended Euclidean Algorithm

The following includes the solution to the first two problems in MSBoP 2015 Warmup. The third problem seems a maximum …

It’s well known that, the Euclidean algorithm can compute the greatest common divisor of integers a and b, gcd(a,b). The …

Close Drawer
## Simple Note