Give an asymptotic formula for the number of $k\times n$ Latin rectangles.

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Let (L_{k,n}) be the number of (k\times n) Latin rectangles on the symbol set ({1,2,\dots,n}) [[nomath]](so each row is a permutation of $1,\dots,n$, and no symbol repeats in any column)[[/nomath]].

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.