@ilarrosac@diegorattaggi@potetoichiro Nice! I think that the last part may be solved without using the general argument but rather that 5^n grows much quickly than 2^(n+1).
@ixardul@raymondh Make its name dotted. For example:
from types import SimpleNamespace
matches = SimpleNamspace(your_var=your_var)
match x:
case matches.your_var:
...
@maths_language @AlgebraFact nCk is the coeeficient of x^ky^n. To see that, note that \sum_n \sum_k x^ky^n=\sum_n y^n \sum_k x^k = \sum_n y^n(1+x)^n = 1/(1-y(1+x)).