MathDB
Cutting a rope into pieces with a certain ratio

Source: Germany 2019, Problem 5

June 20, 2019
rationumber theorycombinatorics

Problem Statement

We are given two positive integers pp and qq.
Step by step, a rope of length 11 is cut into smaller pieces as follows: In each step all the currently longest pieces are cut into two pieces with the ratio p:qp:q at the same time. After an unknown number of such operations, the currently longest pieces have the length xx.
Determine in terms of xx the number a(x)a(x) of different lengths of pieces of rope existing at that time.