All challenges

Construct a high-value increasing sequence with strictly increasing adjacent gcds.

Estimate divisor counts for hidden integers through the original GCD query protocol.