2019년 8월 9일 (금) 05:03 판 편집 Sayongjada (토론 \| 기여) 장기인증된 사용자 4,639 편집 편집 요약 없음 ← 이전 편집		2019년 12월 9일 (월) 02:05 판 편집 편집 취소 TedBot (토론 \| 기여) 봇, 업로더 2,725,718 편집 잔글 봇: 인용 틀 구식 변수 정리 다음 편집 →
67번째 줄: == 참고 문헌 == * {{저널 인용 \|author=Graham, R. L. \|author2=Rothschild, B. L. \|title=Ramsey's Theorem for n-Parameter Sets \|journal=Transactions of the American Mathematical Society \|volume=159 \|pages=257–292 \|year=1971 \|doi=10.2307/1996010 \|url=http://www.cs.umd.edu/~gasarch/vdw/Graham-Rothchild.pdf \|jstor=1996010 \|확인날짜=2014-05-26 \|보존url=https://web.archive.org/web/20120401222152/http://www.cs.umd.edu/~gasarch/vdw/Graham-Rothchild.pdf# \|보존날짜=2012-04-01 \|~~깨진링크~~url-status=예dead }} The explicit formula for ''N'' appears on p. 290. This is not the "Graham's number" ''G'' published by Martin Gardner. * Graham, R. L.; Rothschild, B.L. (1978). "Ramsey Theory", ''Studies in Combinatorics'', Rota, G.-G., ed., Mathematical Association of America, '''17''':80–99. On p. 90, in stating "the best available estimate" for the solution, the explicit formula for ''N'' is repeated from the 1971 paper. * {{저널 인용\|author=Gardner, Martin\|title=Mathematical Games\|journal= Scientific American\|volume=237\|pages=18–28\|date=November 1977\|url=http://www.nature.com/scientificamerican/journal/v237/n5/pdf/scientificamerican1177-18.pdf\|doi=10.1038/scientificamerican1177-18}}; reprinted (revised) in Gardner (2001), cited below. 80번째 줄: * [http://www-users.cs.york.ac.uk/susan/cyc/g/graham.htm How to calculate Graham's number] * [http://www.math.ucsd.edu/~fan/ron/papers/pre_cube.pdf Some Ramsey results for the n-cube] prepublication mentions Graham's number * {{웹 인용\|last=Padilla\|first=Tony\|title=Graham's Number\|url=http://www.numberphile.com/videos/grahamsnumber.html\|work=Numberphile\|publisher=[[Brady Haran]]\|author2=Parker, Matt\|확인날짜=2014-05-26\|보존url=https://web.archive.org/web/20140527212509/http://www.numberphile.com/videos/grahamsnumber.html\|보존날짜=2014-05-27\|~~깨진링크~~url-status=예dead}} {{큰 수}}

그레이엄 수: 두 판 사이의 차이