摘要：
For every positive integer $n$ and prime $p$,\begin{equation} v_p(n!)=\sum_{r=1}^{[\log_p n]}[\frac{n}{p^r}]\end{equation}This formula is obvious(Wh... 阅读全文
posted @ 2012-11-28 21:19
叶卢庆
阅读(134)
评论(0)
推荐(0)
摘要：
For every positive integer $n$ and prime $p$,\begin{equation} v_p(n!)=\sum_{r=1}^{[\log_p n]}[\frac{n}{p^r}]\end{equation}This formula is obvious(Wh... 阅读全文
posted @ 2012-11-28 21:19
叶卢庆
阅读(166)
评论(0)
推荐(0)
摘要：
1. 设$b=r_0$.$r_1,r_2,\cdots$是将欧几里德算法应用于$a$与$b$得到的相继余数，证明每两步会缩小余数至少一半，换句话说，验证 \begin{equation} r_{i+2}b$.Thelength of the Euclidean algorithm for ... 阅读全文
posted @ 2012-11-28 19:10
叶卢庆
阅读(246)
评论(0)
推荐(0)
摘要：
1. 设$b=r_0$.$r_1,r_2,\cdots$是将欧几里德算法应用于$a$与$b$得到的相继余数，证明每两步会缩小余数至少一半，换句话说，验证 \begin{equation} r_{i+2}b$.Thelength of the Euclidean algorithm for ... 阅读全文
posted @ 2012-11-28 19:10
叶卢庆
阅读(404)
评论(0)
推荐(0)
摘要：
We define a sequence of integers as follows:\begin{equation} f_0=0\end{equation}\begin{equation} f_1=1\end{equation}\begin{equation} f_n=f_{n-1}+f_... 阅读全文
posted @ 2012-11-28 02:17
叶卢庆
阅读(119)
评论(0)
推荐(0)
摘要：
We define a sequence of integers as follows:\begin{equation} f_0=0\end{equation}\begin{equation} f_1=1\end{equation}\begin{equation} f_n=f_{n-1}+f_... 阅读全文
posted @ 2012-11-28 02:17
叶卢庆
阅读(98)
评论(0)
推荐(0)
浙公网安备 33010602011771号