MathDB
2018 PUMaC Live Round 5.1

Source:

January 13, 2019
PuMACLive Round

Problem Statement

Let ww and hh be positive integers and define N(w,h)N(w,h) to be the number of ways of arranging whwh people of distinct heights for a photoshoot in such a way that they form ww columns of hh people, with the people of each column sorted by height (i.e. shortest at the front, tallest at the back). Find the largest value of N(w,h)N(w,h) that divides 10081008.