数学MATH

来源:百度知道 编辑:UC知道 时间:2024/05/13 23:28:51
试确定(2+1)(2^2+1)(2^4+1)......(2^32+1)(2^64+1)的末位数字.
过程

(2+1)(2^2+1)(2^4+1)......(2^32+1)(2^64+1)
= (2 - 1) * (2+1)(2^2+1)(2^4+1)......(2^32+1)(2^64+1)
= (2^2 - 1) *(2^2+1)(2^4+1)......(2^32+1)(2^64+1)
= (2^4 - 1) * (2^4+1)......(2^32+1)(2^64+1)
= …………
= ( 2^64 - 1 ) * ( 2^64 + 1)
= 2^128 - 1
对于2^n的个位数,有以下规律:
2^1 = 2, 个位数 = 2
2^2 = 4, 个位数 = 4
2^3 = 8, 个位数 = 8
2^4 = 16, 个位数 = 6
2^5 = 32, 个位数 = 2
……
可见,每隔4次,就出现一次循环
所以:2^128 的个位数 = 2^4的个位数 = 6
所以:2^128 - 1 的个位数为 5

(2+1)(2^2+1)(2^4+1)......(2^32+1)(2^64+1)
=(2-1)(2+1)(2^2+1)(2^4+1)..(2^32+1)(2^64+1)/(2-1)
=(2-1)(2+1)(2^2+1)(2^4+1)..(2^32+1)(2^64+1)
=(2^2-1)(2^2+1)(2^4+1)..(2^32+1)(2^64+1)
=2^128-1
2的幂的末位变化:
末位变化规律2,4,8,6,2,4....
四个为一组
128/4=32
所以2^128末位为6
2^128-1末为5
原式末位是5