New posted more ...
- Fleury 算法
- MST(Minimum Spanning Tree)最小生成树
- 将数字 $1,2,3,\ldots,12$ 填入下面的表格, 使得每行、每列以及每个田字格内的四个数字之和都相等.
- 试建立 $I_n=\int_{0}^{\frac{\pi}{2}}\frac{\sin^2(nt)}{\sin t}dt$ 的递推公式.
Categories
- Algebra
- Geometry
- Analysis
- Number Theory
- Topology
- Probability & Statistics
- Computational math
- Applied Mathematics
- Foundations of Math
- Recreational Math