페르마 소수 - 편집 역사

Pythagoras0: /* 메타데이터 */

2022-09-16T10:47:18Z

메타데이터

Pythagoras0: /* 메타데이터 */ 새 문단

2022-09-16T10:43:32Z

메타데이터: 새 문단

Pythagoras0: /* 노트 */ 새 문단

2022-09-16T10:43:30Z

노트: 새 문단

2020년 12월 28일 (월) 11:05에 Pythagoras0님의 편집

2020-12-28T11:05:18Z

2020년 11월 13일 (금) 11:02에 Pythagoras0님의 편집

2020-11-13T11:02:19Z

Pythagoras0: 찾아 바꾸기 – “수학사연표” 문자열을 “수학사 연표” 문자열로

2013-01-15T03:48:31Z

찾아 바꾸기 – “수학사연표” 문자열을 “수학사 연표” 문자열로

Pythagoras0: 찾아 바꾸기 – “
$” 문자열을 “: ” 문자열로$

2013-01-12T17:57:29Z

찾아 바꾸기 – “<br><math>” 문자열을 “:<math>” 문자열로

Pythagoras0: 찾아 바꾸기 – “

” 문자열을 “==” 문자열로

2012-11-01T21:28:34Z

찾아 바꾸기 – “<h5 (.*)">” 문자열을 “==” 문자열로

Pythagoras0: 찾아 바꾸기 – “

” 문자열을 “==” 문자열로

2012-11-01T21:14:20Z

찾아 바꾸기 – “</h5>” 문자열을 “==” 문자열로

Pythagoras0: 찾아 바꾸기 – “

” 문자열을 “==” 문자열로

2012-11-01T13:50:09Z

찾아 바꾸기 – “<h5>” 문자열을 “==” 문자열로

@@ 121번째 줄: / 121번째 줄: @@
 # We actually are able to establish the direct implication which is a real important result in the primality tests for Fermat numbers.<ref name="ref_bca905b7" />
 # Condition 2m + = pn requires p to be either a Mersenne or Fermat prime.<ref name="ref_4393ff84">[https://arxiv.org/pdf/1809.03328 On Upper Bounds with ABC = 2mpn and ABC = 2mpnqr with p and q as Mersenne or Fermat]</ref>
 == 메타데이터 ==

← 이전 판		2022년 9월 16일 (금) 10:43 판
121번째 줄:		121번째 줄:
	# We actually are able to establish the direct implication which is a real important result in the primality tests for Fermat numbers.<ref name="ref_bca905b7" />		# We actually are able to establish the direct implication which is a real important result in the primality tests for Fermat numbers.<ref name="ref_bca905b7" />
	# Condition 2m + = pn requires p to be either a Mersenne or Fermat prime.<ref name="ref_4393ff84">[https://arxiv.org/pdf/1809.03328 On Upper Bounds with ABC = 2mpn and ABC = 2mpnqr with p and q as Mersenne or Fermat]</ref>		# Condition 2m + = pn requires p to be either a Mersenne or Fermat prime.<ref name="ref_4393ff84">[https://arxiv.org/pdf/1809.03328 On Upper Bounds with ABC = 2mpn and ABC = 2mpnqr with p and q as Mersenne or Fermat]</ref>
		+
		+	== 메타데이터 ==
		+
		+	===위키데이터===
		+	* ID : [https://www.wikidata.org/wiki/Q207264 Q207264]
		+	===Spacy 패턴 목록===
		+	* [{'LOWER': 'fermat'}, {'LEMMA': 'prime'}]
		+	* [{'LOWER': 'fermat'}, {'LEMMA': 'number'}]

← 이전 판		2022년 9월 16일 (금) 10:43 판
32번째 줄:		32번째 줄:

	[[분류:소수]]		[[분류:소수]]
		+
		+	== 노트 ==
		+
		+	===말뭉치===
		+	# In fact, it is known that numbers of this form are not prime for values of n from 5 through 30, placing doubt on the existence of any Fermat primes for values of n > 4.<ref name="ref_edbed968">[https://www.britannica.com/science/Fermat-prime Fermat prime \| mathematics]</ref>
		+	# Fermat conjectured in 1650 that every Fermat number is prime and Eisenstein in 1844 proposed as a problem the proof that there are an infinite number of Fermat primes (Ribenboim 1996, p. 88).<ref name="ref_21863434">[https://mathworld.wolfram.com/FermatPrime.html Fermat Prime -- from Wolfram MathWorld]</ref>
		+	# Based on these results, one might conjecture (as did Fermat) that all Fermat numbers are prime.<ref name="ref_77005ae2">[https://artofproblemsolving.com/wiki/index.php/Fermat_prime Art of Problem Solving]</ref>
		+	# To find the Fermat number F n for an integer n , you first find m = 2 n , and then calculate 2 m + 1.<ref name="ref_7c2c701e">[https://www.techtarget.com/whatis/definition/Fermat-prime Definition from WhatIs.com]</ref>
		+	# Surprisingly, Fermat primes arise in deciding whether a regular n-gon (a convex polygon with n equal sides) can be constructed with a compass and a straightedge.<ref name="ref_a529a8a6">[https://sites.millersville.edu/bikenaga/number-theory/fermat-numbers/fermat-numbers.pdf Fermat numbers]</ref>
		+	# No fermat primes beyond (cid:8)4 have been found.<ref name="ref_a8ac433d">[http://www.math.ualberta.ca/~isaac/math324/s12/fermat_numbers.pdf Math 324 summer 2012]</ref>
		+	# There are in(cid:12)nitely many distinct Fermat numbers, each of which is divisible by an odd prime, and since any two Fermat numbers are relatively prime, these odd primes must all be distinct.<ref name="ref_a8ac433d" />
		+	# + 1 is a Fermat number; such primes are called Fermat primes.<ref name="ref_44f407e6">[https://en.wikipedia.org/wiki/Fermat_number Fermat number]</ref>
		+	# From the second equation, we can deduce Goldbach's theorem (named after Christian Goldbach): no two Fermat numbers share a common integer factor greater than 1.<ref name="ref_44f407e6" />
		+	# The sum of the reciprocals of all the Fermat numbers (sequence A051158 OEIS) is irrational.<ref name="ref_44f407e6" />
		+	# Indeed, the first five Fermat numbers F 0 , ..., F 4 are easily shown to be prime.<ref name="ref_44f407e6" />
		+	# The only known Fermat primes are the first five Fermat numbers: F 0 =3, F 1 =5, F 2 =17, F 3 =257, and F 4 =65537.<ref name="ref_fbf82f86">[https://primes.utm.edu/glossary/xpage/FermatNumber.html The Prime Glossary: Fermat number]</ref>
		+	# It only takes two trial divisions to find this factor because Euler showed that every divisor of a Fermat number F n with n greater than 2 has the form k.2n+1+1 (exponent improved to n+2 by Lucas).<ref name="ref_fbf82f86" />
		+	# Now we know that all of the Fermat numbers are composite for the other n less than 31.<ref name="ref_fbf82f86" />
		+	# In other words, every prime of the form 2k + 1 (other than 2 = 20 + 1 ) is a Fermat number, and such primes are called Fermat primes.<ref name="ref_e81de8fb">[http://www.scientificlib.com/en/Mathematics/LX/FermatNumber.html Fermat number]</ref>
		+	# From the last equation, we can deduce Goldbach's theorem (named after Christian Goldbach): no two Fermat numbers share a common integer factor greater than 1.<ref name="ref_e81de8fb" />
		+	# The sum of the reciprocals of all the Fermat numbers (sequence A051158 in OEIS) is irrational.<ref name="ref_e81de8fb" />
		+	# Indeed, the first five Fermat numbers F 0 ,...,F 4 are easily shown to be prime.<ref name="ref_e81de8fb" />
		+	# Indeed, even today, no other Fermat numbers are known to be prime!<ref name="ref_c596120d">[https://johncarlosbaez.wordpress.com/2019/02/05/fermat-primes-and-pascals-triangle/ Fermat Primes and Pascal’s Triangle]</ref>
		+	# Also show that every product of distinct Fermat numbers corresponds to a row of Pascal’s triangle mod 2.<ref name="ref_c596120d" />
		+	# Now, Gauss showed that we can construct a regular n-gon using straight-edge and compass if n is a prime Fermat number.<ref name="ref_c596120d" />
		+	# Wantzel went further and showed that if n is odd, we can construct a regular n-gon using straight-edge and compass if and only if n is a product of distinct Fermat primes.<ref name="ref_c596120d" />
		+	# There are two definitions of the Fermat number.<ref name="ref_25205313">[https://mathworld.wolfram.com/FermatNumber.html Fermat Number -- from Wolfram MathWorld]</ref>
		+	# The much more commonly encountered Fermat numbers are a special case, given by the binomial number of the form .<ref name="ref_25205313" />
		+	# Fermat conjectured in 1650 that every Fermat number is prime and Eisenstein proposed as a problem in 1844 the proof that there are an infinite number of Fermat primes (Ribenboim 1996, p. 88).<ref name="ref_25205313" />
		+	# At present, however, only composite Fermat numbers are known for .<ref name="ref_25205313" />
		+	# In other words, every prime of the form 2 n +1 is a Fermat number, and such primes are called Fermat primes.<ref name="ref_17d186c1">[https://www.rieselprime.de/ziki/Fermat_number Fermat number]</ref>
		+	# From the last equation, we can deduce Goldbach's theorem: no two Fermat numbers share a common factor.<ref name="ref_17d186c1" />
		+	# Indeed, the first five Fermat numbers F 0 ,..., F 4 are easily shown to be prime.<ref name="ref_17d186c1" />
		+	# Although it is widely believed that there are only finitely many Fermat primes, it should be noted that there are some experts who disagree (John Cosgrave: "Fermat 6").<ref name="ref_17d186c1" />
		+	# A019434 List of Fermat primes: primes of form, for someIt is conjectured that there are only 5 terms.<ref name="ref_b3f9ea5b">[https://oeis.org/wiki/Fermat_primes Fermat primes]</ref>
		+	# Numbers of the form F n =22n+1 are now called Fermat numbers*, and when they’re prime, they’re called Fermat primes.<ref name="ref_bfc52e99">[https://blogs.scientificamerican.com/roots-of-unity/extrapolation-gone-wrong-the-case-of-the-fermat-primes/ Extrapolation Gone Wrong: the Case of the Fermat Primes]</ref>
		+	# Fermat conjectured that all Fermat numbers are prime.<ref name="ref_bfc52e99" />
		+	# In 1732, about 70 years after Fermat's death, Leonhard Euler factored the 5th Fermat number into 641×6,700,417, disproving Fermat’s conjecture.<ref name="ref_bfc52e99" />
		+	# So far, the only known Fermat primes are the ones that were known to Fermat.<ref name="ref_bfc52e99" />
		+	# Is there a formula or a way to know which of the Fermat numbers are prime?.<ref name="ref_dc7c427d">[https://math.stackexchange.com/questions/563390/fermat-numbers-are-they-all-prime Fermat numbers. Are they all prime?]</ref>
		+	# Prologue What are the known Fermat primes?<ref name="ref_b2c9d49a">[https://arxiv.org/pdf/1605.01371 This is the extended version of a paper that has appeared in the Mathematical Intelligencer. The ﬁnal publication is available]</ref>
		+	# Taking Fermat prime to mean prime of the form 2n + 1, there are six known Fermat primes, namely those for n = 0, 1, 2, 4, 8, 16.<ref name="ref_b2c9d49a" />
		+	# We shall pronounce the last letter of Fermats name, as he did, when we include 2 among the Fermat primes, as he did.<ref name="ref_b2c9d49a" />
		+	# The Fermat number Fn is either prime or not prime: the question of how to approximate the probability of primality for a general n is delicate.<ref name="ref_b2c9d49a" />
		+	# Fb;n = b2n + 1 and are particularly interesting since they have many characteristics of the heavily studied standard Fermat numbers Fn = F2;n.<ref name="ref_a10cb56f">[https://www.ams.org/journals/mcom/2002-71-238/S0025-5718-01-01350-3/S0025-5718-01-01350-3.pdf Mathematics of computation]</ref>
		+	# The \Proth" program was created in 1997 to extend the search for large factors of Fermat numbers.<ref name="ref_a10cb56f" />
		+	# They are called Fermat numbers, named after the French mathematician Pierre de Fermat (1601 1665) who first studied numbers in this form.<ref name="ref_8f117ada">[https://wstein.org/edu/2010/414/projects/tsang.pdf Fermat]</ref>
		+	# We will not be able to answer this question in this paper, but we will prove some basic properties of Fermat numbers and discuss their primality and divisibility.<ref name="ref_8f117ada" />
		+	# Primes in this form are called Fermat primes.<ref name="ref_8f117ada" />
		+	# Up-to-date there are only five known Fermat primes.<ref name="ref_8f117ada" />
		+	# Moreover, no other Fermat number is known to be prime for n > 4 , so now it is conjectured that those are all prime Fermat numbers.<ref name="ref_6428f90c">[https://planetmath.org/fermatnumbers Fermat numbers]</ref>
		+	# In honour of the inspired pioneers, the numbers of the form 2n-1 are now called the Mersenne numbers and the numbers of the form 2n+1 the Fermat numbers.<ref name="ref_e35d89c0">[http://yves.gallot.pagesperso-orange.fr/primes/ Generalized Fermat Primes Search]</ref>
		+	# The search for Mersenne and Fermat primes has been greatly extended since the 17th century.<ref name="ref_e35d89c0" />
		+	# Today, all the Mersenne primes having less than 2,000,000 digits are known and all the Fermat primes up to 2,000,000,000 digits!<ref name="ref_e35d89c0" />
		+	# In 1994, R. Crandall and B. Fagin discovered that the Discrete Weighted Transforms could be used to double the speed of the search for Mersenne and Fermat numbers.<ref name="ref_e35d89c0" />
		+	# Those are the only primes below 100,000 that I could show must be primitive for all but finitely many Fermat primes.<ref name="ref_9d437e74">[https://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi?board=riddles_putnam;action=display;num=1204796915 Fermat Primes and the number 7]</ref>
		+	# Fermat numbers are named after Pierre de Fermat.<ref name="ref_a462b554">[https://kids.kiddle.co/Fermat_number Fermat number facts for kids]</ref>
		+	# Every prime of the form 2n + 1 is a Fermat number, and such primes are called Fermat primes.<ref name="ref_a462b554" />
		+	# Fermat numbers can be calculated recursively: To get the Nth number, multiply all Fermat numbers before it, and add two to the result.<ref name="ref_a462b554" />
		+	# Two previous posts (here and here) present an alternative proof that there are infinitely many prime numbers using the Fermat numbers.<ref name="ref_e5ed5592">[https://exploringnumbertheory.wordpress.com/2016/10/25/fermat-numbers/ Exploring Number Theory]</ref>
		+	# Specifically, the proof is accomplished by pointing out that the prime factors of the Fermat numbers form an infinite set.<ref name="ref_e5ed5592" />
		+	# The numbers grow very rapidly since each Fermat number is obtained by raising 2 to a power of 2.<ref name="ref_e5ed5592" />
		+	# He demonstrated that the first 5 Fermat numbers , , , , are prime and conjectured that all Fermat numbers are prime.<ref name="ref_e5ed5592" />
		+	# Chapter 4 Fermat and Mersenne Primes 4.1 Fermat primes Theorem 4.1.<ref name="ref_7befcda2">[https://www.maths.tcd.ie/pub/Maths/Courseware/NumberTheory/FermatMersenne.pdf Chapter 4]</ref>
		+	# Fermat conjectured that the Fermat numbers are all prime.<ref name="ref_7befcda2" />
		+	# We will come back to their solution shortly as we must first introduce the notion of a Fermat prime!<ref name="ref_62f9f1ec">[https://vrs.amsi.org.au/fermat-primes-gauss-wantzel/ Fermat Primes and the Gauss-Wantzel Theorem]</ref>
		+	# In the 1600s, a mathematician and lawyer named Pierre de Fermat studied numbers of the form 2^n+1 (where n=2^k) which are now called Fermat numbers.<ref name="ref_62f9f1ec" />
		+	# So, he conjectured that all Fermat numbers are prime.<ref name="ref_62f9f1ec" />
		+	# Funnily enough, it was shown by Leonhard Euler in 1732 (another famous mathematician), that only the next Fermat number is not prime.<ref name="ref_62f9f1ec" />
		+	# It is still open whether there exist innitely many Fermat primes or innitely many composite Fermat numbers.<ref name="ref_0b05fdb4">[https://arxiv.org/pdf/2204.08302 MINIMALITY CONDITIONS EQUIVALENT TO THE FINITUDE OF FERMAT AND MERSENNE PRIMES]</ref>
		+	# Especially, the formula for modulo Fermat primes is given. MSC2010: 11A07.<ref name="ref_9c963bc5">[https://arxiv.org/pdf/1601.06509 The largest cycles consist by the quadratic residues and Fermat primes]</ref>
		+	# For the Fermat primes, i.e., the prime numbers of the form p 22k ` 1, we have Lppq 1. Proof.<ref name="ref_9c963bc5" />
		+	# We have veried it for k 0, 1, 2, 3, 4, the known Fermat primes.<ref name="ref_9c963bc5" />
		+	# As of 2021, the only known Fermat primes are F0 = 3, F1 = 5, F2 = 17, F3 = 257, and F4 = 65537.<ref name="ref_49cdcbc7">[https://arxiv.org/pdf/1912.12088 MINIMALITY OF TOPOLOGICAL MATRIX GROUPS AND FERMAT PRIMES]</ref>
		+	# For an odd prime p the following conditions are equivalent: (1) p is a Fermat prime; (2) SL(p 1, (Q, p)) is minimal; (3) SL(p 1, Q(i)) is minimal.<ref name="ref_49cdcbc7" />
		+	# We determine all the Carmichael numbers m with a Fermat prime factor such that L = 2P 2, where k N and P is an odd prime number.<ref name="ref_f1f90697">[https://arxiv.org/pdf/1710.01321 On the ﬁniteness of Carmichael numbers with Fermat factors and L = 2αP 2.]</ref>
		+	# We assume that m is divisible by at least one of the known Fermat prime numbers.<ref name="ref_f1f90697" />
		+	# If m is divisible by one of the known Fermat primes, then m must be one of the following 11 Carmichael numbers.<ref name="ref_f1f90697" />
		+	# Let 2 R R 22, there exists a generalized Fermat prime p = r2 2 be an integer.<ref name="ref_25a71c73">[https://arxiv.org/pdf/1502.02800 FAST INTEGER MULTIPLICATION USING GENERALIZED FERMAT PRIMES]</ref>
		+	# The key concept of our algorithm is the use of a chain of generalized Fermat primes (of the form r2 +1) to handle recursive calls.<ref name="ref_25a71c73" />
		+	# First, we encode integers to be multiplied as integers modulo generalized Fermat primes, and not as polynomials.<ref name="ref_25a71c73" />
		+	# Section 4 studies generalized Fermat primes, and their relation to the Bateman-Horn conjecture.<ref name="ref_25a71c73" />
		+	# 1. Introduction + 1 for n The Fermat numbers are given by Fn = 22n 0.<ref name="ref_4a2a6fd4">[https://arxiv.org/pdf/2102.00906 ON UPPER BOUNDS FOR THE COUNT OF ELITE PRIMES Matthew Just]</ref>
		+	# Notice that the rst ve Fermat numbers are prime, and it was initially conjectured (by Fermat) that all such num- bers are prime.<ref name="ref_4a2a6fd4" />
		+	# The sixth Fermat number is not prime, and no other Fermat primes are known.<ref name="ref_4a2a6fd4" />
		+	# An ecient test exists to determine whether or not a Fermat number is prime, called Pepins test.<ref name="ref_4a2a6fd4" />
		+	# This characterization uses uniquely values at most equal to tested Fermat number.<ref name="ref_bca905b7">[https://arxiv.org/pdf/2104.04875 A NEW CHARACTERIZATION OF PRIME FERMAT’S NUMBERS]</ref>
		+	# We actually are able to establish the direct implication which is a real important result in the primality tests for Fermat numbers.<ref name="ref_bca905b7" />
		+	# Condition 2m + = pn requires p to be either a Mersenne or Fermat prime.<ref name="ref_4393ff84">[https://arxiv.org/pdf/1809.03328 On Upper Bounds with ABC = 2mpn and ABC = 2mpnqr with p and q as Mersenne or Fermat]</ref>

@@ 1번째 줄: / 1번째 줄: @@
 ==개요==
-*   페르마소수란 <math>F_n= 2^{2^n}+1</math> 형태의 소수
+*   페르마소수란 <math>F_n= 2^{2^n}+1</math> 형태의 소수
 ** 3,5,17,257, 65537 다섯 가지만 알려져 있음.
-*  페르마는  <math>F_n= 2^{2^n}+1</math> 가 모두 소수일 것이라 추측하였으나, 후에 [[오일러(1707-1783)|오일러]]는 반례를 발견:<math>F_5=641 \times 6700417</math>
+*  페르마는  <math>F_n= 2^{2^n}+1</math> 가 모두 소수일 것이라 추측하였으나, 후에 [[오일러(1707-1783)|오일러]]는 반례를 발견:<math>F_5=641 \times 6700417</math>
-−
-−
 ==정다각형의 작도==
-* 정n각형이 자와 컴파스로 작도가능 <math>\iff</math> <math>n=2^k p_1 p_2 \cdots p_r</math>  (k ,r은 0이상의 정수, <math>p_1, p_2, \cdots, p_r</math> 은 서로 다른 페르마소수)
+* 정n각형이 자와 컴파스로 작도가능 <math>\iff</math> <math>n=2^k p_1 p_2 \cdots p_r</math>  (k ,r은 0이상의 정수, <math>p_1, p_2, \cdots, p_r</math> 은 서로 다른 페르마소수)
-* [[정다각형의 작도]]와 [[가우스와 정17각형의 작도]] 항목을 참조
+* [[정다각형의 작도]]와 [[가우스와 정17각형의 작도]] 항목을 참조
-−
-−
-−
 ==역사==
 * [[수학사 연표]]
-−
 ==관련된 항목들==

@@ 1번째 줄: / 1번째 줄: @@
 ==개요==
-*   페르마소수란 <math>F_n= 2^{2^n}+1</math> 형태의 소수<br>
+*   페르마소수란 <math>F_n= 2^{2^n}+1</math> 형태의 소수
 ** 3,5,17,257, 65537 다섯 가지만 알려져 있음.
-*  페르마는  <math>F_n= 2^{2^n}+1</math> 가 모두 소수일 것이라 추측하였으나, 후에 [[오일러(1707-1783)|오일러]]는 반례를 발견:<math>F_5=641 \times 6700417</math><br>
+*  페르마는  <math>F_n= 2^{2^n}+1</math> 가 모두 소수일 것이라 추측하였으나, 후에 [[오일러(1707-1783)|오일러]]는 반례를 발견:<math>F_5=641 \times 6700417</math>
@@ 22번째 줄: / 22번째 줄: @@
 ==역사==
-* [[수학사 연표]]<br>  <br>
+* [[수학사 연표]]

← 이전 판		2013년 1월 15일 (화) 03:48 판
22번째 줄:		22번째 줄:
	==역사==		==역사==

−	* [[~~수학사연표 (역사)\|수학사연표~~]]<br> <br>	+	* [[수학사 연표]]<br> <br>

← 이전 판		2012년 11월 1일 (목) 21:28 판
1번째 줄:		1번째 줄:
−	~~<h5 style~~=~~"background-position: 0px 100%; font-size: 1.16em; margin: 0px; color: rgb(34, 61, 103); line-height: 3.42em; font-family: 'malgun gothic',dotum,gulim,sans-serif;">~~개요==	+	==개요==

	* 페르마소수란 <math>F_n= 2^{2^n}+1</math> 형태의 소수<br>		* 페르마소수란 <math>F_n= 2^{2^n}+1</math> 형태의 소수<br>

@@ 1번째 줄: / 1번째 줄: @@
-<h5 style="background-position: 0px 100%; font-size: 1.16em; margin: 0px; color: rgb(34, 61, 103); line-height: 3.42em; font-family: 'malgun gothic',dotum,gulim,sans-serif;">개요</h5>
+<h5 style="background-position: 0px 100%; font-size: 1.16em; margin: 0px; color: rgb(34, 61, 103); line-height: 3.42em; font-family: 'malgun gothic',dotum,gulim,sans-serif;">개요==
 *   페르마소수란 <math>F_n= 2^{2^n}+1</math> 형태의 소수<br>
@@ 9번째 줄: / 9번째 줄: @@
-==정다각형의 작도</h5>
+==정다각형의 작도==
 * 정n각형이 자와 컴파스로 작도가능 <math>\iff</math> <math>n=2^k p_1 p_2 \cdots p_r</math>  (k ,r은 0이상의 정수, <math>p_1, p_2, \cdots, p_r</math> 은 서로 다른 페르마소수)
@@ 20번째 줄: / 20번째 줄: @@
-==역사</h5>
+==역사==
 * [[수학사연표 (역사)|수학사연표]]<br>  <br>
@@ 26번째 줄: / 26번째 줄: @@
-==관련된 항목들</h5>
+==관련된 항목들==
 * [[정다각형의 작도]]

페르마 소수 - 편집 역사

Pythagoras0: /* 메타데이터 */

Pythagoras0: /* 메타데이터 */ 새 문단

Pythagoras0: /* 노트 */ 새 문단

2020년 12월 28일 (월) 11:05에 Pythagoras0님의 편집

2020년 11월 13일 (금) 11:02에 Pythagoras0님의 편집

Pythagoras0: 찾아 바꾸기 – “수학사연표” 문자열을 “수학사 연표” 문자열로

Pythagoras0: 찾아 바꾸기 – “” 문자열을 “:” 문자열로

Pythagoras0: 찾아 바꾸기 – “

” 문자열을 “==” 문자열로

Pythagoras0: 찾아 바꾸기 – “

Pythagoras0: 찾아 바꾸기 – “

” 문자열을 “==” 문자열로

Pythagoras0: 찾아 바꾸기 – “
$” 문자열을 “: ” 문자열로$