题目内容
(1)已知
=
,
=
,
=
,…试猜测
的结果,并加以证明;
=
,
(2)s=
+
+
+…+
,
求不超过S的最大整数[s].
1+
|
| 3 |
| 2 |
1+
|
| 7 |
| 6 |
1+
|
| 13 |
| 12 |
1+
|
1+
|
| n2+n+1 |
| n(n+1) |
(2)s=
1+
|
1+
|
1+
|
1+
|
求不超过S的最大整数[s].
(1)猜想:
=
.
证明:
=
=
=
;
(2)∵
=1+
-
,
∴s=1+1-
+1+
-
+1+
-
+…+1+
-
=2005+1-
=2005
,
∴[s]=2005.
1+
|
| n2+n+1 |
| n(n+1) |
证明:
1+
|
|
| ||
| n(n+1) |
| n2+n+1 |
| n(n+1) |
(2)∵
| n2+n+1 |
| n(n+1) |
| 1 |
| n |
| 1 |
| n+1 |
∴s=1+1-
| 1 |
| 2 |
| 1 |
| 2 |
| 1 |
| 3 |
| 1 |
| 3 |
| 1 |
| 4 |
| 1 |
| 2005 |
| 1 |
| 2006 |
| 1 |
| 2006 |
| 2005 |
| 2006 |
∴[s]=2005.
练习册系列答案
相关题目