There are 1001 stacks of coins S₁, S₂, ..., S₁₀₀₁. Initially, stack S_k has k coins for each k = 1,2, ...,1001. In an operation, one selects an ordered pair (i,j) of indices i and j satisfying 1 ≤ i < j ≤ 1001 subject to two conditions:

The stacks S_i and S_j must each have at least 1 coin.
The ordered pair (i,j) must not have been selected before. Then, if S_i and S_j have a coins and b coins respectively, one removes gcd(a,b) coins from each stack.

What is the maximum number of times this operation could be performed?

Cube root infested denominator |
Posted on 2025-04-12 by Danish Ahmed Khan (No Solution Yet, 3 Comments)

Quadratic fractions |
Posted on 2025-04-10 by Danish Ahmed Khan (No Solution Yet, 4 Comments)

Cubes in either side |
Posted on 2025-04-09 by Danish Ahmed Khan (No Solution Yet, 1 Comments)

Find the Function 2 |
Posted on 2025-04-06 by K Sengupta (No Solution Yet, 1 Comments)

Symmetric Equations and Expressions |
Posted on 2025-03-29 by Danish Ahmed Khan (No Solution Yet, 5 Comments)

Possible Values of Expression Evaluation |
Posted on 2025-03-27 by Danish Ahmed Khan (No Solution Yet, 3 Comments)

A Cubed Divisor |
Posted on 2025-03-25 by Brian Smith (No Solution Yet, 2 Comments)

A Squared Divisor |
Posted on 2025-03-21 by Danish Ahmed Khan (No Solution Yet, 2 Comments)