T*n
2 楼
staples的deal,第一台HP$250,Acer$300。HP应该更好些,但是担心n3530会不会太慢
。另外touchscreen实际使用上有多大好处?多谢了
1) HP 15-r063nr [staples.com] - In ad for $349 (originally $499). Should be
$249 after coupon
Intel® Pentium® N3530 Processor
4GB DDR3L SDRAM, 500GB 5400RPM hard drive
15.6-inch diagonal HD BrightView WLED-backlit touchscreen display (
1366x768)
1 x USB 3.0 port and 2 x USB 2.0 ports
1x1 802.11b/g/n WLAN
Windows 8.1
2)Toshiba C55-B5272 [staples.com] In ad for $399 AR ($549 originally).
Should be $299 AR and coupon.
Intel® Core™ i3-3217U Processor
6GB DDR3L memory, 750G hard drive
15.6” diagonal, TruBrite® display.
1 USB 3.0 port and 2 USB 2.0 ports: For fast digital video, audio and
data transfer.
Built-in high-speed wireless LAN (802.11b/g/n)
Windows 7 Home Premium
。另外touchscreen实际使用上有多大好处?多谢了
1) HP 15-r063nr [staples.com] - In ad for $349 (originally $499). Should be
$249 after coupon
Intel® Pentium® N3530 Processor
4GB DDR3L SDRAM, 500GB 5400RPM hard drive
15.6-inch diagonal HD BrightView WLED-backlit touchscreen display (
1366x768)
1 x USB 3.0 port and 2 x USB 2.0 ports
1x1 802.11b/g/n WLAN
Windows 8.1
2)Toshiba C55-B5272 [staples.com] In ad for $399 AR ($549 originally).
Should be $299 AR and coupon.
Intel® Core™ i3-3217U Processor
6GB DDR3L memory, 750G hard drive
15.6” diagonal, TruBrite® display.
1 USB 3.0 port and 2 USB 2.0 ports: For fast digital video, audio and
data transfer.
Built-in high-speed wireless LAN (802.11b/g/n)
Windows 7 Home Premium
a*x
3 楼
我本科时一直想到的,自己没做出来。那个会证pi是无理数的帮个忙。
2^(2^(2^(...(2^n)))...)+1这种形式的自然数,指数共i层,n是自然数。是否存在i
,使
得所有的这种形式的数都是质数
2^(2^(2^(...(2^n)))...)+1这种形式的自然数,指数共i层,n是自然数。是否存在i
,使
得所有的这种形式的数都是质数
i*t
5 楼
你家小朋友多大?
be
【在 T****n 的大作中提到】
: staples的deal,第一台HP$250,Acer$300。HP应该更好些,但是担心n3530会不会太慢
: 。另外touchscreen实际使用上有多大好处?多谢了
: 1) HP 15-r063nr [staples.com] - In ad for $349 (originally $499). Should be
: $249 after coupon
: Intel® Pentium® N3530 Processor
: 4GB DDR3L SDRAM, 500GB 5400RPM hard drive
: 15.6-inch diagonal HD BrightView WLED-backlit touchscreen display (
: 1366x768)
: 1 x USB 3.0 port and 2 x USB 2.0 ports
: 1x1 802.11b/g/n WLAN
be
【在 T****n 的大作中提到】
: staples的deal,第一台HP$250,Acer$300。HP应该更好些,但是担心n3530会不会太慢
: 。另外touchscreen实际使用上有多大好处?多谢了
: 1) HP 15-r063nr [staples.com] - In ad for $349 (originally $499). Should be
: $249 after coupon
: Intel® Pentium® N3530 Processor
: 4GB DDR3L SDRAM, 500GB 5400RPM hard drive
: 15.6-inch diagonal HD BrightView WLED-backlit touchscreen display (
: 1366x768)
: 1 x USB 3.0 port and 2 x USB 2.0 ports
: 1x1 802.11b/g/n WLAN
d*n
10 楼
做inspection是对自己负责呀,谁也不能保证新房就没有问题呀。
H*i
12 楼
这不就是增长飞快的费马数么。。
a*x
13 楼
费马数只有两层,而且被证明了不一定是素数。我是想知道多到几层时会都成为素数。
以前编程算过,很快溢出了
以前编程算过,很快溢出了
H*i
14 楼
编程肯定不行啊 你2^2^2^2就是F16 现在验证过的只到F12 13左右
不过有生之年F16或许还能看到验证。。
不过有生之年F16或许还能看到验证。。
S*I
15 楼
根据wiki:
As of 2010 it is known that Fn is composite for 5 ≤ n ≤ 32, although
complete factorizations of Fn are known only for 0 ≤ n ≤ 11, and there are
no known factors for n = 20 and n = 24. The largest Fermat number known to
be composite is F2747497, and its prime factor 57×2^2747499 + 1 was
discovered by Marshall Bishop in PrimeGrid's Proth Prime Search on May 13,
2013.
【在 H*******i 的大作中提到】
: 编程肯定不行啊 你2^2^2^2就是F16 现在验证过的只到F12 13左右
: 不过有生之年F16或许还能看到验证。。
As of 2010 it is known that Fn is composite for 5 ≤ n ≤ 32, although
complete factorizations of Fn are known only for 0 ≤ n ≤ 11, and there are
no known factors for n = 20 and n = 24. The largest Fermat number known to
be composite is F2747497, and its prime factor 57×2^2747499 + 1 was
discovered by Marshall Bishop in PrimeGrid's Proth Prime Search on May 13,
2013.
【在 H*******i 的大作中提到】
: 编程肯定不行啊 你2^2^2^2就是F16 现在验证过的只到F12 13左右
: 不过有生之年F16或许还能看到验证。。
S*I
16 楼
根据wiki:
There are no other known Fermat primes Fn with n > 4. However, little is
known about Fermat numbers with large n. In fact, each of the following is
an open problem:
Is Fn composite for all n > 4?
Are there infinitely many Fermat primes?
Are there infinitely many composite Fermat numbers?
你的这个数是Fermat number的一个特例,如果上述问题解决了,你的问题也就解决了
。当然,这可不是个简单的数学问题。
【在 a*****x 的大作中提到】
: 费马数只有两层,而且被证明了不一定是素数。我是想知道多到几层时会都成为素数。
: 以前编程算过,很快溢出了
There are no other known Fermat primes Fn with n > 4. However, little is
known about Fermat numbers with large n. In fact, each of the following is
an open problem:
Is Fn composite for all n > 4?
Are there infinitely many Fermat primes?
Are there infinitely many composite Fermat numbers?
你的这个数是Fermat number的一个特例,如果上述问题解决了,你的问题也就解决了
。当然,这可不是个简单的数学问题。
【在 a*****x 的大作中提到】
: 费马数只有两层,而且被证明了不一定是素数。我是想知道多到几层时会都成为素数。
: 以前编程算过,很快溢出了
a*x
17 楼
我说了费马数只有两层。所以费马数是我的数的特例
a*x
18 楼
你的意思大概是我的数列是费马数的子集。但是我要的结论是是否存在这样形式的数列
,对所有自然数n,都是素数。我没有看到有人提出过或是证明过。当然我比较孤陋寡闻
【在 S**I 的大作中提到】
: 根据wiki:
: There are no other known Fermat primes Fn with n > 4. However, little is
: known about Fermat numbers with large n. In fact, each of the following is
: an open problem:
: Is Fn composite for all n > 4?
: Are there infinitely many Fermat primes?
: Are there infinitely many composite Fermat numbers?
: 你的这个数是Fermat number的一个特例,如果上述问题解决了,你的问题也就解决了
: 。当然,这可不是个简单的数学问题。
,对所有自然数n,都是素数。我没有看到有人提出过或是证明过。当然我比较孤陋寡闻
【在 S**I 的大作中提到】
: 根据wiki:
: There are no other known Fermat primes Fn with n > 4. However, little is
: known about Fermat numbers with large n. In fact, each of the following is
: an open problem:
: Is Fn composite for all n > 4?
: Are there infinitely many Fermat primes?
: Are there infinitely many composite Fermat numbers?
: 你的这个数是Fermat number的一个特例,如果上述问题解决了,你的问题也就解决了
: 。当然,这可不是个简单的数学问题。
相关阅读
PNAS-Pending Final RecommendationSigns of ageing halted in the lab我所见到的钱学森,朱镕基问 一个lentivirus的问题收到BIT's 4th Annual World Congress of BioSoft-2012的邀请问一下,chemical biology, biochem biophysics有什么区别lentivirus实验请教paper help要转行了,心里有点乱现在生物方面论文的写作水平越来越低了请问国内哪家公司做出租液氮缸的服务? (转载)美国有没有特效药治疗 系统性红斑狼疮 (SLE)?frontiers in microbiology这么杂志怎么样?当年知青出了多少作家The Ph.Diddy is on the scene大家看这个位置值得回去吗?(更新)博士后老张归国记 (转载)Breakingnews: Authorship dispute over Yamanak's 2006 iPS cell paper:))其实郁秀在很多年前的小说“太阳鸟”里面把生物留学生活写的RNA-seq 真的比 microarray 更少的 technical variation 吗?