加载中…
Let f(n) denote the number of odd entries in the nth row of Pascal’s binomial triangle. We study “average dispersion” and “typical dispersion” of f(n) – the latter involves computing a generalized Lyapunov exponent – and then turn to numerical analysis of higher dimensional examples.

生成讲解博客的中文版本

生成AI智能校验的中文版本