费马数
![本页使用了标题或全文手工转换](http://upload.wikimedia.org/wikipedia/commons/thumb/c/cd/Zh_conversion_icon_m.svg/35px-Zh_conversion_icon_m.svg.png)
其中为非负整数。
若是素数,可以得到n必须是2的幂。(若,其中且b为奇数,则,即是的因数。)也就是说,所有具有形式的素数必然是费马数,这些素数称为费马素数。已知的费马素数只有至五个。
基本性质
[编辑]费马数满足以下的递归关系:
其中。这些等式都可以用数学归纳法推出。从最后一个等式中,我们可以推出哥德巴赫定理:任何两个费马数都没有大于1的公因子。要推出这个,我们需要假设且和有一个公因子。那么能把
和都整除;则能整除它们相减的差。因为,这使得。造成矛盾。因为所有的费马数显然是奇数。作为一个推论,我们得到素数个数无穷的又一个证明。
其他性质:
- 的位数可以表示成以为基数就是
- (参见高斯函数).
- 除了以外没有费马数可以表示成两个素数的和。
- 当是奇素数的时候,没有费马数可以表示成两个数的p次方相减的形式。
- 除了和,费马数的最后一位是7。
- 所有费马数(OEIS数列A051158)的倒数之和是无理数。 (所罗门·格伦布,1963)
费马数的因式分解
[编辑]最小的12个费马数为:
F0 | = | 21 | + | 1 | = | 3 | |
F1 | = | 22 | + | 1 | = | 5 | |
F2 | = | 24 | + | 1 | = | 17 | |
F3 | = | 28 | + | 1 | = | 257 | |
F4 | = | 216 | + | 1 | = | 65,537 以上5个是已知的费马素数。 | |
F5 | = | 232 | + | 1 | = | 4,294,967,297 | |
= | 641 × 6,700,417 | ||||||
F6 | = | 264 | + | 1 | = | 18,446,744,073,709,551,617 | |
= | 274,177 × 67,280,421,310,721 | ||||||
F7 | = | 2128 | + | 1 | = | 340,282,366,920,938,463,463,374,607,431,768,211,457 | |
= | 59,649,589,127,497,217 × 5,704,689,200,685,129,054,721 | ||||||
F8 | = | 2256 | + | 1 | = | 115,792,089,237,316,195,423,570,985,008,687,907,853,269,984,665,640,564,039,457,584,007,913,129,639,937 | |
= | 1,238,926,361,552,897 × 93,461,639,715,357,977,769,163,558,199,606,896,584,051,237,541,638,188,580,280,321 | ||||||
F9 | = | 2512 | + | 1 | = | 13,407,807,929,942,597,099,574,024,998,205,846,127,479,365,820,592,393,377,723,561,443,721,764,030,073,546, 976,801,874,298,166,903,427,690,031,858,186,486,050,853,753,882,811,946,569,946,433,649,006,084,097 |
|
= | 2,424,833 × 7,455,602,825,647,884,208,337,395,736,200,454,918,783,366,342,657 × 741,640,062,627,530,801,524,787,141,901,937,474,059,940,781,097,519,023,905,821,316,144,415,759,504,705,008,092,818,711,693,940,737 | ||||||
F10 | = | 21024 | + | 1 | = | 179,769,313,486,231,590,772,930,519,078,902,473,361,797,697,894,230,657,273,430,081,157,732,675,805,500,963,132,708,477,322,407,536,021,120, 113,879,871,393,357,658,789,768,814,416,622,492,847,430,639,474,124,377,767,893,424,865,485,276,302,219,601,246,094,119,453,082,952,085, 005,768,838,150,682,342,462,881,473,913,110,540,827,237,163,350,510,684,586,298,239,947,245,938,479,716,304,835,356,329,624,224,137,217 |
|
= | 45,592,577 × 6,487,031,809 × 4,659,775,785,220,018,543,264,560,743,076,778,192,897 ×
130,439,874,405,488,189,727,484,768,796,509,903,946,608,530,841,611,892,186,895,295,776,832,416,251,471,863,574, | ||||||
F11 | = | 22048 | + | 1 | = | 32,317,006,071,311,007,300,714,876,688,669,951,960,444,102,669,715,484,032,130,345,427,524,655,138,867,890,893,197,201,411,522,913,463,688,717, 960,921,898,019,494,119,559,150,490,921,095,088,152,386,448,283,120,630,877,367,300,996,091,750,197,750,389,652,106,796,057,638,384,067, 568,276,792,218,642,619,756,161,838,094,338,476,170,470,581,645,852,036,305,042,887,575,891,541,065,808,607,552,399,123,930,385,521,914, 333,389,668,342,420,684,974,786,564,569,494,856,176,035,326,322,058,077,805,659,331,026,192,708,460,314,150,258,592,864,177,116,725,943, 603,718,461,857,357,598,351,152,301,645,904,403,697,613,233,287,231,227,125,684,710,820,209,725,157,101,726,931,323,469,678,542,580,656, 697,935,045,997,268,352,998,638,215,525,166,389,437,335,543,602,135,433,229,604,645,318,478,604,952,148,193,555,853,611,059,596,230,657 |
|
= | 319,489 × 974,849 × 167,988,556,341,760,475,137 × 3,560,841,906,445,833,920,513 ×
173,462,447,179,147,555,430,258,970,864,309,778,377,421,844,723,664,084,649,347,019,061,363,579,192,879,108,857,591,038,330,408,837,177,983,810,868,451, |
质因数个数颜色: 红色:2个因数;绿色:3个因数;粉色:4个因数;蓝色:5个因数;橘色:6个因数;紫色:7个因数(含以上);
只有最小的12个费马数被人们完全分解了[1],目前最小不确定质性的费马数是。
不确定质性的数:,n = 33、34、35、44、45、46、...
历史
[编辑]1640年,费马提出了一个猜想,认为所有的费马数都是素数。这一猜想对最小的5个费马数成立,于是费马宣称他找到了表示素数的公式。然而,欧拉在1732年否定了这一猜想,他给出了的分解式:
欧拉证明费马数的因数皆可表成,之后卢卡斯证明费马数的因数皆可表成。
费马的本猜测到了大数可说是大错特错,甚至多数数学家认为不存在第6个费马质数。
定理
[编辑]素性检验
[编辑]方法一
[编辑]设为第个费马数。如果不等于零,那么:
- 是素数,当且仅当。
证明
[编辑]假设以下等式成立:
那么,因此满足的最小整数一定整除,它是2的幂。另一方面,不能整除,因此它一定等于。特别地,存在至少个小于且与互素的数,这只能在是素数时才能发生。
假设是素数。根据欧拉准则,有:
- ,
其中是勒让德符号。利用重复平方,我们可以发现,因此,以及。因为,根据二次互反律,我们便可以得出结论。
方法二
[编辑]根据费马平方和定理,可证明某些费马数为合数。(因为型的质数皆可表示为两正整数的平方和,且表示方法唯一) 例如:
注释
[编辑]
|