upgrade RHEL5 to RHEL6
By adding in “upgradeany” after the RHEL6 installation CD/DVD’s GRUB interface, it allowed to do the upgrading.
(Press TAB, and add on upgradeany after initre=initrd.img)
However, it failed on package kde-filesystem.
To resolve this, press Ctrl-Alt-F2, it will bring you into a shell of the installation environment.
From here, you can try
$ cd /mnt/source/Packages
$ yum -ivh –force –root /mnt/sysimage
This will tell you what’s wrong on installing it.
For mine, it was a series of folders in RHEL5 that should be replaced by symbolic links.
I hand moved the files in those folders to where they supposed to be for RHEL6, and created the symbolic links. Then the upgrading was able to proceed.
Cheers!
Install NVIDIA driver to RHEL6
$ setsebool -P allow_execstack on
$ nano /etc/modprobe.d/nvidia-installer-disable-nouveau.conf
and put in
blacklist nouveau
options nouveau modeset=0
$ nano /boot/grub/grub.conf
and append
nomodeset rdblacklist=nouveau
to the kernel line
$ nano /etc/inittab
change
id:5:initdefault:
to
id:3:initdefault:
$ shutdown -r now
After reboot:
$ sh NVIDIA-Linux-x86_64-xxx.xx.xx.run
It will install normally.
$ nano /etc/inittab
change
id:3:initdefault:
to
id:5:initdefault:
$ shutdown -r now
19th Recursive prime in the form of p[k+1]=l(k+1)*(m[k]^2-n[k]^2)+/-1, while p[k]=m[k]+n[k]
Define:
p[1] = m[1] + n[1] = 2 + 1
p[2](l=2) = 2*(m[1]^2-n[1]^2)-1 = 2*(4-1)-1 = 5 = 2^3 – 3
p[3](l=2) = 2*(2^6-3^2)-1 = 2^7 – 19
p[4](l=4) = 4*(2^14 – 19^2) -1 = 2^16 – 1445
p[5](l=8) = 8*(2^32 – 1445^2) +1 = 2^35 – 16704199
p[6](l=18) = 2^71*3^2 – (16704199^2*18+1)
p[7](l=84) = 2^144*3^5*7 – ((16704199^2*18+1)^2*84+1)
p[8](l=228) = 2^290*3^11*7^2*19 – ((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)
p[9](l=100) = 2^582*3^22*5^2*7^4*19^2 – (((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)
p[10](l=858) = 2^1165*3^45*5^4*7^8*11*13*19^4 – ((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)
p[11](l=790) = 2^2331*3^90*5^9*7^16*11^2*13^2*19^8*79 – (((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)
p[12](l=1110) = 2^4663*3^181*5^19*7^32*11^4*13^4*19^16*37*79^2 – ((((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)^2*1110-1)
p[13](l=1602) = 2^9327*3^364*5^38*7^64*11^8*13^8*19^32*37^2*79^4*89 – (((((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)^2*1110-1)^2*1602-1)
p[14](l=6600) = 2^18657*3^729*5^78*7^128*11^17*13^16*19^64*37^4*79^8*89^2 – ((((((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)^2*1110-1)^2*1602-1)^2*6600+1)
p[15](l=11940) = 2^37316*3^1459*5^157*7^256*11^34*13^32*19^128*37^8*79^16*89^4*199 – (((((((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)^2*1110-1)^2*1602-1)^2*6600+1)^2*11940+1)
p[16](l=52806) = 2^74633*3^2919*5^314*7^512*11^68*13^65*19^256*37^16*79^32*89^8*199^2*677 – ((((((((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)^2*1110-1)^2*1602-1)^2*6600+1)^2*11940+1)^2*52806+1)
p[17](l=64860) = 2^149268*3^5839*5^629*7^1024*11^136*13^130*19^512*23*37^32*47*79^64*89^16*199^4*677^2 – (((((((((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)^2*1110-1)^2*1602-1)^2*6600+1)^2*11940+1)^2*52806+1)^2*64860-1)
p[18](l=229682) = 2^298537*3^11678*5^1258*7^2048*11^272*13^260*19^1024*23^2*37^64*41*47^2*79^128*89^32*199^8*677^4*2801 – (((((((((((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)^2*1110-1)^2*1602-1)^2*6600+1)^2*11940+1)^2*52806+1)^2*64860-1)^2*229682-1)
p[19](l=192788) = 2^597076*3^23356*5^2516*7^4096*11^544*13^520*19^2048*23^4*37^128*41^2*47^4*79^256*89^64*199^16*677^8*2801^2*48197-(((((((((((((((1445^2*8-1)^2*18+1)^2*84+1)^2*228-1)^2*100+1)^2*858+1)^2*790+1)^2*1110-1)^2*1602-1)^2*6600+1)^2*11940+1)^2*52806+1)^2*64860-1)
2*229682-1)^2*192788-1)
New prime found: 2^74015*3^42*35^8*5863^16*137^73952*953^2*1223^4*15217 – ((((3643*121875747021497257)^2*19568-1)^2*7624+1)^2*273906-1)
Using Primo, 274^2311 – 83 is proven a prime number.
Define this as p[1]=a[1]-b[1], while a[1]=274^2311 and b[1]=83.
p[2]=16236*(a[1]^2-b[1]^2)-1
=16236*274^4622 – 111849805
is proven prime using pfgw:
pfgw -h”p[1]” -tp “p[2]”
Keep going in this way, it is obtained:
p[3]=2^9249*3^5*5*7*11^2*13^2*41^2*137^9244 – (3643*121875747021497257)
p[4]=2^18502*3^10*5^2*7^2*11^4*13^4*41^4*137^18488*1223 – ((3643*121875747021497257)^2*19568-1)
p[5]=2^37007*3^20*35^4*5863^8*137^36976*953*1223^2 – (((3643*121875747021497257)^2*19568-1)^2*7624+1)
p[6]=2^74015*3^42*35^8*5863^16*137^73952*953^2*1223^4*15217 – ((((3643*121875747021497257)^2*19568-1)^2*7624+1)^2*273906-1)
Certificate will be posted in the reply of this.
Recursive prime brother by Brillhart – Lehmer – Selfridge algorithm
Define:
p[k,i]=ABS[1+2*n[k,i]*p[k-1,1]*p[k-1,2]],n[k,1] is the integer with minimum ABS[n[k,1]] that makes p[k,1] a prime number, and n[k,2] is the integer with second minimum ABS[n[k,2]] that makes p[k,2] a prime number
The primality of p[k,i] can be proven using Brillhart – Lehmer – Selfridge algorithm recursively by using p[k-1,1] and p[k-1,2] as helper since n is a small integer, by reducing k to 1.
With this idea, taking
p[0,1]=1, p[0,2]=1
We got the n[i,j] ( columns : i; rows: k):
| k | i=1 | i=2 |
| 1 | 1 | -2 |
| 2 | -1 | 1 |
| 3 | 1 | -2 |
| 4 | -3 | -5 |
| 5 | -11 | 19 |
| 6 | 51 | 94 |
| 7 | 7 | 33 |
| 8 | 147 | -165 |
| 9 | 15 | -29 |
| 10 | 5 | 339 |
| 11 | 412 | -1260 |
| 12 | 356 | 848 |
| 13 | 4809 | -5641 |
| 14 | -5215 | -5539 |
| 15 | 37695 | 41772 |
| 16 | 5343 | -6180 |
| 17 | -31463 | -36980 |
| 18 | 181802 | -292989 |
| 19 | 70660 | – |
The last three, p[19,1] makes top 5000 list.
The proof will be posted in the reply of this one.
Obama needs to lay off China
http://www.timesherald.com/articles/2010/11/22/opinion/doc4ceb43d395db0626282614.txt?viewmode=fullstory
Published: Monday, November 22, 2010
BY Deroy Murdock
Commentary
RALEIGH, N.C. — President Obama should lay off of China. The only thing keeping U.S. capitalism afloat is Chinese Communism.
During his recent Asian adventure, Obama discussed China with journalists in Seoul. He said that, “it’s very important that it (China) act in a responsible fashion internationally.” Obama added that the question of China’s currency “is an irritant not just to the United States, but is an irritant to a lot of China’s trading partners and those who are competing with China to sell goods around the world.”
To Chinese ears, this must sound like a temperance lecture delivered by a man wielding a pitcher of martinis.
Obama and other American officials accuse China of undervaluing its currency, thus making Chinese exports globally cost-competitive.
This fine whine is pretty darn rich, given Washington’s appropriately excoriated policy of “quantitative easing” (QE). This elegant phrase sugarcoats the massive printing of dollars by Federal Reserve chairman Ben “Kinko’s” Bernanke.
The Fed quantitatively eased $1.7 trillion after the economy slumped in 2008. Seeing how beautifully that worked, Bernanke embarked on a brand-new, $600 billion print run of dollars (nicknamed QE2), in exchange for U.S. Treasury bonds.
In the last two weeks since Bernanke announced this policy, the dollar skidded 1.4 percent against the British pound, 2.8 percent versus the Japanese yen, and 3.8 percent compared to the euro.
Thus, in an act of eye-popping hypocrisy, Washington practices precisely the same behavior for which it loudly denounces Beijing.
Besides, America should compete on quality, not price.
With China still in his crosshairs, Obama also said in Seoul, “Countries with large surpluses must shift away from unhealthy dependence on exports and take steps to boost domestic demand.”
He added: “No nation should assume that their path to prosperity is paved simply with exports to the United States.”
Now, do these godforsaken exports tumble from bombers piloted by the People’s Liberation Army Air Force? No. Do Chinese secret agents strap these products to donkeys and deploy them northward across America’s porous southern frontier? Negative. Nor do Chinese exports land on our beaches after being whisked here aboard Chinese Navy submarines.
Beijing’s exports should be no more surprising than a home delivery of wonton soup ordered from a local Chinese restaurant. Chinese-made goods are here because Americans demand them.
These “dirty Chinese exports” that protectionists like Obama condemn are ordered by U.S.-based managers and purchasing agents who market them to their American customers.
At the request of their U.S. clients and business partners, China is filling America’s homes and offices with increasingly high-quality goods at steadily falling prices.
And for this, Obama complains?
Obama should ask himself: “Why do US companies leave America to manufacture in China?” Perhaps lowering America’s 35 percent corporate tax (the developed world’s highest), easing Big Labor’s kung fu grip on U.S. factories, and making this country less sue-happy might entice domestic companies to build their goods in Sheboygan rather than Shenzhen.
Meanwhile, it is foolish to use the word “irritant” to refer to the country that pays America’s monthly allowance. China regularly purchases U.S. bonds, which helps keep interests rates low and lets Washington push its fiscal day of reckoning ever deeper into a receding horizon.
In fact, China bought $15.1 billion in Treasurys in September, boosting its portfolio of US government debt to $883.5 billion.
So long as China keeps bringing its checkbook to U.S. Treasury bond auctions, it is beyond idiotic for Obama and other US politicians to keep giving China the finger.
This is no way to treat America’s lead international banker.
Rather than scream like hungry infants about Chinese exports, Obama and like-minded American officials should stare in the mirror and ask themselves this: How has big government made the United States so uncompetitive that it is more economical for American companies to abandon domestic factories and, instead, manufacture in a nominally Communist country on the opposite side of the planet?
Deroy Murdock is a columnist with Scripps Howard News Service and a media fellow with the Hoover Institution on War, Revolution and Peace at Stanford University. E-mail him at deroy.Murdock@gmail.com.
Recursive Generalized Fermat Prime found
Define p(0)=1;
finding the smallest General Fermat prime in the form p(n+1)[m]=(2*m*p(n))^2+1, m is positive integer:
p(1)[1]=(2*p(0))^2+1=5;
p(2)[1]=(2*p(1))^2+1=101;
p(3)[5]=(2*5*p(2))^2+1=1020101;
p(4)[48]=(2*48*p(3))^2+1=((1020101)*96)^2+1;
p(5)[1]=(2*p(4))^2+1=((((1020101)*96)^2+1)*2)^2+1;
p(6)[30]=(2*30*p(5))^2+1=((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1;
p(7)[85]=(2*85*p(6))^2+1=((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1;
p(8)[935]=(2*935*p(7))^2+1=((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1;
p(9)[528]=(2*528*p(8))^2+1=((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1;
p(10)[2505]=(2*2505*p(9))^2+1=((((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1;
p(11)[840]=(2*840*p(10))^2+1=((((((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1)*1680)^2+1;
p(12)[1190]=(2*1190*p(11))^2+1=((((((((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1)*1680)^2+1)*2380)^2+1;
p(13)[29382]=(2*29382*p(12))^2+1=((((((((((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1)*1680)^2+1)*2380)^2+1)*58764)^2+1;
p(14)[25176]=(2*25176*p(13))^2+1=((((((((((((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1)*1680)^2+1)*2380)^2+1)*58764)^2+1)*50352)^2+1;
p(15)[12685]=(2*12685*p(14))^2+1=((((((((((((((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1)*1680)^2+1)*2380)^2+1)*58764)^2+1)*50352)^2+1)*25370)^2+1;
p(16)[67852]=(2*67852*p(15))^2+1=((((((((((((((((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1)*1680)^2+1)*2380)^2+1)*58764)^2+1)*50352)^2+1)*25370)^2+1)*135704)^2+1;
p(17)[299549]=(2*299549*p(16))^2+1=((((((((((((((((((((((((((((1020101)*96)^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1)*1680)^2+1)*2380)^2+1)*58764)^2+1)*50352)^2+1)*25370)^2+1)*135704)^2+1)*599098)^2+1;
p(18)[62406]=(2*62406*p(17))^2+1=((((((((((((((((((((((((((((97929696^2+1)*2)^2+1)*60)^2+1)*170)^2+1)*1870)^2+1)*1056)^2+1)*5010)^2+1)*1680)^2+1)*2380)^2+1)*58764)^2+1)*50352)^2+1)*25370)^2+1)*135704)^2+1)*599098)^2+1)*124812)^2+1;
p(4) has database ID 96548 in The List of Largest Known Primes Home Page. The direct link is HERE.
These primes are recursively proven using OpenPFGW, by the command
pfgw -t (or tp) -h”p(n)” p(n+1)
The number
p(n+1)[m]=(2*m*p(n))^2+1
are reformatted by Mathematica to get the short expression.
The final certification code is
#!/bin/sh
./pfgw -l”GF.19.cert” -t -h”p_03″ p_04
./pfgw -l”GF.19.cert” -t -h”p_04″ p_05
./pfgw -l”GF.19.cert” -t -h”p_05″ p_06
./pfgw -l”GF.19.cert” -t -h”p_06″ p_07
./pfgw -l”GF.19.cert” -t -h”p_07″ p_08
./pfgw -l”GF.19.cert” -t -h”p_08″ p_09
./pfgw -l”GF.19.cert” -t -h”p_09″ p_10
./pfgw -l”GF.19.cert” -t -h”p_10″ p_11
./pfgw -l”GF.19.cert” -t -h”p_11″ p_12
./pfgw -l”GF.19.cert” -t -h”p_12″ p_13
./pfgw -l”GF.19.cert” -t -h”p_13″ p_14
./pfgw -l”GF.19.cert” -t -h”p_14″ p_15
./pfgw -l”GF.19.cert” -t -h”p_15″ p_16
./pfgw -l”GF.19.cert” -t -h”p_16″ p_17
./pfgw -l”GF.19.cert” -t -h”p_17″ p_18
The certificate will be posted when done.
Recursive prime p(k+1)=m*((n*p(k))^3+1)+1 base 12^9*5^5^5+7
Define p(0)=12^9*5^5^5+7;
p(1)[m=466;n=78]=466*((78*(12^9*5^3125+7))^3+1)+1;
p(2)[m=6470;n=884]=6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1;
p(3)[m=278822;n=33410]=278822*((33410*(6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1))^3+1)+1;
p(4)[m=145950;n=46953]=145950*((46953*( 278822*((33410*(6470*((884*(466*((78*(12^9*5^3125+7))^3+1)+1))^3+1)+1))^3+1)+1))^3+1)+1;
p(4) has database ID 96540 in The List of Largest Known Primes Home Page. The direct link is HERE.
The kernel 12^9*5^5^5+1 is proven by Primo. The certificate is in the first reply of this post.
The recursive primes are proven using OpenPFGW, by the command
pfgw -t (or tp) -h”p(k)” p_h(k+1); pfgw -t (or tp) -h”p_h(k+1)” p(k+1)
The number
p_h(k+1)=(n*p(k)-1)*(n*p(k))+1=(n*p(k))^2-n*p(k)+1
p(k+1)=m*((n*p(k))^3+1)+1=m*(n*p(k)+1)((n*p(k))^2-n*p(k)+1)+1=m*(n*p(k)+1)*p_h(k+1)+1
are reformatted by Mathematica to get the short expression.
The final certification code is
#!/bin/sh
./pfgw -l”pmtup_5.4.2.cert” -t -h”p_00″ ph_01
./pfgw -l”pmtup_5.4.2.cert” -t -h”ph_01″ p_01
./pfgw -l”pmtup_5.4.2.cert” -t -h”p_01″ ph_02
./pfgw -l”pmtup_5.4.2.cert” -t -h”ph_02″ p_02
./pfgw -l”pmtup_5.4.2.cert” -t -h”p_02″ ph_03
./pfgw -l”pmtup_5.4.2.cert” -t -h”ph_03″ p_03
./pfgw -l”pmtup_5.4.2.cert” -t -h”p_03″ ph_04
./pfgw -l”pmtup_5.4.2.cert” -t -h”ph_04″ p_04
The certificate will be posted when done.
美国的最低工资如何生活。
哦。筒子们，
60美元：
买一幢三室二厅180平米20万美元的房子，30年贷款，平均每个工作日的还贷交保险需要花费60美元。没钱吃饭了 :-(。杯具。
租一个一室一厅的60平米的公寓单元，平均每个工作日房租水电煤气35美元。还有25美元可以用。
买一辆16000美元的便宜低档新车，5年贷款，平均每个工作日的还贷交保险需要花费17.5美元。还有7.5美元可以用。
电视电话上网，搞个最便宜的计划，平均每个工作日的费用大约5美元。还剩2.5美元。正好加一加仑汽油。没钱吃饭了。活不下去。 :-(。杯具。
租老太太30平米的地下室，免水电，平均每个工作日房租15美元。还有45美元可以用。
买一辆8000美元的开了80000迈的旧车，三年贷款（没法五年，因为五年多半报废），平均每个工作日的还贷交保险需要花费13.5美元。还有31.5美元可以用。
每天上下班，干掉1加仑汽油。2.5美元。还有29美元可用。
上网去公共图书馆。手机总得有一个，好让老板找得到你。来最便宜的，平均每个工作日1.5美元。还剩27.5美元。
洗衣服用投币的，每周一次，平均每个工作日0.5美元。还剩27美元。
外衣，鞋，每年冬夏各一套，内衣袜子每年一包，都买过季甩卖的。平均每个工作日1.5美元。还剩25.5美元。
家具从垃圾堆里拣，算免费。还剩25.5美元。
大小便公厕解决，算免费。还剩25.5美元。
每日三餐，主粮一磅，肉类6盎司，蔬菜一磅，牛奶一杯，自己用电炉做，平均每个工作日3.5美元。还剩22美元。
如果你不是在打黑工，虽然收入低可以不扣联邦税。另外假设你在一个没有州税的州，你仍然要被扣7.65%的社保税和老年医保税。4.6美元飞了。还剩17.4美元。
你的雇主给你购买最基本的医疗保险。但是你每月还得自掏二三十美元。1.2美元每工作日去掉了。还剩16.2美元。
恭喜你，美国单身汉“鼠族”。在这种极端条件下，如果您不生病，不出意外，不度假，不谈朋友，您每年可以储蓄大约4000美元。
如果你不幸结了婚，有一个孩子。住地下室就不行了。至少得一室一厅的60平米的公寓单元，平均每个工作日房租水电煤气35美元。还有25美元可以用。
买一辆8000美元的开了80000迈的旧车，三年贷款（没法五年，因为五年多半报废），平均每个工作日的还贷交保险需要花费13.5美元。还有11.5美元可以用。
每天上下班，干掉1加仑汽油。2.5美元。还有9美元可用。
如果你不是在打黑工，虽然收入低可以不扣联邦税。另外假设你在一个没有州税的州，你仍然要被扣7.65%的社保税和老年医保税。4.6美元飞了。还剩4.4美元。
这个已经不够三个人吃饭了。活不下去。 :-(。杯具。
所以你的另一半必须工作。这样两个人每个工作日挣120美元。
一室一厅的60平米的公寓单元，平均每个工作日房租水电煤气35美元。还有85美元可以用。
因为多了两口人，水电煤气每月多用$60,平均每个工作日多花$3。还有82美元可以用。
买一辆8000美元的开了80000迈的旧车，三年贷款（没法五年，因为五年多半报废），平均每个工作日的还贷交保险需要花费13.5美元。还有68.5美元可以用。
每天上下班，因为两个人接送，加上接送孩子，干掉2加仑汽油。5美元。还有63.5美元可用。
如果你们不是在打黑工，虽然收入低可以不扣联邦税。另外假设你在一个没有州税的州，你们仍然要被扣7.65%的社保税和老年医保税。9.2美元飞了。还有54.3美元可用。
孩子要入托，找私人或者最便宜的教会幼儿园，每月$450。平均每个工作日21美元。还有33.3美元可用。
小孩很容易生病的。总不敢不给他买医疗保险。平均每个工作日7.2美元。还有26.1美元可用。
上网去公共图书馆。手机总得有两个，好让老板找得到你们。来最便宜的，平均每个工作日3美元。还剩23.1美元可用。
洗衣服用投币的，每周一次，三个人衣服多些，平均每个工作日1美元。还剩22.1美元。
外衣，鞋，每年冬夏每人各一套，内衣袜子每年一包，都买过季甩卖的。平均每个工作日4.5美元。还剩17.6美元。
大人家具从垃圾堆里拣，算免费。小孩家具玩具学习用品从yard sale淘，算每工作日1元。还剩16.6美元。
大小便除小孩外公厕解决，手纸什么的算0.1每工作日。还剩16.5美元。
每日三餐，大人主粮一磅，肉类6盎司，蔬菜一磅，牛奶一杯，自己用电炉做，小孩贵一些但少一些。同样价格算。三个人平均每个工作日10.5美元。还剩6美元。
大人可以不去看病。小孩总会感冒发烧打预防针。就算每年去4次，挂号费$140,deductable $600。再花几十美元药钱，就平均每天$3.5了。还剩2.5美元。
大人可以不看电视。双职工不让小孩看电视还怎么休息?现在高清了。免费的电视没有了。只好来一个最基本的闭路计划。平均每个工作日1.5元。现在您还剩1美元。
不是一个人了，洗澡什么的不能总在单位卫生间凑合，浴液香波毛巾总要买一些。还有洗碗和打扫室内卫生的开支。这每工作日1美元就悄悄飞了。
欢迎加入美国的月光蜗居族。
度假看电影什么的就不用想了。万一生病出车祸，就等着被地主扫地出门吧。
美国的最低工资是精确计算的。恰好够三口之家最低限度月光蜗居。
世界主要国家饮食质量比较
谷物人均消费(KG): 中国:152 印度:158 巴西:114 俄国:153 美国:111 日本:115
蔬菜人均消费(KG): 中国:270 印度:68 巴西:46 俄国:114 美国:127 日本:104
肉类人均消费(KG): 中国:54 印度:5 巴西:80 俄国:61 美国:123 日本:43
鸡蛋人均消费(KG): 中国:17 印度:1 巴西:7 俄国:14 美国:14 日本:19
海鱼人均消费(KG): 中国:26 印度:4 巴西:7 俄国:19 美国:24 日本:66
淡水鱼人均消费(KG): 中国:12 印度:2 巴西:3 俄国:4 美国:5 日本:5
牛奶人均消费(KG): 中国:30 印度:108 巴西:119 俄国:172 美国:254 日本:108
酒类人均消费(KG): 中国:38 印度:1 巴西:54 俄国:99 美国:98 日本:49
水果人均消费(KG): 中国:64 印度:37 巴西:109 俄国:71 美国:110 日本:54
日均食物总热量(KCAL): 中国:2980 印度:2472 巴西:3112 俄国:3376 美国:3748 日本:2767
日均食物总蛋白质(g): 中国:89 印度:58 巴西:86 俄国:100 美国:113 日本:91
日均食物总脂肪(g): 中国:92 印度:53 巴西:108 俄国:94 美国:160 日本:86
谷物人均消费(KG):中国:152 发达国家:131 发展中国家: 156
蔬菜人均消费(KG):中国:270 发达国家:115 发展中国家:118
肉类人均消费(KG):中国:54 发达国家:80 发展中国家: 28
鸡蛋人均消费(KG):中国:17 发达国家:12 发展中国家: 7
海鱼人均消费(KG):中国:26 发达国家:23 发展中国家:13
淡水鱼人均消费(KG):中国:12 发达国家:2 发展中国家: 5
牛奶人均消费(KG):中国:30 发达国家:294 发展中国家: 81
酒类人均消费(KG):中国:38 发达国家:85 发展中国家:18
水果人均消费(KG):中国:64 发达国家:86 发展中国家: 55
日均食物总热量(KCAL):中国:2980 发达国家:3331 发展中国家: 2668
日均食物总蛋白质(g):中国:89 发达国家:101 发展中国家: 68
日均食物总脂肪(g):中国:92 发达国家:122 发展中国家: 68