id stringlengths 24 24 | title stringlengths 3 59 | context stringlengths 151 4.06k | question stringlengths 1 25.7k | answers dict | masked_query stringlengths 1 25.7k | query_embedding list | random_answer stringlengths 151 4.06k | similar_answer stringlengths 152 4.06k | similar_answer_v2 stringlengths 151 4.06k ⌀ | answer stringlengths 1 239 | __index_level_0__ int64 0 98.2k |
|---|---|---|---|---|---|---|---|---|---|---|---|
57297781af94a219006aa4a4 | Prime_number | A large body of mathematical work would still be valid when calling 1 a prime, but Euclid's fundamental theorem of arithmetic (mentioned above) would not hold as stated. For example, the number 15 can be factored as 3 · 5 and 1 · 3 · 5; if 1 were admitted as a prime, these two presentations would be considered differen... | The sieve of Eratosthenes would not be valid if what were true? | {
"answer_start": [
485,
488,
488,
485,
485
],
"text": [
"if 1 were considered a prime",
"1 were considered a prime",
"1 were considered a prime",
"if 1 were considered a prime",
"if 1 were considered a prime"
]
} | The sieve of [MASK] would not be valid if what were true? | [
0.11469223350286484,
0.2654769718647003,
-0.008712549693882465,
0.2623652219772339,
-0.00025204074336215854,
0.04131801053881645,
0.3023037314414978,
-0.474049836397171,
0.3036923110485077,
0.11949558556079865,
-0.14516866207122803,
0.20226140320301056,
-0.032300662249326706,
0.35964396595... | The Enlightenment has been frequently linked to the French Revolution of 1789. One view of the political changes that occurred during the Enlightenment is that the "consent of the governed" philosophy as delineated by Locke in Two Treatises of Government (1689) represented a paradigm shift from the old governance parad... | Mathematicians often strive for a complete classification (or list) of a mathematical notion. In the context of finite groups, this aim leads to difficult mathematics. According to Lagrange's theorem, finite groups of order p, a prime number, are necessarily cyclic (abelian) groups Zp. Groups of order p2 can also be sh... | The Quine-Duhem thesis argues that it's impossible to test a single hypothesis on its own, since each one comes as part of an environment of theories. Thus we can only say that the whole package of relevant theories has been collectively falsified, but cannot conclusively say which element of the package must be replac... | if 1 were considered a prime | 96,611 |
57297781af94a219006aa4a6 | Prime_number | A large body of mathematical work would still be valid when calling 1 a prime, but Euclid's fundamental theorem of arithmetic (mentioned above) would not hold as stated. For example, the number 15 can be factored as 3 · 5 and 1 · 3 · 5; if 1 were admitted as a prime, these two presentations would be considered differen... | What is another function that primes have that the number 1 does not? | {
"answer_start": [
834,
866,
866,
862,
866
],
"text": [
"Euler's totient function",
"sum of divisors function",
"sum of divisors function",
"the sum of divisors function",
"sum of divisors"
]
} | What is another function that primes have that the number [MASK] does not? | [
0.23519496619701385,
0.077900730073452,
0.08468294888734818,
0.17755208909511566,
0.11418362706899643,
0.31138771772384644,
-0.016769519075751305,
-0.17748671770095825,
-0.039697129279375076,
-0.03902370482683182,
-0.21865449845790863,
0.30388686060905457,
-0.6330210566520691,
0.0588771663... | A large Russian assault on the allied supply base to the southeast, at Balaclava was rebuffed on 25 October 1854.:521–527 The Battle of Balaclava is remembered in the UK for the actions of two British units. At the start of the battle, a large body of Russian cavalry charged the 93rd Highlanders, who were posted north ... | Mathematicians often strive for a complete classification (or list) of a mathematical notion. In the context of finite groups, this aim leads to difficult mathematics. According to Lagrange's theorem, finite groups of order p, a prime number, are necessarily cyclic (abelian) groups Zp. Groups of order p2 can also be sh... | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | Euler's totient function | 96,612 |
57297781af94a219006aa4a5 | Prime_number | A large body of mathematical work would still be valid when calling 1 a prime, but Euclid's fundamental theorem of arithmetic (mentioned above) would not hold as stated. For example, the number 15 can be factored as 3 · 5 and 1 · 3 · 5; if 1 were admitted as a prime, these two presentations would be considered differen... | What is one function that prime numbers have that 1 does not? | {
"answer_start": [
862,
777,
777,
777,
773
],
"text": [
"the sum of divisors function",
"relationship of the number to its corresponding value of Euler's totient function",
"relationship of the number to its corresponding value of Euler's totient function",
"relationship of th... | What is [MASK] function that prime numbers have that [MASK] does not? | [
0.22039444744586945,
0.11966750025749207,
-0.04660221189260483,
0.044961459934711456,
0.06185581907629967,
0.2005394697189331,
0.08769359439611435,
0.03385959565639496,
0.1776789426803589,
-0.023607460781931877,
-0.4327560365200043,
0.2695223093032837,
-0.58896803855896,
0.0718376711010932... | London is one of the major classical and popular music capitals of the world and is home to major music corporations, such as EMI and Warner Music Group as well as countless bands, musicians and industry professionals. The city is also home to many orchestras and concert halls, such as the Barbican Arts Centre (princip... | Mathematicians often strive for a complete classification (or list) of a mathematical notion. In the context of finite groups, this aim leads to difficult mathematics. According to Lagrange's theorem, finite groups of order p, a prime number, are necessarily cyclic (abelian) groups Zp. Groups of order p2 can also be sh... | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | the sum of divisors function | 96,613 |
57297781af94a219006aa4a7 | Prime_number | A large body of mathematical work would still be valid when calling 1 a prime, but Euclid's fundamental theorem of arithmetic (mentioned above) would not hold as stated. For example, the number 15 can be factored as 3 · 5 and 1 · 3 · 5; if 1 were admitted as a prime, these two presentations would be considered differen... | If 1 were to be considered as prime what would the sieve of Eratosthenes yield for all other numbers? | {
"answer_start": [
659,
682,
659,
579,
579
],
"text": [
"only the single number 1",
"1",
"only the single number 1",
"eliminate all multiples of 1",
"eliminate all multiples of 1 (that is, all other numbers) and produce as output only the single number 1."
]
} | If [MASK] were to be considered as prime what would the sieve of Eratosthenes yield for all other numbers? | [
-0.015234097838401794,
0.014476358890533447,
-0.20644167065620422,
0.08302699774503708,
0.029657917097210884,
0.6080501675605774,
-0.11122363805770874,
-0.35677504539489746,
-0.12044724822044373,
-0.029913006350398064,
-0.08207385987043381,
0.309419184923172,
-0.16616356372833252,
0.220222... | METRO began light rail service on January 1, 2004, with the inaugural track ("Red Line") running about 8 miles (13 km) from the University of Houston–Downtown (UHD), which traverses through the Texas Medical Center and terminates at NRG Park. METRO is currently in the design phase of a 10-year expansion plan that will ... | Mathematicians often strive for a complete classification (or list) of a mathematical notion. In the context of finite groups, this aim leads to difficult mathematics. According to Lagrange's theorem, finite groups of order p, a prime number, are necessarily cyclic (abelian) groups Zp. Groups of order p2 can also be sh... | The fundamental theorem of arithmetic continues to hold in unique factorization domains. An example of such a domain is the Gaussian integers Z[i], that is, the set of complex numbers of the form a + bi where i denotes the imaginary unit and a and b are arbitrary integers. Its prime elements are known as Gaussian prime... | only the single number 1 | 96,614 |
572978f91d046914007794d3 | Prime_number | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | What is the name of the Egyptian papyrus that suggests that they may have had knowledge of prime numbers? | {
"answer_start": [
149,
153,
153,
117,
153
],
"text": [
"the Rhind papyrus",
"Rhind",
"Rhind",
"Egyptian fraction",
"Rhind papyrus"
]
} | What is the name of the [MASK] papyrus that suggests that they may have had knowledge of prime numbers? | [
0.28710007667541504,
0.20783525705337524,
-0.5298117995262146,
0.08916455507278442,
0.2589097321033478,
0.4287959635257721,
-0.17730627954006195,
0.06680481880903244,
-0.15628527104854584,
-0.05257678031921387,
-0.1036943793296814,
-0.04989171773195267,
-0.12441933155059814,
0.356759756803... | The "Notre Dame Victory March" is the fight song for the University of Notre Dame. It was written by two brothers who were Notre Dame graduates. The Rev. Michael J. Shea, a 1904 graduate, wrote the music, and his brother, John F. Shea, who earned degrees in 1906 and 1908, wrote the original lyrics. The lyrics were revi... | Advances in polynomial algebra were made by mathematicians during the Yuan era. The mathematician Zhu Shijie (1249–1314) solved simultaneous equations with up to four unknowns using a rectangular array of coefficients, equivalent to modern matrices. Zhu used a method of elimination to reduce the simultaneous equations ... | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | the Rhind papyrus | 96,615 |
572978f91d046914007794d4 | Prime_number | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | What civilization was the first known to clearly study prime numbers? | {
"answer_start": [
329,
333,
341,
333,
333
],
"text": [
"the Ancient Greeks",
"Ancient Greeks",
"Greeks",
"Ancient Greeks",
"Ancient Greeks"
]
} | What civilization was the [MASK] known to clearly study prime numbers? | [
0.240350604057312,
0.23765715956687927,
-0.36750662326812744,
0.2269478589296341,
0.08228912949562073,
0.2751263976097107,
0.03833666071295738,
0.14311788976192474,
-0.26839005947113037,
-0.15626434981822968,
-0.029549751430749893,
-0.010236958973109722,
-0.21178661286830902,
-0.0176674034... | The Dean of the College of Cardinals, or Cardinal-dean, is the primus inter pares of the College of Cardinals, elected by the cardinal bishops holding suburbicarian sees from among their own number, an election, however, that must be approved by the Pope. Formerly the position of dean belonged by right to the longest-s... | Advances in polynomial algebra were made by mathematicians during the Yuan era. The mathematician Zhu Shijie (1249–1314) solved simultaneous equations with up to four unknowns using a rectangular array of coefficients, equivalent to modern matrices. Zhu used a method of elimination to reduce the simultaneous equations ... | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | the Ancient Greeks | 96,616 |
572978f91d046914007794d5 | Prime_number | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | What work from around 300 BC has significant theorems about prime numbers? | {
"answer_start": [
349,
349,
349,
349,
349
],
"text": [
"Euclid's Elements",
"Euclid's Elements",
"Euclid's Elements",
"Euclid's Elements",
"Euclid's Elements"
]
} | What work from [MASK] has significant theorems about prime numbers? | [
0.19993335008621216,
0.247345969080925,
-0.24234387278556824,
0.11229004710912704,
0.23105432093143463,
0.16674016416072845,
-0.23714730143547058,
-0.1793176382780075,
0.009780898690223694,
-0.04222245141863823,
-0.40462762117385864,
0.0062139458023011684,
-0.13161015510559082,
-0.01398124... | There are two methods of corruption of the judiciary: the state (through budget planning and various privileges), and the private. Budget of the judiciary in many transitional and developing countries is almost completely controlled by the executive. The latter undermines the separation of powers, as it creates a criti... | Advances in polynomial algebra were made by mathematicians during the Yuan era. The mathematician Zhu Shijie (1249–1314) solved simultaneous equations with up to four unknowns using a rectangular array of coefficients, equivalent to modern matrices. Zhu used a method of elimination to reduce the simultaneous equations ... | Virgil's biographical tradition is thought to depend on a lost biography by Varius, Virgil's editor, which was incorporated into the biography by Suetonius and the commentaries of Servius and Donatus, the two great commentators on Virgil's poetry. Although the commentaries no doubt record much factual information about... | Euclid's Elements | 96,617 |
572978f91d046914007794d6 | Prime_number | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | Who demonstrated how to create a perfect number from a Mersenne prime? | {
"answer_start": [
501,
501,
501,
501,
501
],
"text": [
"Euclid",
"Euclid",
"Euclid",
"Euclid",
"Euclid"
]
} | Who demonstrated how to create a perfect number from a [MASK] prime? | [
0.041444893926382065,
0.018630310893058777,
-0.292772114276886,
0.40258994698524475,
0.09698918461799622,
0.563915491104126,
0.06313954293727875,
-0.5158814787864685,
-0.05136578902602196,
-0.02463672123849392,
-0.07428629696369171,
-0.040704384446144104,
-0.32702451944351196,
0.1015381589... | In the city, the population was spread out with 21.9% at age 19 and under, 14.3% from 20 to 24, 33.2% from 25 to 44, 20.4% from 45 to 64, and 10.1% who were 65 years of age or older. The median age was 30.8 years. For every 100 females, there were 92.0 males. For every 100 females age 18 and over, there were 89.9 males... | Advances in polynomial algebra were made by mathematicians during the Yuan era. The mathematician Zhu Shijie (1249–1314) solved simultaneous equations with up to four unknowns using a rectangular array of coefficients, equivalent to modern matrices. Zhu used a method of elimination to reduce the simultaneous equations ... | Ancient tables provided the sun's mean longitude. Christopher Clavius, the architect of the Gregorian calendar, noted that the tables agreed neither on the time when the sun passed through the vernal equinox nor on the length of the mean tropical year. Tycho Brahe also noticed discrepancies. The Gregorian leap year rul... | Euclid | 96,618 |
572978f91d046914007794d7 | Prime_number | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | What does the Sieve of Eratosthenes do? | {
"answer_start": [
654,
654,
654,
654,
654
],
"text": [
"compute primes",
"compute primes",
"compute primes",
"compute primes",
"compute primes"
]
} | What does the Sieve of Eratosthenes do? | [
0.0172432828694582,
0.12818515300750732,
-0.19661399722099304,
0.19245678186416626,
0.25821879506111145,
0.3157203495502472,
-0.09994037449359894,
-0.34704336524009705,
0.027596410363912582,
-0.2827339768409729,
-0.17457355558872223,
0.1733693778514862,
0.21393941342830658,
0.0724959000945... | Communications in Somalia encompasses the communications services and capacity of Somalia. Telecommunications, internet, radio, print, television and postal services in the nation are largely concentrated in the private sector. Several of the telecom firms have begun expanding their activities abroad. The Federal gover... | Advances in polynomial algebra were made by mathematicians during the Yuan era. The mathematician Zhu Shijie (1249–1314) solved simultaneous equations with up to four unknowns using a rectangular array of coefficients, equivalent to modern matrices. Zhu used a method of elimination to reduce the simultaneous equations ... | The Antikythera mechanism is believed to be the earliest mechanical analog "computer", according to Derek J. de Solla Price. It was designed to calculate astronomical positions. It was discovered in 1901 in the Antikythera wreck off the Greek island of Antikythera, between Kythera and Crete, and has been dated to circa... | compute primes | 96,619 |
57297a276aef051400154f88 | Prime_number | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | In what year did Pierre de Fermat declare Fermat's little theorem? | {
"answer_start": [
90,
93,
93,
93,
93
],
"text": [
"In 1640",
"1640",
"1640",
"1640",
"1640"
]
} | In what year did [MASK] declare [MASK] 's little theorem? | [
-0.2177543342113495,
0.10277625918388367,
0.09891881793737411,
0.06698595732450485,
0.0809118002653122,
-0.049224965274333954,
0.18528828024864197,
-0.08490151166915894,
0.013678655959665775,
0.08166786283254623,
-0.20444446802139282,
0.14878754317760468,
-0.15281358361244202,
0.4683212041... | Controversy erupted when Madonna decided to adopt from Malawi again. Chifundo "Mercy" James was finally adopted in June 2009. Madonna had known Mercy from the time she went to adopt David. Mercy's grandmother had initially protested the adoption, but later gave in, saying "At first I didn't want her to go but as a fami... | Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. No even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime numb... | Although Max insisted von Neumann attend school at the grade level appropriate to his age, he agreed to hire private tutors to give him advanced instruction in those areas in which he had displayed an aptitude. At the age of 15, he began to study advanced calculus under the renowned analyst Gábor Szegő. On their first ... | In 1640 | 96,620 |
57297a276aef051400154f89 | Prime_number | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | Besides Leibniz, what other mathematician proved the validity of Fermat's little theorem? | {
"answer_start": [
191,
191,
191,
191,
191
],
"text": [
"Euler",
"Euler",
"Euler",
"Euler",
"Euler"
]
} | Besides [MASK], what other mathematician proved the validity of [MASK] 's little theorem? | [
-0.15378651022911072,
0.08452584594488144,
-0.14640437066555023,
0.40664976835250854,
0.16834919154644012,
0.15723131597042084,
0.29470697045326233,
-0.3203103244304657,
-0.11026014387607574,
0.0714322179555893,
-0.21811074018478394,
0.16724802553653717,
-0.05621253699064255,
0.06804779171... | The median income for a household in the city was $26,969, and the median income for a family was $31,997. Males had a median income of $25,471 versus $23,863 for females. The per capita income for the city was $15,402. About 19.1% of families and 23.6% of the population were below the poverty line, including 29.1% of ... | Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. No even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime numb... | The axiomatization of mathematics, on the model of Euclid's Elements, had reached new levels of rigour and breadth at the end of the 19th century, particularly in arithmetic, thanks to the axiom schema of Richard Dedekind and Charles Sanders Peirce, and geometry, thanks to David Hilbert. At the beginning of the 20th ce... | Euler | 96,621 |
57297a276aef051400154f8a | Prime_number | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | Of what form do Fermat numbers take? | {
"answer_start": [
252,
252,
252,
252,
252
],
"text": [
"22n + 1",
"22n + 1",
"22n + 1",
"22n + 1",
"22n + 1"
]
} | Of what form do Fermat numbers take? | [
0.44279414415359497,
0.26831576228141785,
0.334298312664032,
-0.040902040898799896,
-0.1093297228217125,
0.5138072371482849,
0.1494801789522171,
-0.17711569368839264,
-0.09528572112321854,
-0.16011735796928406,
-0.1815197616815567,
0.03390515595674515,
-0.6086849570274353,
0.34608376026153... | Everton F.C. is a limited company with the board of directors holding a majority of the shares. The club's most recent accounts, from May 2014, show a net total debt of £28.1 million, with a turnover of £120.5 million and a profit of £28.2 million. The club's overdraft with Barclays Bank is secured against the Premier ... | Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. No even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime numb... | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | 22n + 1 | 96,622 |
57297a276aef051400154f8c | Prime_number | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | Of what form do Mersenne primes take? | {
"answer_start": [
591,
591,
591,
591,
591
],
"text": [
"2p − 1",
"2p − 1, with p a prime",
"2p − 1",
"2p − 1",
"2p − 1"
]
} | Of what form do Mersenne primes take? | [
0.16689826548099518,
0.00992207508534193,
0.058599889278411865,
0.09137755632400513,
-0.02618682011961937,
0.5311030745506287,
-0.023027081042528152,
-0.1957370936870575,
-0.16573062539100647,
-0.21532924473285675,
-0.30324018001556396,
0.3235127031803131,
-0.32917773723602295,
0.188582018... | In international law and international relations, a protocol is generally a treaty or international agreement that supplements a previous treaty or international agreement. A protocol can amend the previous treaty, or add additional provisions. Parties to the earlier agreement are not required to adopt the protocol. So... | Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. No even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime numb... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | 2p − 1 | 96,623 |
57297a276aef051400154f8b | Prime_number | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | To what extent did Fermat confirm the validity of Fermat numbers? | {
"answer_start": [
324,
324,
340,
330,
330
],
"text": [
"up to n = 4 (or 216 + 1)",
"up to n = 4 (or 216 + 1)",
"216 + 1",
"n = 4",
"n = 4"
]
} | To what extent did [MASK] confirm the validity of [MASK] numbers? | [
0.27717018127441406,
0.29350534081459045,
-0.038176387548446655,
0.3798621594905853,
0.1052146703004837,
0.19853155314922333,
0.024009443819522858,
-0.29388561844825745,
-0.05108211189508438,
0.31563952565193176,
-0.134153351187706,
0.08642221242189407,
0.02092120796442032,
0.1176761984825... | Initially the existing 5:3 aspect ratio had been the main candidate but, due to the influence of widescreen cinema, the aspect ratio 16:9 (1.78) eventually emerged as being a reasonable compromise between 5:3 (1.67) and the common 1.85 widescreen cinema format. An aspect ratio of 16:9 was duly agreed upon at the first ... | Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. No even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime numb... | With this contribution of von Neumann, the axiomatic system of the theory of sets became fully satisfactory, and the next question was whether or not it was also definitive, and not subject to improvement. A strongly negative answer arrived in September 1930 at the historic mathematical Congress of Königsberg, in which... | up to n = 4 (or 216 + 1) | 96,624 |
57297bc9af94a219006aa4c7 | Prime_number | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | What is the most elemental way to test the primality of any integer n? | {
"answer_start": [
79,
79,
79,
79,
79
],
"text": [
"trial division",
"trial division",
"trial division",
"trial division",
"trial division"
]
} | What is the most elemental way to test the primality of any integer n? | [
0.10994508862495422,
0.1531577706336975,
-0.27763301134109497,
0.170352041721344,
0.13412287831306458,
0.4077197015285492,
0.3852662444114685,
-0.4183585047721863,
-0.0015650906134396791,
0.25553837418556213,
-0.052096109837293625,
0.16071437299251556,
-0.18677997589111328,
0.0702835991978... | The Panthers beat the Seattle Seahawks in the divisional round, running up a 31–0 halftime lead and then holding off a furious second half comeback attempt to win 31–24, avenging their elimination from a year earlier. The Panthers then blew out the Arizona Cardinals in the NFC Championship Game, 49–15, racking up 487 y... | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | Prime numbers give rise to two more general concepts that apply to elements of any commutative ring R, an algebraic structure where addition, subtraction and multiplication are defined: prime elements and irreducible elements. An element p of R is called prime element if it is neither zero nor a unit (i.e., does not ha... | trial division | 96,625 |
57297bc9af94a219006aa4c8 | Prime_number | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | What makes the method of trial division more efficient? | {
"answer_start": [
591,
594,
596,
591,
591
],
"text": [
"if a complete list of primes up to is known",
"a complete list of primes up to is known",
"complete list of primes up to is known",
"if a complete list of primes up to is known",
"if a complete list of primes up ... | What makes the method of trial division more efficient? | [
0.036415643990039825,
-0.09635359793901443,
-0.16183161735534668,
0.2367335557937622,
0.11186964064836502,
0.37433889508247375,
-0.04431430995464325,
-0.6737495064735413,
-0.10896137356758118,
-0.23719002306461334,
-0.01602242887020111,
0.140481099486351,
-0.08394454419612885,
0.2209105342... | Monopole antennas consist of a single radiating element such as a metal rod, often mounted over a conducting surface, a ground plane. One side of the feedline from the receiver or transmitter is connected to the rod, and the other side to the ground plane, which may be the Earth. The most common form is the quarter-wav... | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | along with two inequality systems expressing economic efficiency. In this model, the (transposed) probability vector p represents the prices of the goods while the probability vector q represents the "intensity" at which the production process would run. The unique solution λ represents the growth factor which is 1 plu... | if a complete list of primes up to is known | 96,626 |
57297bc9af94a219006aa4c9 | Prime_number | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | Trial division involves dividing n by every integer m greater than what? | {
"answer_start": [
157,
170,
170,
154,
170
],
"text": [
"greater than 1",
"1",
"1",
"is greater than 1 and less than or equal to the square root of n",
"1"
]
} | Trial division involves dividing n by every integer m greater than what? | [
-0.027407916262745857,
-0.026996277272701263,
-0.1940121352672577,
-0.1599685549736023,
0.1621992439031601,
0.562947690486908,
0.23087197542190552,
-0.8233305215835571,
-0.3129822611808777,
0.14750802516937256,
-0.2184632122516632,
0.16140328347682953,
-0.34351646900177,
0.3082560002803802... | There are many notable contributors to the field of Chinese science throughout the ages. One of the best examples would be Shen Kuo (1031–1095), a polymath scientist and statesman who was the first to describe the magnetic-needle compass used for navigation, discovered the concept of true north, improved the design of ... | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. No even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime numb... | greater than 1 | 96,627 |
57297bc9af94a219006aa4cb | Prime_number | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | How many divisions are required to verify the primality of the number 37? | {
"answer_start": [
752,
676,
757,
757,
757
],
"text": [
"only three divisions",
"only for those m that are prime",
"three",
"three",
"three"
]
} | How many divisions are required to verify the primality of the number [MASK]? | [
0.3784121572971344,
0.27905064821243286,
-0.028702139854431152,
0.2218952178955078,
0.25248953700065613,
0.578132152557373,
0.1755014806985855,
-0.4125021994113922,
-0.036080531775951385,
0.16230803728103638,
-0.1884957104921341,
0.3186028003692627,
-0.24756211042404175,
0.2321806997060775... | Napoleon's use of propaganda contributed to his rise to power, legitimated his régime, and established his image for posterity. Strict censorship, controlling aspects of the press, books, theater, and art, was part of his propaganda scheme, aimed at portraying him as bringing desperately wanted peace and stability to F... | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | For example, consider the deterministic sorting algorithm quicksort. This solves the problem of sorting a list of integers that is given as the input. The worst-case is when the input is sorted or sorted in reverse order, and the algorithm takes time O(n2) for this case. If we assume that all possible permutations of t... | only three divisions | 96,628 |
57297bc9af94a219006aa4ca | Prime_number | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | What must the integer m be less than or equal to when performing trial division? | {
"answer_start": [
176,
198,
202,
198,
198
],
"text": [
"less than or equal to the square root of n",
"the square root of n",
"square root of n",
"the square root of n.",
"the square root of n."
]
} | What must the integer m be less than or equal to when performing trial division? | [
-0.08800268918275833,
0.13398750126361847,
-0.057073384523391724,
0.028476497158408165,
0.21155333518981934,
0.42826539278030396,
0.11535296589136124,
-0.7482966780662537,
-0.15752919018268585,
0.12746506929397583,
-0.13163995742797852,
0.4074884057044983,
-0.3241399824619293,
0.1778222918... | Georgian succeeded the English Baroque of Sir Christopher Wren, Sir John Vanbrugh, Thomas Archer, William Talman, and Nicholas Hawksmoor; this in fact continued into at least the 1720s, overlapping with a more restrained Georgian style. The architect James Gibbs was a transitional figure, his earlier buildings are Baro... | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | If the input size is n, the time taken can be expressed as a function of n. Since the time taken on different inputs of the same size can be different, the worst-case time complexity T(n) is defined to be the maximum time taken over all inputs of size n. If T(n) is a polynomial in n, then the algorithm is said to be a ... | less than or equal to the square root of n | 96,629 |
57297d421d046914007794e5 | Prime_number | Modern primality tests for general numbers n can be divided into two main classes, probabilistic (or "Monte Carlo") and deterministic algorithms. Deterministic algorithms provide a way to tell for sure whether a given number is prime or not. For example, trial division is a deterministic algorithm because, if performed... | How many modern types of primality tests for general numbers n are there? | {
"answer_start": [
65,
65,
65,
65,
65
],
"text": [
"two main classes",
"two",
"two",
"two",
"two"
]
} | How many modern types of primality tests for general numbers n are there? | [
0.3149924576282501,
0.1338389813899994,
0.05913208797574043,
-0.0327608548104763,
0.20076832175254822,
0.4707123041152954,
0.21458619832992554,
-0.37150102853775024,
-0.2546275556087494,
-0.05869787931442261,
-0.2707228362560272,
0.20941470563411713,
-0.4465627074241638,
0.1803254038095474... | In the race for individual contributions, economist Lyndon LaRouche dominated the pack leading up to the primaries. According to the Federal Election Commission statistics, LaRouche had more individual contributors to his 2004 presidential campaign than any other candidate, until the final quarter of the primary season... | A deterministic Turing machine is the most basic Turing machine, which uses a fixed set of rules to determine its future actions. A probabilistic Turing machine is a deterministic Turing machine with an extra supply of random bits. The ability to make probabilistic decisions often helps algorithms solve problems more e... | The complexity class P is often seen as a mathematical abstraction modeling those computational tasks that admit an efficient algorithm. This hypothesis is called the Cobham–Edmonds thesis. The complexity class NP, on the other hand, contains many problems that people would like to solve efficiently, but for which no e... | two main classes | 96,630 |
57297d421d046914007794e6 | Prime_number | Modern primality tests for general numbers n can be divided into two main classes, probabilistic (or "Monte Carlo") and deterministic algorithms. Deterministic algorithms provide a way to tell for sure whether a given number is prime or not. For example, trial division is a deterministic algorithm because, if performed... | What is the name of one type of modern primality test? | {
"answer_start": [
83,
83,
83,
83,
83
],
"text": [
"probabilistic (or \"Monte Carlo\")",
"probabilistic (or \"Monte Carlo\")",
"probabilistic",
"probabilistic",
"probabilistic"
]
} | What is the name of [MASK] type of modern primality test? | [
0.27095577120780945,
-0.029781367629766464,
0.01702805981040001,
-0.14879301190376282,
0.42376646399497986,
0.31729137897491455,
0.2671508491039276,
-0.32510989904403687,
-0.015367269515991211,
-0.05672062933444977,
-0.3165552020072937,
0.2556273639202118,
-0.21364359557628632,
0.021497696... | Xiamen dialect, sometimes known as Amoy, is the main dialect spoken in the Chinese city of Xiamen and its surrounding regions of Tong'an and Xiang'an, both of which are now included in the Greater Xiamen area. This dialect developed in the late Ming dynasty when Xiamen was increasingly taking over Quanzhou's position a... | A deterministic Turing machine is the most basic Turing machine, which uses a fixed set of rules to determine its future actions. A probabilistic Turing machine is a deterministic Turing machine with an extra supply of random bits. The ability to make probabilistic decisions often helps algorithms solve problems more e... | The question of whether P equals NP is one of the most important open questions in theoretical computer science because of the wide implications of a solution. If the answer is yes, many important problems can be shown to have more efficient solutions. These include various types of integer programming problems in oper... | probabilistic (or "Monte Carlo") | 96,631 |
57297d421d046914007794e7 | Prime_number | Modern primality tests for general numbers n can be divided into two main classes, probabilistic (or "Monte Carlo") and deterministic algorithms. Deterministic algorithms provide a way to tell for sure whether a given number is prime or not. For example, trial division is a deterministic algorithm because, if performed... | What is the name of another type of modern primality test? | {
"answer_start": [
120,
120,
120,
120,
120
],
"text": [
"deterministic",
"deterministic algorithms",
"deterministic",
"deterministic algorithms",
"deterministic algorithms"
]
} | What is the name of another type of modern primality test? | [
0.26257067918777466,
-0.05210036784410477,
0.013801301829516888,
-0.13221418857574463,
0.42150092124938965,
0.34904050827026367,
0.2941978871822357,
-0.3616439998149872,
-0.07906558364629745,
-0.09335605800151825,
-0.29002079367637634,
0.2127757966518402,
-0.23558036983013153,
0.0543056316... | The British high-definition TV service started trials in August 1936 and a regular service on 2 November 1936 using both the (mechanical) Baird 240 line sequential scan (later to be inaccurately rechristened 'progressive') and the (electronic) Marconi-EMI 405 line interlaced systems. The Baird system was discontinued i... | In addition to the Riemann hypothesis, many more conjectures revolving about primes have been posed. Often having an elementary formulation, many of these conjectures have withstood a proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture, which asserts that ... | Similarly, it is not known if L (the set of all problems that can be solved in logarithmic space) is strictly contained in P or equal to P. Again, there are many complexity classes between the two, such as NL and NC, and it is not known if they are distinct or equal classes. | deterministic | 96,632 |
57297d421d046914007794e8 | Prime_number | Modern primality tests for general numbers n can be divided into two main classes, probabilistic (or "Monte Carlo") and deterministic algorithms. Deterministic algorithms provide a way to tell for sure whether a given number is prime or not. For example, trial division is a deterministic algorithm because, if performed... | What type of algorithm is trial division? | {
"answer_start": [
275,
275,
275,
275,
275
],
"text": [
"deterministic",
"deterministic algorithm",
"deterministic",
"deterministic",
"deterministic"
]
} | What type of algorithm is trial division? | [
0.026680078357458115,
-0.07695535570383072,
-0.24369414150714874,
0.10450555384159088,
0.10776475071907043,
0.47474563121795654,
0.06159725412726402,
-0.5599769353866577,
-0.12122347950935364,
-0.13354533910751343,
0.018792971968650818,
0.24356625974178314,
-0.3270358145236969,
0.154517382... | Von Neumann raised the intellectual and mathematical level of economics in several stunning publications. For his model of an expanding economy, von Neumann proved the existence and uniqueness of an equilibrium using his generalization of the Brouwer fixed-point theorem. Von Neumann's model of an expanding economy cons... | In addition to the Riemann hypothesis, many more conjectures revolving about primes have been posed. Often having an elementary formulation, many of these conjectures have withstood a proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture, which asserts that ... | This motivates the concept of a problem being hard for a complexity class. A problem X is hard for a class of problems C if every problem in C can be reduced to X. Thus no problem in C is harder than X, since an algorithm for X allows us to solve any problem in C. Of course, the notion of hard problems depends on the t... | deterministic | 96,633 |
57297d421d046914007794e9 | Prime_number | Modern primality tests for general numbers n can be divided into two main classes, probabilistic (or "Monte Carlo") and deterministic algorithms. Deterministic algorithms provide a way to tell for sure whether a given number is prime or not. For example, trial division is a deterministic algorithm because, if performed... | When using a probabilistic algorithm, how is the probability that the number is composite expressed mathematically? | {
"answer_start": [
833,
833,
833,
833,
833
],
"text": [
"1/(1-p)n",
"1/(1-p)n",
"1/(1-p)n",
"1/(1-p)n",
"1/(1-p)n"
]
} | When using a probabilistic algorithm, how is the probability that the number is composite expressed mathematically? | [
0.02165621891617775,
0.10089157521724701,
-0.051747482270002365,
-0.0008321523200720549,
0.23455022275447845,
0.6179467439651489,
0.21443872153759003,
-0.3771531581878662,
-0.13066035509109497,
0.015560000203549862,
-0.07450929284095764,
0.022594766691327095,
-0.32003551721572876,
-0.20104... | Packet mode communication may be implemented with or without intermediate forwarding nodes (packet switches or routers). Packets are normally forwarded by intermediate network nodes asynchronously using first-in, first-out buffering, but may be forwarded according to some scheduling discipline for fair queuing, traffic... | A deterministic Turing machine is the most basic Turing machine, which uses a fixed set of rules to determine its future actions. A probabilistic Turing machine is a deterministic Turing machine with an extra supply of random bits. The ability to make probabilistic decisions often helps algorithms solve problems more e... | A computational problem can be viewed as an infinite collection of instances together with a solution for every instance. The input string for a computational problem is referred to as a problem instance, and should not be confused with the problem itself. In computational complexity theory, a problem refers to the abs... | 1/(1-p)n | 96,634 |
57297ed93f37b3190047845f | Prime_number | A particularly simple example of a probabilistic test is the Fermat primality test, which relies on the fact (Fermat's little theorem) that np≡n (mod p) for any n if p is a prime number. If we have a number b that we want to test for primality, then we work out nb (mod b) for a random value of n as our test. A flaw wit... | What is one straightforward case of a probabilistic test? | {
"answer_start": [
57,
61,
61,
61,
57
],
"text": [
"the Fermat primality test,",
"Fermat primality test",
"Fermat primality test",
"Fermat primality test",
"the Fermat primality test"
]
} | What is [MASK] straightforward case of a probabilistic test? | [
-0.1710868775844574,
-0.08985108137130737,
-0.2353159338235855,
0.1784157156944275,
0.2236049622297287,
0.20419658720493317,
0.25725340843200684,
-0.2444278597831726,
0.2842637598514557,
-0.06854810565710068,
-0.3054962158203125,
0.19374923408031464,
-0.5117473006248474,
-0.112490966916084... | The Rhine emerges from Lake Constance, flows generally westward, as the Hochrhein, passes the Rhine Falls, and is joined by its major tributary, the river Aare. The Aare more than doubles the Rhine's water discharge, to an average of nearly 1,000 m3/s (35,000 cu ft/s), and provides more than a fifth of the discharge at... | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | The second approach to the problem took as its base the notion of class, and defines a set as a class which belongs to other classes, while a proper class is defined as a class which does not belong to other classes. Under the Zermelo–Fraenkel approach, the axioms impede the construction of a set of all sets which do n... | the Fermat primality test, | 96,635 |
57297ed93f37b31900478460 | Prime_number | A particularly simple example of a probabilistic test is the Fermat primality test, which relies on the fact (Fermat's little theorem) that np≡n (mod p) for any n if p is a prime number. If we have a number b that we want to test for primality, then we work out nb (mod b) for a random value of n as our test. A flaw wit... | What does the Fermat primality test depend upon? | {
"answer_start": [
140,
140,
140,
140,
100
],
"text": [
"np≡n (mod p)",
"np≡n (mod p) for any n if p is a prime number",
"np≡n (mod p) for any n if p is a prime number",
"np≡n (mod p) for any n if p is a prime number",
"the fact (Fermat's little theorem) that np≡n (mod p) ... | What does the Fermat primality test depend upon? | [
0.3559574782848358,
-0.07873660326004028,
0.06816916167736053,
-0.06167299672961235,
0.2658255994319916,
0.4969041645526886,
0.3821989595890045,
-0.44111454486846924,
0.1956019103527069,
-0.06641874462366104,
-0.18873754143714905,
0.22402654588222504,
-0.4267595410346985,
0.099648125469684... | On October 25–28, 1990, Rukh held its second congress and declared that its principal goal was the "renewal of independent statehood for Ukraine". On October 28 UAOC faithful, supported by Ukrainian Catholics, demonstrated near St. Sophia’s Cathedral as newly elected Russian Orthodox Church Patriarch Aleksei and Metrop... | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | np≡n (mod p) | 96,636 |
57297ed93f37b31900478461 | Prime_number | A particularly simple example of a probabilistic test is the Fermat primality test, which relies on the fact (Fermat's little theorem) that np≡n (mod p) for any n if p is a prime number. If we have a number b that we want to test for primality, then we work out nb (mod b) for a random value of n as our test. A flaw wit... | What type of numbers demonstrate a flaw with the Fermat primality test? | {
"answer_start": [
355,
378,
378,
378,
378
],
"text": [
"composite numbers (the Carmichael numbers)",
"Carmichael",
"Carmichael",
"Carmichael numbers",
"Carmichael numbers"
]
} | What type of numbers demonstrate a flaw with the Fermat primality test? | [
0.29988834261894226,
0.15681670606136322,
-0.22563476860523224,
0.07139281183481216,
0.14854668080806732,
0.46273961663246155,
0.4743789732456207,
-0.3430408835411072,
0.1616707146167755,
-0.08287660777568817,
-0.3653607964515686,
0.2686673104763031,
-0.5852816700935364,
0.1121794655919075... | iPods cannot play music files from competing music stores that use rival-DRM technologies like Microsoft's protected WMA or RealNetworks' Helix DRM. Example stores include Napster and MSN Music. RealNetworks claims that Apple is creating problems for itself by using FairPlay to lock users into using the iTunes Store. S... | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | composite numbers (the Carmichael numbers) | 96,637 |
57297ed93f37b31900478462 | Prime_number | A particularly simple example of a probabilistic test is the Fermat primality test, which relies on the fact (Fermat's little theorem) that np≡n (mod p) for any n if p is a prime number. If we have a number b that we want to test for primality, then we work out nb (mod b) for a random value of n as our test. A flaw wit... | What is the name of one impressive continuation of the Fermat primality test? | {
"answer_start": [
739,
739,
739,
739,
739
],
"text": [
"Baillie-PSW",
"Baillie-PSW",
"Baillie-PSW",
"Baillie-PSW",
"Baillie-PSW,"
]
} | What is the name of [MASK] impressive continuation of the Fermat primality test? | [
0.08651719242334366,
-0.2580251693725586,
0.2644101679325104,
-0.05330013483762741,
0.2864904999732971,
0.2966846227645874,
0.13773271441459656,
-0.41187724471092224,
-0.06495669484138489,
-0.24181890487670898,
-0.29021939635276794,
0.14994072914123535,
-0.20115970075130463,
0.092218078672... | Wood has a long history of being used as fuel, which continues to this day, mostly in rural areas of the world. Hardwood is preferred over softwood because it creates less smoke and burns longer. Adding a woodstove or fireplace to a home is often felt to add ambiance and warmth. | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p − 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2p − 1, wher... | Baillie-PSW | 96,638 |
57297ed93f37b31900478463 | Prime_number | A particularly simple example of a probabilistic test is the Fermat primality test, which relies on the fact (Fermat's little theorem) that np≡n (mod p) for any n if p is a prime number. If we have a number b that we want to test for primality, then we work out nb (mod b) for a random value of n as our test. A flaw wit... | What is the name of another compelling continuation of the Fermat primality test? | {
"answer_start": [
770,
752,
752,
752,
752
],
"text": [
"Solovay-Strassen tests",
"Miller-Rabin",
"Miller-Rabin",
"Miller-Rabin",
"Miller-Rabin"
]
} | What is the name of another compelling continuation of the [MASK] primality test? | [
0.270263671875,
-0.16443374752998352,
0.09949110448360443,
0.07662400603294373,
0.35657402873039246,
0.2564377188682556,
0.21079948544502258,
-0.38258829712867737,
0.024592915549874306,
0.020384225994348526,
-0.3689238429069519,
0.2732098400592804,
-0.30013564229011536,
0.12848380208015442... | Michel Djotodia took over as president and in May 2013 Central African Republic's Prime Minister Nicolas Tiangaye requested a UN peacekeeping force from the UN Security Council and on 31 May former President Bozizé was indicted for crimes against humanity and incitement of genocide. The security situation did not impro... | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | If a problem X is in C and hard for C, then X is said to be complete for C. This means that X is the hardest problem in C. (Since many problems could be equally hard, one might say that X is one of the hardest problems in C.) Thus the class of NP-complete problems contains the most difficult problems in NP, in the sens... | Solovay-Strassen tests | 96,639 |
572980f9af94a219006aa4d1 | Prime_number | are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p − 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2p − 1, wher... | Of what form are Sophie Germain primes? | {
"answer_start": [
189,
189,
189,
189,
189
],
"text": [
"2p + 1",
"2p + 1 with p prime",
"2p + 1 with p prime",
"2p + 1",
"2p + 1"
]
} | Of what form are Sophie Germain primes? | [
0.142783060669899,
0.04689708352088928,
0.10082348436117172,
0.11553214490413666,
0.14613807201385498,
0.520601749420166,
-0.060438767075538635,
-0.18036285042762756,
-0.09804125875234604,
-0.02649318240582943,
-0.4480733275413513,
0.1963934749364853,
-0.38958975672721863,
-0.1308034211397... | The first recorded settlement in what is now Newcastle was Pons Aelius, a Roman fort and bridge across the River Tyne. It was given the family name of the Roman Emperor Hadrian, who founded it in the 2nd century AD. This rare honour suggests that Hadrian may have visited the site and instituted the bridge on his tour o... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | 2p + 1 | 96,640 |
572980f9af94a219006aa4d2 | Prime_number | are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p − 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2p − 1, wher... | Of what form are Mersenne primes? | {
"answer_start": [
308,
308,
308,
308,
308
],
"text": [
"2p − 1",
"2p − 1",
"2p − 1, where p is an arbitrary prime",
"2p − 1",
"2p − 1,"
]
} | Of what form are Mersenne primes? | [
0.04461749270558357,
-0.03975079953670502,
0.046144939959049225,
0.09305916726589203,
-0.0026219466235488653,
0.6091688871383667,
0.002733507426455617,
-0.1174778938293457,
-0.23041485249996185,
-0.3420897424221039,
-0.18049801886081696,
0.27540844678878784,
-0.3438338339328766,
0.21699234... | In a 2009 national readership survey The Times was found to have the highest number of ABC1 25–44 readers and the largest numbers of readers in London of any of the "quality" papers. | There are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no known simple formula that separates prime numbers from composite numbers. However, the distribution of primes, that is to say, the statistical behaviour of primes in the large, can be modelled. The first result in that direction is t... | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | 2p − 1 | 96,641 |
572980f9af94a219006aa4d3 | Prime_number | are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p − 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2p − 1, wher... | What test is especially useful for numbers of the form 2p - 1? | {
"answer_start": [
347,
351,
351,
351,
351
],
"text": [
"The Lucas–Lehmer test",
"Lucas–Lehmer",
"Lucas–Lehmer",
"Lucas–Lehmer",
"Lucas–Lehmer test"
]
} | What test is especially useful for numbers of the form 2p - 1? | [
0.24163781106472015,
0.02488012984395027,
-0.004826792515814304,
0.2851334810256958,
-0.007688392419368029,
0.3336453139781952,
0.04951733350753784,
-0.7107707858085632,
-0.3304801881313324,
0.0695292130112648,
-0.2746509611606598,
0.05266711115837097,
-0.35567548871040344,
-0.235025584697... | The Consortium first published The Unicode Standard (ISBN 0-321-18578-1) in 1991 and continues to develop standards based on that original work. The latest version of the standard, Unicode 8.0, was released in June 2015 and is available from the consortium's website. The last of the major versions (versions x.0) to be ... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | The Lucas–Lehmer test | 96,642 |
572980f9af94a219006aa4d4 | Prime_number | are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p − 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2p − 1, wher... | What is the name of one type of prime where p+1 or p-1 takes a certain shape? | {
"answer_start": [
211,
229,
147,
147,
147
],
"text": [
"primorial primes",
"Fermat",
"Sophie Germain",
"Sophie Germain",
"Sophie Germain"
]
} | What is the name of [MASK] type of prime where p+1 or p-1 takes a certain shape? | [
0.09976129233837128,
-0.017984313890337944,
0.05181373655796051,
0.15782460570335388,
-0.08356057107448578,
0.2921546995639801,
-0.11633450537919998,
-0.2188301980495453,
-0.20049048960208893,
0.18197640776634216,
-0.273619145154953,
-0.12910465896129608,
-0.27637383341789246,
0.1399217993... | The classical period of Greek civilization covers a time spanning from the early 5th century BC to the death of Alexander the Great, in 323 BC (some authors prefer to split this period into 'Classical', from the end of the Persian wars to the end of the Peloponnesian War, and 'Fourth Century', up to the death of Alexan... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | primorial primes | 96,643 |
572980f9af94a219006aa4d5 | Prime_number | are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p − 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2p − 1, wher... | What is the name of another type of prime here p+1 or p-1 takes a certain shape? | {
"answer_start": [
229,
247,
211,
211,
211
],
"text": [
"Fermat primes",
"Mersenne",
"primorial primes",
"primorial primes",
"primorial primes"
]
} | What is the name of another type of prime here p+1 or p-1 takes a certain shape? | [
0.0900653526186943,
-0.017558401450514793,
0.12257581204175949,
0.18204240500926971,
-0.13200753927230835,
0.2993236184120178,
-0.1988246887922287,
-0.2977498471736908,
-0.2948935329914093,
0.03739215061068535,
-0.31054243445396423,
-0.17052334547042847,
-0.26328644156455994,
0.14676775038... | When the news arrived at Paris of the surrender at Sedan of Napoleon III and 80,000 men, the Second Empire was overthrown by a popular uprising in Paris, which forced the proclamation of a Provisional Government and a Third Republic by general Trochu, Favre and Gambetta at Paris on 4 September, the new government calli... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | A large body of mathematical work would still be valid when calling 1 a prime, but Euclid's fundamental theorem of arithmetic (mentioned above) would not hold as stated. For example, the number 15 can be factored as 3 · 5 and 1 · 3 · 5; if 1 were admitted as a prime, these two presentations would be considered differen... | Fermat primes | 96,644 |
572982e66aef051400154f92 | Prime_number | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | What is the name of one type of computing method that is used to find prime numbers? | {
"answer_start": [
118,
118,
118,
118,
118
],
"text": [
"distributed computing",
"distributed computing",
"distributed",
"distributed computing",
"distributed computing"
]
} | What is the name of [MASK] type of computing method that is used to find prime numbers? | [
0.1325530707836151,
-0.03446413576602936,
-0.159171000123024,
0.299611896276474,
0.2802276611328125,
0.4570101201534271,
-0.14559665322303772,
-0.05713127553462982,
-0.19257307052612305,
0.018516188487410545,
-0.3205779194831848,
0.1378813087940216,
-0.29685401916503906,
0.1099496185779571... | In 1864, Andrew Johnson (a War Democrat from Tennessee) was elected Vice President under Abraham Lincoln. He became President after Lincoln's assassination in 1865. Under Johnson's lenient re-admission policy, Tennessee was the first of the seceding states to have its elected members readmitted to the U.S. Congress, on... | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | For example, consider the deterministic sorting algorithm quicksort. This solves the problem of sorting a list of integers that is given as the input. The worst-case is when the input is sorted or sorted in reverse order, and the algorithm takes time O(n2) for this case. If we assume that all possible permutations of t... | distributed computing | 96,645 |
572982e66aef051400154f93 | Prime_number | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | In what year was the Great Internet Mersenne Prime Search project conducted? | {
"answer_start": [
141,
144,
144,
144,
144
],
"text": [
"In 2009",
"2009",
"2009",
"2009",
"2009"
]
} | In what year was the Great Internet Mersenne Prime Search project conducted? | [
-0.1737515777349472,
-0.2243959754705429,
0.06262318789958954,
0.1791324019432068,
0.11524992436170578,
0.2863638401031494,
0.012196430005133152,
-0.10099983960390091,
-0.1592695713043213,
-0.2871926724910736,
-0.21408864855766296,
0.15840893983840942,
-0.22951191663742065,
0.0898797512054... | Greeks have a long tradition of valuing and investing in paideia (education). Paideia was one of the highest societal values in the Greek and Hellenistic world while the first European institution described as a university was founded in 5th century Constantinople and operated in various incarnations until the city's f... | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | A third type of conjectures concerns aspects of the distribution of primes. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2 (twin prime conjecture). Polignac's conjecture is a strengthening of that conjecture, it states that for every positive integer n, there are infinit... | In 2009 | 96,646 |
572982e66aef051400154f94 | Prime_number | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | the Great Internet Mersenne Prime Search, what was the prize for finding a prime with at least 10 million digits? | {
"answer_start": [
213,
213,
213,
215,
213
],
"text": [
"US$100,000",
"US$100,000",
"US$100,000",
"$100,000",
"US$100,000"
]
} | the Great Internet Mersenne Prime Search, what was the prize for finding a prime with [MASK] digits? | [
-0.25631147623062134,
-0.04551936686038971,
0.1442825347185135,
0.37027549743652344,
0.00955124944448471,
0.2656075954437256,
0.14718592166900635,
0.02278934232890606,
-0.22534330189228058,
-0.057352278381586075,
-0.3266574740409851,
0.1725042760372162,
-0.1461505889892578,
0.0514601357281... | Swaziland's currency is pegged to the South African Rand, subsuming Swaziland's monetary policy to South Africa. Customs duties from the Southern African Customs Union, which may equal as much as 70% of government revenue this year, and worker remittances from South Africa substantially supplement domestically earned i... | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of sever... | US$100,000 | 96,647 |
572982e66aef051400154f95 | Prime_number | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | What organization offers monetary awards for identifying primes with at least 100 million digits? | {
"answer_start": [
293,
297,
297,
291,
340
],
"text": [
"The Electronic Frontier Foundation",
"Electronic Frontier Foundation",
"Electronic Frontier Foundation",
". The Electronic Frontier Foundation",
"$150,000"
]
} | What organization offers monetary awards for identifying primes with [MASK] digits? | [
0.05664552003145218,
0.19828812777996063,
-0.1417870819568634,
0.3793777823448181,
0.2599529027938843,
0.19300225377082825,
-0.031159335747361183,
-0.09839045256376266,
-0.15460623800754547,
0.01594902016222477,
-0.2710133492946625,
0.08829539269208908,
-0.20437867939472198,
0.036671675741... | The traditional Charleston accent has long been noted in the state and throughout the South. It is typically heard in wealthy white families who trace their families back generations in the city. It has ingliding or monophthongal long mid-vowels, raises ay and aw in certain environments, and is nonrhotic. Sylvester Pri... | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of sever... | The Electronic Frontier Foundation | 96,648 |
572982e76aef051400154f96 | Prime_number | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | In what interval are some of the greatest primes without a distinct form discovered in? | {
"answer_start": [
765,
765,
765,
765,
765
],
"text": [
"[256kn + 1, 256k(n + 1) − 1]",
"[256kn + 1, 256k(n + 1) − 1]",
"[256kn + 1, 256k(n + 1) − 1]",
"[256kn + 1, 256k(n + 1) − 1]",
"[256kn + 1, 256k(n + 1) − 1]."
]
} | In what interval are some of the greatest primes without a distinct form discovered in? | [
-0.018039947375655174,
0.12535223364830017,
-0.050561483949422836,
-0.07311881333589554,
0.2294054925441742,
0.1670420914888382,
0.1441682130098343,
-0.12745623290538788,
-0.0024615246802568436,
-0.052438125014305115,
-0.4267934262752533,
0.11061340570449829,
-0.36012837290763855,
0.329311... | NE1fm launched on 8 June 2007, the first full-time community radio station in the area. Newcastle Student Radio is run by students from both of the city's universities, broadcasting from Newcastle University's student's union building during term time. Radio Tyneside has been the voluntary hospital radio service for mo... | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q... | [256kn + 1, 256k(n + 1) − 1] | 96,649 |
572985011d04691400779501 | Prime_number | are prime for any natural number n. Here represents the floor function, i.e., largest integer not greater than the number in question. The latter formula can be shown using Bertrand's postulate (proven first by Chebyshev), which states that there always exists at least one prime number p with n < p < 2n − 2, for any n... | What is name of the function used for the largest integer not greater than the number in question? | {
"answer_start": [
53,
57,
57,
57,
57
],
"text": [
"the floor function",
"floor",
"floor",
"floor function",
"floor function"
]
} | What is name of the function used for the largest integer not greater than the number in question? | [
-0.20062270760536194,
-0.0016695187659934163,
-0.009956900961697102,
0.13743636012077332,
0.055312126874923706,
0.42170456051826477,
-0.10454946756362915,
-0.12977340817451477,
-0.2010471224784851,
0.33848512172698975,
-0.17289158701896667,
0.17814530432224274,
-0.4799719750881195,
0.12581... | The situation in Switzerland and Liechtenstein is different from the rest of the German-speaking countries. The Swiss German dialects are the default everyday language in virtually every situation, whereas standard German is seldom spoken. Some Swiss German speakers perceive standard German to be a foreign language. | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q... | the floor function | 96,650 |
572985011d04691400779502 | Prime_number | are prime for any natural number n. Here represents the floor function, i.e., largest integer not greater than the number in question. The latter formula can be shown using Bertrand's postulate (proven first by Chebyshev), which states that there always exists at least one prime number p with n < p < 2n − 2, for any n... | Who first proved Bertrand's postulate? | {
"answer_start": [
212,
212,
212,
212,
212
],
"text": [
"Chebyshev",
"Chebyshev",
"Chebyshev",
"Chebyshev",
"Chebyshev"
]
} | Who first proved [MASK] 's postulate? | [
0.030495988205075264,
0.0038768178783357143,
-0.26680079102516174,
0.18123912811279297,
0.10329113155603409,
0.22691252827644348,
0.056260380893945694,
-0.28765690326690674,
0.38923755288124084,
-0.011394470930099487,
-0.047383252531290054,
0.06817643344402313,
-0.1771862953901291,
0.28227... | When not celebrating Mass but still serving a liturgical function, such as the semiannual Urbi et Orbi papal blessing, some Papal Masses and some events at Ecumenical Councils, cardinal deacons can be recognized by the dalmatics they would don with the simple white mitre (so called mitra simplex). | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | Chebyshev | 96,651 |
572985011d04691400779503 | Prime_number | are prime for any natural number n. Here represents the floor function, i.e., largest integer not greater than the number in question. The latter formula can be shown using Bertrand's postulate (proven first by Chebyshev), which states that there always exists at least one prime number p with n < p < 2n − 2, for any n... | For what size natural number does Bertrand's postulate hold? | {
"answer_start": [
315,
334,
334,
336,
334
],
"text": [
"any natural number n > 3",
"n > 3",
"n > 3",
"> 3.",
"n > 3"
]
} | For what size natural number does [MASK] 's postulate hold? | [
0.14966434240341187,
0.15274301171302795,
0.06801794469356537,
0.0072080222889781,
0.050604771822690964,
0.40429699420928955,
-0.06228383630514145,
-0.23748096823692322,
-0.21558040380477905,
0.03055396117269993,
-0.26036614179611206,
-0.09744912385940552,
-0.39878618717193604,
0.357598364... | In 1968 Ronald Melzack and Kenneth Casey described pain in terms of its three dimensions: "sensory-discriminative" (sense of the intensity, location, quality and duration of the pain), "affective-motivational" (unpleasantness and urge to escape the unpleasantness), and "cognitive-evaluative" (cognitions such as apprais... | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | Prime ideals are the points of algebro-geometric objects, via the notion of the spectrum of a ring. Arithmetic geometry also benefits from this notion, and many concepts exist in both geometry and number theory. For example, factorization or ramification of prime ideals when lifted to an extension field, a basic proble... | any natural number n > 3 | 96,652 |
572985011d04691400779504 | Prime_number | are prime for any natural number n. Here represents the floor function, i.e., largest integer not greater than the number in question. The latter formula can be shown using Bertrand's postulate (proven first by Chebyshev), which states that there always exists at least one prime number p with n < p < 2n − 2, for any n... | How is the prime number p in Bertrand's postulate expressed mathematically? | {
"answer_start": [
295,
295,
360,
295,
295
],
"text": [
"n < p < 2n − 2",
"n < p < 2n − 2",
"A or μ",
"n < p < 2n − 2",
"n < p < 2n − 2"
]
} | How is the prime number p in [MASK] 's postulate expressed mathematically? | [
0.03097674436867237,
0.13903309404850006,
0.12638598680496216,
0.14603500068187714,
0.2678271532058716,
0.42196252942085266,
0.04285367578268051,
-0.23004119098186493,
0.20371609926223755,
-0.11150609701871872,
-0.26306185126304626,
-0.12137100100517273,
-0.3645210564136505,
0.238391935825... | After 539 Ravenna was reconquered by the Romans in the form of the Eastern Roman Empire (Byzantine Empire) and became the seat of the Exarchate of Ravenna. The greatest development of Christian mosaics unfolded in the second half of the 6th century. Outstanding examples of Byzantine mosaic art are the later phase mosai... | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | The fundamental theorem of arithmetic continues to hold in unique factorization domains. An example of such a domain is the Gaussian integers Z[i], that is, the set of complex numbers of the form a + bi where i denotes the imaginary unit and a and b are arbitrary integers. Its prime elements are known as Gaussian prime... | n < p < 2n − 2 | 96,653 |
572985011d04691400779505 | Prime_number | are prime for any natural number n. Here represents the floor function, i.e., largest integer not greater than the number in question. The latter formula can be shown using Bertrand's postulate (proven first by Chebyshev), which states that there always exists at least one prime number p with n < p < 2n − 2, for any n... | On what theorem is the formula that frequently generates the number 2 and all other primes precisely once based on? | {
"answer_start": [
459,
459,
459,
459,
459
],
"text": [
"Wilson's theorem",
"Wilson's",
"Wilson's",
"Wilson's theorem",
"Wilson's theorem"
]
} | On what theorem is the formula that frequently generates the number [MASK] and all other primes precisely once based on? | [
0.32564353942871094,
0.1275213360786438,
-0.05905243381857872,
0.18360978364944458,
0.2739326059818268,
0.29262620210647583,
-0.11221951246261597,
-0.34159982204437256,
-0.040604621171951294,
0.02088014781475067,
-0.16317923367023468,
0.26239556074142456,
-0.4019768536090851,
0.31175526976... | Nuclear strike is the ability of nuclear forces to rapidly and accurately strike targets which the enemy holds dear in a devastating manner. If a crisis occurs, rapid generation and, if necessary, deployment of nuclear strike capabilities will demonstrate US resolve and may prompt an adversary to alter the course of ac... | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | A large body of mathematical work would still be valid when calling 1 a prime, but Euclid's fundamental theorem of arithmetic (mentioned above) would not hold as stated. For example, the number 15 can be factored as 3 · 5 and 1 · 3 · 5; if 1 were admitted as a prime, these two presentations would be considered differen... | Wilson's theorem | 96,654 |
572987e46aef051400154fa2 | Prime_number | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | What is another way to state the condition that infinitely many primes can exist only if a and q are coprime? | {
"answer_start": [
69,
75,
69,
69
],
"text": [
"their greatest common divisor is one",
"greatest common divisor is one",
"their greatest common divisor is one",
"their greatest common divisor is one"
]
} | What is another way to state the condition that infinitely many primes can exist only if a and q are coprime? | [
0.34545716643333435,
0.133036270737648,
-0.11377591639757156,
0.14783918857574463,
-0.006114198360592127,
0.2081122249364853,
0.2939387559890747,
-0.16054409742355347,
0.07848433405160904,
0.15248903632164001,
-0.3126325011253357,
0.27509406208992004,
-0.6923761367797852,
0.477817475795745... | There were 13 finalists this season, but two were eliminated in the first result show of the finals. A new feature introduced was the "Judges' Save", and Matt Giraud was saved from elimination at the top seven by the judges when he received the fewest votes. The next week, Lil Rounds and Anoop Desai were eliminated. | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | A particularly simple example of a probabilistic test is the Fermat primality test, which relies on the fact (Fermat's little theorem) that np≡n (mod p) for any n if p is a prime number. If we have a number b that we want to test for primality, then we work out nb (mod b) for a random value of n as our test. A flaw wit... | their greatest common divisor is one | 96,655 |
572987e46aef051400154fa3 | Prime_number | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | If a and q are coprime, which theorem holds that an arithmetic progression has an infinite number of primes? | {
"answer_start": [
149,
149,
149,
149
],
"text": [
"Dirichlet's theorem",
"Dirichlet's",
"Dirichlet's theorem",
"Dirichlet's theorem"
]
} | If a and q are coprime, which theorem holds that an arithmetic progression has an infinite number of primes? | [
0.14027072489261627,
0.07061412930488586,
-0.05326772853732109,
0.034729424864053726,
0.11071103811264038,
0.31726884841918945,
0.25703737139701843,
-0.20303235948085785,
-0.14939559996128082,
0.11162350326776505,
-0.19737860560417175,
0.22724808752536774,
-0.43793997168540955,
0.238011136... | The term middle east as a noun and adjective was common in the 19th century in nearly every context except diplomacy and archaeology. An uncountable number of places appear to have had their middle easts from gardens to regions, including the United States. The innovation of the term "Near East" to mean the holdings of... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | In ring theory, the notion of number is generally replaced with that of ideal. Prime ideals, which generalize prime elements in the sense that the principal ideal generated by a prime element is a prime ideal, are an important tool and object of study in commutative algebra, algebraic number theory and algebraic geomet... | Dirichlet's theorem | 96,656 |
572987e46aef051400154fa4 | Prime_number | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | What is the density of all primes compatible with a modulo 9? | {
"answer_start": [
713,
713,
713,
713
],
"text": [
"1/6",
"1/6",
"1/6",
"1/6"
]
} | What is the density of all primes compatible with a modulo [MASK]? | [
0.15367959439754486,
-0.004480293020606041,
0.36696767807006836,
0.18075256049633026,
0.07246328890323639,
0.21503418684005737,
0.04054146260023117,
-0.5008834600448608,
0.17267653346061707,
-0.09833517670631409,
-0.24088066816329956,
0.26930078864097595,
-0.5360671877861023,
-0.0353791937... | The province's name derives from the Zhe River (浙江, Zhè Jiāng), the former name of the Qiantang River which flows past Hangzhou and whose mouth forms Hangzhou Bay. It is usually glossed as meaning "Crooked" or "Bent River", from the meaning of Chinese 折, but is more likely a phono-semantic compound formed from adding 氵... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | 1/6 | 96,657 |
572987e46aef051400154fa5 | Prime_number | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | If q=9 and a=3,6 or 9, how many primes would be in the progression? | {
"answer_start": [
469,
477,
477,
469
],
"text": [
"at most one prime number",
"one",
"one",
"at most one"
]
} | If q=9 and [MASK] or [MASK], how many primes would be in the progression? | [
0.28387367725372314,
0.03549686446785927,
0.25626012682914734,
0.15239399671554565,
0.20916421711444855,
0.5492760539054871,
-0.02472413145005703,
-0.15118929743766785,
-0.18086877465248108,
-0.043387461453676224,
-0.0851912572979927,
0.10511830449104309,
-0.2852261960506439,
0.28238952159... | In cases where the criminalized behavior is pure speech, civil disobedience can consist simply of engaging in the forbidden speech. An example would be WBAI's broadcasting the track "Filthy Words" from a George Carlin comedy album, which eventually led to the 1978 Supreme Court case of FCC v. Pacifica Foundation. Threa... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | Prime numbers have influenced many artists and writers. The French composer Olivier Messiaen used prime numbers to create ametrical music through "natural phenomena". In works such as La Nativité du Seigneur (1935) and Quatre études de rythme (1949–50), he simultaneously employs motifs with lengths given by different p... | at most one prime number | 96,658 |
572987e46aef051400154fa6 | Prime_number | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | If q=9 and a=1,2,4,5,7, or 8, how many primes would be in a progression? | {
"answer_start": [
550,
550,
550,
550
],
"text": [
"infinitely many prime numbers",
"infinitely many",
"infinite",
"infinitely many"
]
} | If q=9 and [MASK], or [MASK], how many primes would be in a progression? | [
0.3559280037879944,
0.13918912410736084,
0.18723267316818237,
0.15441632270812988,
0.1531219631433487,
0.544744074344635,
0.018137294799089432,
-0.18074524402618408,
-0.1978718638420105,
-0.054675616323947906,
-0.12336664646863937,
0.06992220133543015,
-0.3326452076435089,
0.29131156206130... | The most famous passage in Burke's Reflections was his description of the events of 5–6 October 1789 and the part of Marie-Antoinette in them. Burke's account differs little from modern historians who have used primary sources. His use of flowery language to describe it, however, provoked both praise and criticism. Phi... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | In modular arithmetic, two integers are added and then the sum is divided by a positive integer called the modulus. The result of modular addition is the remainder of that division. For any modulus, n, the set of integers from 0 to n − 1 forms a group under modular addition: the inverse of any element a is n − a, and 0... | infinitely many prime numbers | 96,659 |
572989846aef051400154fc0 | Prime_number | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | What function is related to prime numbers? | {
"answer_start": [
0,
4,
4,
4
],
"text": [
"The zeta function",
"zeta",
"zeta function",
"zeta function"
]
} | What function is related to prime numbers? | [
0.23598161339759827,
-0.02448965609073639,
0.012507022358477116,
0.05033499002456665,
0.06072183698415756,
0.3234076499938965,
-0.23067691922187805,
-0.04471869021654129,
-0.05570262297987938,
-0.004724621307104826,
-0.21584297716617584,
0.20682571828365326,
-0.5178685784339905,
0.23868262... | The main response of the immune system to tumors is to destroy the abnormal cells using killer T cells, sometimes with the assistance of helper T cells. Tumor antigens are presented on MHC class I molecules in a similar way to viral antigens. This allows killer T cells to recognize the tumor cell as abnormal. NK cells ... | The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of sever... | A large body of mathematical work would still be valid when calling 1 a prime, but Euclid's fundamental theorem of arithmetic (mentioned above) would not hold as stated. For example, the number 15 can be factored as 3 · 5 and 1 · 3 · 5; if 1 were admitted as a prime, these two presentations would be considered differen... | The zeta function | 96,660 |
572989846aef051400154fc1 | Prime_number | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | What type of value would the zeta function have if there were finite primes? | {
"answer_start": [
233,
235,
235,
235
],
"text": [
"a finite value",
"finite",
"finite",
"finite"
]
} | What type of value would the zeta function have if there were finite primes? | [
-0.12374065816402435,
0.04627199470996857,
0.006486127618700266,
-0.011695852503180504,
0.2376362830400467,
0.3354206681251526,
-0.014041130430996418,
-0.046495579183101654,
0.20494303107261658,
0.024190621450543404,
-0.1972401887178421,
0.21378861367702484,
-0.5581239461898804,
0.31698688... | Research into LCPS (low cost private schools) found that over 5 years to July 2013, debate around LCPSs to achieving Education for All (EFA) objectives was polarised and finding growing coverage in international policy. The polarisation was due to disputes around whether the schools are affordable for the poor, reach d... | The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of sever... | A third type of conjectures concerns aspects of the distribution of primes. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2 (twin prime conjecture). Polignac's conjecture is a strengthening of that conjecture, it states that for every positive integer n, there are infinit... | a finite value | 96,661 |
572989846aef051400154fc2 | Prime_number | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | What property of the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... shows that there is an infinite number of primes? | {
"answer_start": [
304,
304,
320
],
"text": [
"diverges",
"diverges",
"exceeds any given number"
]
} | What property of the harmonic series [MASK] + 1/2 + [MASK] + 1/4 +... shows that there is an infinite number of primes? | [
0.14246512949466705,
0.0527537576854229,
0.2954936623573303,
0.010662071406841278,
0.014374795369803905,
0.16651445627212524,
0.014976237900555134,
-0.38519716262817383,
-0.18092073500156403,
-0.03612923249602318,
-0.09794158488512039,
0.41702187061309814,
-0.5112272500991821,
0.1744921356... | Neptune's mass of 1.0243×1026 kg, is intermediate between Earth and the larger gas giants: it is 17 times that of Earth but just 1/19th that of Jupiter.[d] Its gravity at 1 bar is 11.15 m/s2, 1.14 times the surface gravity of Earth, and surpassed only by Jupiter. Neptune's equatorial radius of 24,764 km is nearly four ... | The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of sever... | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | diverges | 96,662 |
572989846aef051400154fc3 | Prime_number | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | What does it mean when a harmonic series diverges? | {
"answer_start": [
320,
320,
320,
320
],
"text": [
"exceeds any given number",
"exceeds any given number",
"exceeds any given number",
"exceeds any given number"
]
} | What does it mean when a harmonic series diverges? | [
0.09927843511104584,
-0.3174285292625427,
0.16147702932357788,
-0.045544154942035675,
0.20253220200538635,
0.11539657413959503,
0.13542553782463074,
-0.11412591487169266,
-0.13344642519950867,
-0.062369462102651596,
-0.19997522234916687,
0.1991526484489441,
-0.34726613759994507,
0.24443167... | The use of drones by the Central Intelligence Agency in Pakistan to carry out operations associated with the Global War on Terror sparks debate over sovereignty and the laws of war. The U.S. Government uses the CIA rather than the U.S. Air Force for strikes in Pakistan in order to avoid breaching sovereignty through mi... | The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of sever... | The most commonly used reduction is a polynomial-time reduction. This means that the reduction process takes polynomial time. For example, the problem of squaring an integer can be reduced to the problem of multiplying two integers. This means an algorithm for multiplying two integers can be used to square an integer. ... | exceeds any given number | 96,663 |
572989846aef051400154fc4 | Prime_number | The zeta function is closely related to prime numbers. For example, the aforementioned fact that there are infinitely many primes can also be seen using the zeta function: if there were only finitely many primes then ζ(1) would have a finite value. However, the harmonic series 1 + 1/2 + 1/3 + 1/4 + ... diverges (i.e., ... | Of what mathematical nature is the Basel problem? | {
"answer_start": [
506,
465,
458,
458
],
"text": [
"identity",
"algebraic",
"modern algebraic number theory",
"modern algebraic number theory"
]
} | Of what mathematical nature is the Basel problem? | [
-0.05699658393859863,
0.09025292843580246,
0.056327395141124725,
-0.10817723721265793,
-0.03258068114519119,
0.10742118209600449,
0.24907325208187103,
-0.33097925782203674,
-0.10970211774110794,
0.013599365949630737,
-0.18061880767345428,
0.04990765079855919,
-0.3230949342250824,
-0.105654... | Paris and its close suburbs is home to numerous newspapers, magazines and publications including Le Monde, Le Figaro, Libération, Le Nouvel Observateur, Le Canard enchaîné, La Croix, Pariscope, Le Parisien (in Saint-Ouen), Les Échos, Paris Match (Neuilly-sur-Seine), Réseaux & Télécoms, Reuters France, and L'Officiel de... | The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of sever... | Of course, some complexity classes have complicated definitions that do not fit into this framework. Thus, a typical complexity class has a definition like the following: | identity | 96,664 |
57298ef11d0469140077952d | Prime_number | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | When was the Riemann hypothesis proposed? | {
"answer_start": [
45,
45,
45,
45
],
"text": [
"1859",
"1859",
"1859",
"1859"
]
} | When was the [MASK] hypothesis proposed? | [
0.14526095986366272,
-0.034680288285017014,
-0.2016092836856842,
-0.06786629557609558,
0.03402796387672424,
0.20617856085300446,
-0.0017646498745307326,
-0.22419865429401398,
0.07663539052009583,
-0.008645628578960896,
0.09130308777093887,
0.051818929612636566,
-0.2067902386188507,
0.27006... | Others have pointed out that there were not enough of these loans made to cause a crisis of this magnitude. In an article in Portfolio Magazine, Michael Lewis spoke with one trader who noted that "There weren’t enough Americans with [bad] credit taking out [bad loans] to satisfy investors' appetite for the end product.... | Prior to Planck's work, it had been assumed that the energy of a body could take on any value whatsoever – that it was a continuous variable. The Rayleigh–Jeans law makes close predictions for a narrow range of values at one limit of temperatures, but the results diverge more and more strongly as temperatures increase.... | The theoretical difficulties arise from the fact that all of the methods except the X-ray crystal density method rely on the theoretical basis of the Josephson effect and the quantum Hall effect. If these theories are slightly inaccurate – though there is no evidence at present to suggest they are – the methods would n... | 1859 | 96,665 |
57298ef11d0469140077952e | Prime_number | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | According to the Riemann hypothesis, all zeroes of the ζ-function have real part equal to 1/2 except for what values of s? | {
"answer_start": [
74,
78,
78,
74
],
"text": [
"s = −2, −4, ...,",
"−2, −4, ...,",
"−2, −4",
"s = −2, −4"
]
} | According to the [MASK] hypothesis, all zeroes of the ζ- function have real part equal to [MASK] except for what values of s? | [
-0.19213199615478516,
0.1882021129131317,
0.2582343816757202,
0.021579613909125328,
0.1659606546163559,
0.14980940520763397,
0.3394767642021179,
-0.4165474772453308,
0.21519790589809418,
-0.04674174264073372,
-0.354049414396286,
0.2254260778427124,
-0.5856333374977112,
0.2910541296005249,
... | The catechism is one of Luther's most personal works. "Regarding the plan to collect my writings in volumes," he wrote, "I am quite cool and not at all eager about it because, roused by a Saturnian hunger, I would rather see them all devoured. For I acknowledge none of them to be really a book of mine, except perhaps t... | Prior to Planck's work, it had been assumed that the energy of a body could take on any value whatsoever – that it was a continuous variable. The Rayleigh–Jeans law makes close predictions for a narrow range of values at one limit of temperatures, but the results diverge more and more strongly as temperatures increase.... | Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. No even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime numb... | s = −2, −4, ..., | 96,666 |
57298ef11d0469140077952f | Prime_number | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | What does the Riemann hypothesis state the source of irregularity in the distribution of points comes from? | {
"answer_start": [
402,
402,
402,
402
],
"text": [
"random noise",
"random noise",
"random noise",
"random noise"
]
} | What does the Riemann hypothesis state the source of irregularity in the distribution of points comes from? | [
-0.0795329362154007,
-0.092923603951931,
0.17569378018379211,
0.1298355609178543,
0.0953947901725769,
0.10956422239542007,
0.013360725715756416,
0.017639948055148125,
-0.11227183789014816,
0.02329353056848049,
-0.16135740280151367,
-0.16205471754074097,
-0.4436635375022888,
0.4146246612071... | The Tucson metro area is served by many local television stations and is the 68th largest designated market area (DMA) in the U.S. with 433,310 homes (0.39% of the total U.S.). It is limited to the three counties of southeastern Arizona (Pima, Santa Cruz, and Cochise) The major television networks serving Tucson are: K... | Prior to Planck's work, it had been assumed that the energy of a body could take on any value whatsoever – that it was a continuous variable. The Rayleigh–Jeans law makes close predictions for a narrow range of values at one limit of temperatures, but the results diverge more and more strongly as temperatures increase.... | There are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no known simple formula that separates prime numbers from composite numbers. However, the distribution of primes, that is to say, the statistical behaviour of primes in the large, can be modelled. The first result in that direction is t... | random noise | 96,667 |
57298ef11d04691400779530 | Prime_number | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | What type of prime distribution does the Riemann hypothesis propose is also true for short intervals near X? | {
"answer_start": [
474,
474,
474,
474
],
"text": [
"asymptotic distribution",
"asymptotic",
"asymptotic distribution",
"asymptotic distribution"
]
} | What type of prime distribution does the [MASK] hypothesis propose is also true for short intervals near X? | [
0.3619728982448578,
-0.13503937423229218,
-0.013768147677183151,
-0.017742294818162918,
0.1977110058069229,
0.009883993305265903,
0.07386914640665054,
0.1475803554058075,
0.13274933397769928,
-0.04232539236545563,
-0.3449070453643799,
0.08893914520740509,
-0.557303786277771,
0.263345688581... | Kadamba (345 – 525 CE) was an ancient royal dynasty of Karnataka, India that ruled northern Karnataka and the Konkan from Banavasi in present-day Uttara Kannada district. At the peak of their power under King Kakushtavarma, the Kadambas of Banavasi ruled large parts of modern Karnataka state. The dynasty was founded by... | Prior to Planck's work, it had been assumed that the energy of a body could take on any value whatsoever – that it was a continuous variable. The Rayleigh–Jeans law makes close predictions for a narrow range of values at one limit of temperatures, but the results diverge more and more strongly as temperatures increase.... | In a number of von Neumann's papers, the methods of argument he employed are considered even more significant than the results. In anticipation of his later study of dimension theory in algebras of operators, von Neumann used results on equivalence by finite decomposition, and reformulated the problem of measure in ter... | asymptotic distribution | 96,668 |
57298ef11d04691400779531 | Prime_number | The unproven Riemann hypothesis, dating from 1859, states that except for s = −2, −4, ..., all zeroes of the ζ-function have real part equal to 1/2. The connection to prime numbers is that it essentially says that the primes are as regularly distributed as possible.[clarification needed] From a physical viewpoint, it r... | What type of prime distribution is characterized about x/log x of numbers less than x? | {
"answer_start": [
474,
474,
474,
474
],
"text": [
"asymptotic distribution",
"asymptotic",
"asymptotic distribution",
"asymptotic distribution"
]
} | What type of prime distribution is characterized about x/log x of numbers less than x? | [
0.35623699426651,
0.11556611955165863,
-0.05514604598283768,
0.17261692881584167,
0.18491078913211823,
0.0687297135591507,
-0.0016484115039929748,
0.014221977442502975,
-0.08208082616329193,
0.01943046972155571,
-0.43494749069213867,
-0.07837935537099838,
-0.6783990859985352,
0.24952653050... | Most analyses place Kerry's voting record on the left within the Senate Democratic caucus. During the 2004 presidential election he was portrayed as a staunch liberal by conservative groups and the Bush campaign, who often noted that in 2003 Kerry was rated the National Journal's top Senate liberal. However, that ratin... | Prior to Planck's work, it had been assumed that the energy of a body could take on any value whatsoever – that it was a continuous variable. The Rayleigh–Jeans law makes close predictions for a narrow range of values at one limit of temperatures, but the results diverge more and more strongly as temperatures increase.... | Hence, 6 is not prime. The image at the right illustrates that 12 is not prime: 12 = 3 · 4. No even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1, 2, and n. This implies that n is not prime. Accordingly, the term odd prime refers to any prime numb... | asymptotic distribution | 96,669 |
57299021af94a219006aa50c | Prime_number | In addition to the Riemann hypothesis, many more conjectures revolving about primes have been posed. Often having an elementary formulation, many of these conjectures have withstood a proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture, which asserts that ... | Which conjecture holds that every even integer n greater than 2 can be expressed as a sum of two primes? | {
"answer_start": [
278,
278,
278,
278
],
"text": [
"Goldbach's conjecture",
"Goldbach's",
"Goldbach's",
"Goldbach's"
]
} | Which conjecture holds that every even integer n greater than [MASK] can be expressed as a sum of [MASK] primes? | [
-0.14597362279891968,
0.18470190465450287,
-0.037513770163059235,
-0.11669806391000748,
-0.008965762332081795,
0.18753167986869812,
0.13036364316940308,
-0.30668628215789795,
-0.14544756710529327,
0.22723881900310516,
-0.07404074817895889,
0.2150716930627823,
-0.7039092779159546,
0.3926760... | Prior to the Golden Age of Mandolins, France had a history with the mandolin, with mandolinists playing in Paris until the Napoleonic Wars. The players, teachers and composers included Giovanni Fouchetti, Eduardo Mezzacapo, Gabriele Leon, and Gervasio. During the Golden age itself (1880s-1920s), the mandolin had a stro... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | Goldbach's conjecture | 96,670 |
57299021af94a219006aa50b | Prime_number | In addition to the Riemann hypothesis, many more conjectures revolving about primes have been posed. Often having an elementary formulation, many of these conjectures have withstood a proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture, which asserts that ... | When did Landau propose his four conjectural problems? | {
"answer_start": [
238,
238,
238,
238
],
"text": [
"1912",
"1912",
"1912",
"1912"
]
} | When did [MASK] propose his [MASK] conjectural problems? | [
-0.29919663071632385,
0.29482054710388184,
-0.1901150941848755,
-0.1834818571805954,
0.17519395053386688,
0.6851729154586792,
0.12912899255752563,
-0.2899474501609802,
0.020677611231803894,
-0.3011959195137024,
-0.06266120821237564,
0.2525562345981598,
-0.5275015830993652,
0.02886504493653... | Three main parades take place during Carnival. The first is held on the first day, during which the "Carnival King" (either a person in costume or an effigy) rides through the city on his carriage. The second is held on the first Sunday of the festival and the participants are mainly children. The third and largest tak... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | Von Neumann's famous 9-page paper started life as a talk at Princeton and then became a paper in Germany, which was eventually translated into English. His interest in economics that led to that paper began as follows: When lecturing at Berlin in 1928 and 1929 he spent his summers back home in Budapest, and so did the ... | 1912 | 96,671 |
57299021af94a219006aa50d | Prime_number | In addition to the Riemann hypothesis, many more conjectures revolving about primes have been posed. Often having an elementary formulation, many of these conjectures have withstood a proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture, which asserts that ... | As of February 2011, how many numbers has Goldbach's conjecture been proven to? | {
"answer_start": [
462,
480,
480,
480
],
"text": [
"all numbers up to n = 2 · 1017",
"n = 2 · 1017",
"n = 2",
"n = 2"
]
} | As of [MASK], how many numbers has [MASK] 's conjecture been proven to? | [
0.1678447276353836,
0.17435222864151,
0.19370488822460175,
-0.030262339860200882,
0.1844489723443985,
0.15823568403720856,
-0.00972603540867567,
-0.20032578706741333,
-0.1354282945394516,
0.016984086483716965,
-0.26317185163497925,
0.17447629570960999,
-0.19628000259399414,
0.4471205770969... | During the Republic, any person who wished to hold public office had to conform to the Reformed Church and take an oath to this effect. The extent to which different religions or denominations were persecuted depended much on the time period and regional or city leaders. In the beginning, this was especially focused on... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | Modern primality tests for general numbers n can be divided into two main classes, probabilistic (or "Monte Carlo") and deterministic algorithms. Deterministic algorithms provide a way to tell for sure whether a given number is prime or not. For example, trial division is a deterministic algorithm because, if performed... | all numbers up to n = 2 · 1017 | 96,672 |
57299021af94a219006aa50e | Prime_number | In addition to the Riemann hypothesis, many more conjectures revolving about primes have been posed. Often having an elementary formulation, many of these conjectures have withstood a proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture, which asserts that ... | Which theorem states that all large odd integers can be expressed as a sum of three primes? | {
"answer_start": [
552,
552,
552,
552
],
"text": [
"Vinogradov's theorem",
"Vinogradov's",
"Vinogradov's theorem",
"Vinogradov's theorem"
]
} | Which theorem states that all large odd integers can be expressed as a sum of [MASK] primes? | [
-0.026106666773557663,
0.17344222962856293,
0.02966907247900963,
-0.12366390973329544,
0.04312879219651222,
0.29218918085098267,
0.08973230421543121,
-0.34632909297943115,
-0.19604729115962982,
0.05502080172300339,
-0.10866248607635498,
0.29646700620651245,
-0.6571025252342224,
0.314389944... | Behind the scenes, the bookers in a company will place the title on the most accomplished performer, or those the bookers believe will generate fan interest in terms of event attendance and television viewership. Lower ranked titles may also be used on the performers who show potential, thus allowing them greater expos... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | Vinogradov's theorem | 96,673 |
57299021af94a219006aa50f | Prime_number | In addition to the Riemann hypothesis, many more conjectures revolving about primes have been posed. Often having an elementary formulation, many of these conjectures have withstood a proof for decades: all four of Landau's problems from 1912 are still unsolved. One of them is Goldbach's conjecture, which asserts that ... | Which theorem states that every large even integer can be written as a prime summed with a semiprime? | {
"answer_start": [
661,
661,
661,
661
],
"text": [
"Chen's theorem",
"Chen's",
"Chen's theorem",
"Chen's theorem"
]
} | Which theorem states that every large even integer can be written as a prime summed with a semiprime? | [
-0.22820383310317993,
0.02527789957821369,
0.0009156464948318899,
-0.14634017646312714,
0.07249964773654938,
0.4091211259365082,
0.035600923001766205,
-0.30104440450668335,
-0.08052760362625122,
0.06728293746709824,
-0.21628671884536743,
0.18923835456371307,
-0.6124799847602844,
0.27386200... | In addition to basic uniform clothing, various badges are used by the USAF to indicate a billet assignment or qualification-level for a given assignment. Badges can also be used as merit-based or service-based awards. Over time, various badges have been discontinued and are no longer distributed. Authorized badges incl... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of sever... | Chen's theorem | 96,674 |
572991943f37b319004784a1 | Prime_number | A third type of conjectures concerns aspects of the distribution of primes. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2 (twin prime conjecture). Polignac's conjecture is a strengthening of that conjecture, it states that for every positive integer n, there are infinit... | What conjecture holds that there is an infinite amount of twin primes? | {
"answer_start": [
173,
173,
173,
197
],
"text": [
"twin prime conjecture",
"twin prime conjecture",
"twin prime conjecture",
"Polignac's"
]
} | What conjecture holds that there is an infinite amount of twin primes? | [
0.162986159324646,
-0.10298074036836624,
0.06451985239982605,
0.17976389825344086,
0.20086516439914703,
0.23349910974502563,
0.1775505095720291,
-0.108924999833107,
-0.13484831154346466,
-0.054311055690050125,
-0.09550043940544128,
0.22783149778842926,
-0.7408006191253662,
0.35285112261772... | In many ways, the Paleocene continued processes that had begun during the late Cretaceous Period. During the Paleocene, the continents continued to drift toward their present positions. Supercontinent Laurasia had not yet separated into three continents. Europe and Greenland were still connected. North America and Asia... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | The property of being prime (or not) is called primality. A simple but slow method of verifying the primality of a given number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and . Algorithms much more efficient than trial division have been devised to test the pri... | twin prime conjecture | 96,675 |
572991943f37b319004784a2 | Prime_number | A third type of conjectures concerns aspects of the distribution of primes. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2 (twin prime conjecture). Polignac's conjecture is a strengthening of that conjecture, it states that for every positive integer n, there are infinit... | What is a twin prime? | {
"answer_start": [
138,
138,
138,
138
],
"text": [
"pairs of primes with difference 2",
"pairs of primes with difference 2",
"pairs of primes with difference 2",
"pairs of primes with difference 2"
]
} | What is a twin prime? | [
0.17154735326766968,
-0.2529973089694977,
-0.11472873389720917,
0.27253276109695435,
-0.0945543721318245,
0.14517277479171753,
0.14012373983860016,
-0.1522410660982132,
-0.006218846421688795,
-0.10228748619556427,
-0.23088818788528442,
0.014165215194225311,
-0.4865131676197052,
0.133992731... | Guinea-Bissau was once part of the kingdom of Gabu, as well as part of the Mali Empire. Parts of this kingdom persisted until the 18th century, while a few others were under some rule by the Portuguese Empire since the 16th century. In the 19th century, it was colonized as Portuguese Guinea. Upon independence, declared... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q... | pairs of primes with difference 2 | 96,676 |
572991943f37b319004784a3 | Prime_number | A third type of conjectures concerns aspects of the distribution of primes. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2 (twin prime conjecture). Polignac's conjecture is a strengthening of that conjecture, it states that for every positive integer n, there are infinit... | Which conjecture holds that for any positive integer n, there is an infinite amount of pairs of consecutive primes differing by 2n? | {
"answer_start": [
197,
197,
197,
197
],
"text": [
"Polignac's conjecture",
"Polignac's",
"Polignac's conjecture",
"Polignac's"
]
} | Which conjecture holds that for any positive integer n, there is an infinite amount of pairs of consecutive primes differing by [MASK]? | [
0.16087830066680908,
0.14014706015586853,
-0.013135697692632675,
-0.08067641407251358,
0.09912832081317902,
0.22198332846164703,
0.24403433501720428,
-0.3528784215450287,
-0.30110689997673035,
0.07397650182247162,
-0.015436912886798382,
0.2182764708995819,
-0.771007239818573,
0.34497866034... | The Austrian engineer Paul Eisler invented the printed circuit as part of a radio set while working in England around 1936. Around 1943 the USA began to use the technology on a large scale to make proximity fuses for use in World War II. After the war, in 1948, the USA released the invention for commercial use. Printed... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | Similarly, it is not known if L (the set of all problems that can be solved in logarithmic space) is strictly contained in P or equal to P. Again, there are many complexity classes between the two, such as NL and NC, and it is not known if they are distinct or equal classes. | Polignac's conjecture | 96,677 |
572991943f37b319004784a4 | Prime_number | A third type of conjectures concerns aspects of the distribution of primes. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2 (twin prime conjecture). Polignac's conjecture is a strengthening of that conjecture, it states that for every positive integer n, there are infinit... | Of what form is the infinite amount of primes that comprise the special cases of Schinzel's hypothesis? | {
"answer_start": [
439,
439,
439,
439
],
"text": [
"n2 + 1",
"n2 + 1",
"n2 + 1.",
"n2 + 1"
]
} | Of what form is the infinite amount of primes that comprise the special cases of [MASK] 's hypothesis? | [
0.14626185595989227,
0.1341284066438675,
0.06691869348287582,
0.15784524381160736,
0.07752592861652374,
0.18859423696994781,
0.0780782401561737,
-0.28805220127105713,
-0.12050466984510422,
0.0942339226603508,
-0.2691090404987335,
0.08175389468669891,
-0.6715993881225586,
0.3836275935173034... | The doctrines of the Assumption or Dormition of Mary relate to her death and bodily assumption to Heaven. The Roman Catholic Church has dogmaically defined the doctrine of the Assumption, which was done in 1950 by Pope Pius XII in Munificentissimus Deus. Whether the Virgin Mary died or not is not defined dogmatically, ... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | along with two inequality systems expressing economic efficiency. In this model, the (transposed) probability vector p represents the prices of the goods while the probability vector q represents the "intensity" at which the production process would run. The unique solution λ represents the growth factor which is 1 plu... | n2 + 1 | 96,678 |
572991943f37b319004784a5 | Prime_number | A third type of conjectures concerns aspects of the distribution of primes. It is conjectured that there are infinitely many twin primes, pairs of primes with difference 2 (twin prime conjecture). Polignac's conjecture is a strengthening of that conjecture, it states that for every positive integer n, there are infinit... | What conjecture holds that there are always a minimum of 4 primes between the squares of consecutive primes greater than 2? | {
"answer_start": [
521,
521,
521,
521
],
"text": [
"Brocard's conjecture",
"Brocard's",
"Brocard's conjecture",
"Brocard's"
]
} | What conjecture holds that there are always a minimum of [MASK] primes between the squares of consecutive primes greater than [MASK]? | [
0.11312156915664673,
0.19474583864212036,
-0.12788179516792297,
0.005920004565268755,
0.09065865725278854,
0.0773070827126503,
0.23335599899291992,
-0.32738813757896423,
-0.12103695422410965,
0.05694921687245369,
-0.13610334694385529,
0.2971540689468384,
-0.7357346415519714,
0.145329564809... | Before printing was widely adopted in the 19th century, the Quran was transmitted in manuscripts made by calligraphers and copyists. The earliest manuscripts were written in Ḥijāzī-type script. The Hijazi style manuscripts nevertheless confirm that transmission of the Quran in writing began at an early stage. Probably ... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | are prime for any natural number n. Here represents the floor function, i.e., largest integer not greater than the number in question. The latter formula can be shown using Bertrand's postulate (proven first by Chebyshev), which states that there always exists at least one prime number p with n < p < 2n − 2, for any n... | Brocard's conjecture | 96,679 |
57299326af94a219006aa515 | Prime_number | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | Besides the study of prime numbers, what general theory was considered the official example of pure mathematics? | {
"answer_start": [
17,
17,
17,
17
],
"text": [
"number theory",
"number theory",
"number theory",
"number theory"
]
} | Besides the study of prime numbers, what general theory was considered the official example of pure mathematics? | [
0.1961337924003601,
0.1515776515007019,
-0.19095581769943237,
0.2250194400548935,
-0.1694106012582779,
0.1393098384141922,
0.18814490735530853,
-0.03672332316637039,
-0.13324899971485138,
-0.04072242230176926,
-0.18072474002838135,
0.1614381968975067,
-0.2544803023338318,
0.052698828279972... | Further distinctions in self-concept, called "differentiation," occur as the adolescent recognizes the contextual influences on their own behavior and the perceptions of others, and begin to qualify their traits when asked to describe themselves. Differentiation appears fully developed by mid-adolescence. Peaking in th... | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | The 1990s, along with a rise in object-oriented programming, saw a growth in how data in various databases were handled. Programmers and designers began to treat the data in their databases as objects. That is to say that if a person's data were in a database, that person's attributes, such as their address, phone numb... | number theory | 96,680 |
57299326af94a219006aa516 | Prime_number | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | What British mathematician took pride in doing work that he felt had no military benefit? | {
"answer_start": [
360,
360,
360,
360
],
"text": [
"G. H. Hardy",
"G. H. Hardy",
"G. H. Hardy",
"G. H. Hardy"
]
} | What [MASK] mathematician took pride in doing work that he felt had no military benefit? | [
0.048300713300704956,
0.1754150092601776,
-0.40306609869003296,
0.4411531388759613,
-0.12752756476402283,
0.20468628406524658,
0.17269715666770935,
-0.07934271544218063,
0.028112847357988358,
0.03116295486688614,
-0.32302308082580566,
0.09195750951766968,
-0.11211670190095901,
-0.188468366... | Nobles were born into a noble family, adopted by a noble family (this was abolished in 1633) or ennobled by a king or Sejm for various reasons (bravery in combat, service to the state, etc.—yet this was the rarest means of gaining noble status). Many nobles were, in actuality, really usurpers, being commoners, who move... | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | In the extreme empiricism of the neopositivists—at least before the 1930s—any genuinely synthetic assertion must be reducible to an ultimate assertion (or set of ultimate assertions) that expresses direct observations or perceptions. In later years, Carnap and Neurath abandoned this sort of phenomenalism in favor of a ... | G. H. Hardy | 96,681 |
57299326af94a219006aa517 | Prime_number | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | When was it discovered that prime numbers could applied to the creation of public key cryptography algorithms? | {
"answer_start": [
488,
492,
492,
492
],
"text": [
"the 1970s",
"1970s",
"1970s",
"1970s"
]
} | When was it discovered that prime numbers could applied to the creation of public key cryptography algorithms? | [
0.08263681083917618,
-0.004853920079767704,
-0.3560471832752228,
0.11979372054338455,
0.12291322648525238,
0.2149251401424408,
0.015603429637849331,
-0.3005772829055786,
0.03557093068957329,
0.2267085462808609,
-0.16863535344600677,
-0.030619872733950615,
-0.4013685882091522,
0.02389821596... | Some Normans joined Turkish forces to aid in the destruction of the Armenians vassal-states of Sassoun and Taron in far eastern Anatolia. Later, many took up service with the Armenian state further south in Cilicia and the Taurus Mountains. A Norman named Oursel led a force of "Franks" into the upper Euphrates valley i... | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | A Turing machine is a mathematical model of a general computing machine. It is a theoretical device that manipulates symbols contained on a strip of tape. Turing machines are not intended as a practical computing technology, but rather as a thought experiment representing a computing machine—anything from an advanced s... | the 1970s | 96,682 |
57299326af94a219006aa518 | Prime_number | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | Besides public key cryptography, what is another application for prime numbers? | {
"answer_start": [
664,
664,
664,
664
],
"text": [
"hash tables",
"hash tables",
"hash tables and pseudorandom number generators",
"hash tables and pseudorandom number generators"
]
} | Besides public key cryptography, what is another application for prime numbers? | [
0.2847379148006439,
-0.060428500175476074,
-0.2512263059616089,
0.24690890312194824,
0.2564893960952759,
0.1584957391023636,
-0.03740807995200157,
-0.17205865681171417,
-0.1717378944158554,
0.18297263979911804,
-0.35772424936294556,
-0.02137896791100502,
-0.39662331342697144,
0.00256870547... | The modern literary language is usually considered to date from the time of Alexander Pushkin (Алекса́ндр Пу́шкин) in the first third of the 19th century. Pushkin revolutionized Russian literature by rejecting archaic grammar and vocabulary (so-called "высо́кий стиль" — "high style") in favor of grammar and vocabulary ... | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | In most computers, individual instructions are stored as machine code with each instruction being given a unique number (its operation code or opcode for short). The command to add two numbers together would have one opcode; the command to multiply them would have a different opcode, and so on. The simplest computers a... | hash tables | 96,683 |
57299326af94a219006aa519 | Prime_number | For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of the self-interest of studying the topic with the exception of use of prime numbered gear teeth to distribute wear evenly. In particular, number ... | What type of number generators make use of prime numbers? | {
"answer_start": [
680,
680,
680,
680
],
"text": [
"pseudorandom number generators",
"pseudorandom",
"pseudorandom",
"pseudorandom"
]
} | What type of number generators make use of prime numbers? | [
0.5418415665626526,
0.0031910608522593975,
-0.14539393782615662,
0.17331118881702423,
0.015188542194664478,
0.3445526957511902,
-0.026065455749630928,
-0.34683024883270264,
-0.14511021971702576,
-0.0011648284271359444,
-0.178331658244133,
0.0023336969316005707,
-0.5558899641036987,
0.11911... | Victoria wrote to her uncle Leopold, whom Victoria considered her "best and kindest adviser", to thank him "for the prospect of great happiness you have contributed to give me, in the person of dear Albert ... He possesses every quality that could be desired to render me perfectly happy. He is so sensible, so kind, and... | There are hints in the surviving records of the ancient Egyptians that they had some knowledge of prime numbers: the Egyptian fraction expansions in the Rhind papyrus, for instance, have quite different forms for primes and for composites. However, the earliest surviving records of the explicit study of prime numbers c... | The 1990s, along with a rise in object-oriented programming, saw a growth in how data in various databases were handled. Programmers and designers began to treat the data in their databases as objects. That is to say that if a person's data were in a database, that person's attributes, such as their address, phone numb... | pseudorandom number generators | 96,684 |
572995d46aef051400154fe8 | Prime_number | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | Assuming p is a prime other than 2 or 5, then, according to Fermat's theorem, what type of decimal will 1/p always be? | {
"answer_start": [
215,
217,
217,
217,
217
],
"text": [
"a recurring decimal",
"recurring",
"recurring",
"recurring",
"recurring"
]
} | Assuming p is a prime other than [MASK] or [MASK], then, according to [MASK] 's theorem, what type of decimal will [MASK] / p always be? | [
0.15722821652889252,
0.016728045418858528,
0.13208650052547455,
0.2764522433280945,
0.16772811114788055,
0.26141583919525146,
-0.2433042824268341,
-0.032731860876083374,
-0.17207036912441254,
0.44315510988235474,
-0.3773760199546814,
0.12211958318948746,
-0.2844792306423187,
0.072483763098... | Population has outstripped the supply of freshwater, usually from rainfall. The northern atolls get 50 inches (1,300 mm) of rainfall annually; the southern atolls about twice that. The threat of drought is commonplace throughout the island chains. | But bounding the computation time above by some concrete function f(n) often yields complexity classes that depend on the chosen machine model. For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machine, but necessarily requires quadratic time in the model of si... | Prime numbers give rise to two more general concepts that apply to elements of any commutative ring R, an algebraic structure where addition, subtraction and multiplication are defined: prime elements and irreducible elements. An element p of R is called prime element if it is neither zero nor a unit (i.e., does not ha... | a recurring decimal | 96,685 |
572995d46aef051400154fe9 | Prime_number | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | According to Fermat's theorem, what period does 1/p always have assuming p is prime that is not 2 or 5? | {
"answer_start": [
252,
252,
252,
252,
252
],
"text": [
"p − 1",
"p − 1",
"p − 1 or a divisor of p − 1",
"p − 1 or a divisor of p − 1",
"p − 1 or a divisor of p − 1"
]
} | According to [MASK] 's theorem, what period does [MASK] / p always have assuming p is prime that is not [MASK] or [MASK]? | [
0.15807074308395386,
-0.0544017031788826,
0.3129482865333557,
0.08829709142446518,
0.3682028353214264,
0.03206312656402588,
-0.12664572894573212,
-0.030636830255389214,
-0.10245297104120255,
0.2692527770996094,
-0.38696369528770447,
0.16597507894039154,
-0.1741316318511963,
0.1428319066762... | As Ashkenazi Jews moved away from Europe, mostly in the form of aliyah to Israel, or immigration to North America, and other English-speaking areas; and Europe (particularly France) and Latin America, the geographic isolation that gave rise to Ashkenazim has given way to mixing with other cultures, and with non-Ashkena... | But bounding the computation time above by some concrete function f(n) often yields complexity classes that depend on the chosen machine model. For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machine, but necessarily requires quadratic time in the model of si... | along with two inequality systems expressing economic efficiency. In this model, the (transposed) probability vector p represents the prices of the goods while the probability vector q represents the "intensity" at which the production process would run. The unique solution λ represents the growth factor which is 1 plu... | p − 1 | 96,686 |
572995d46aef051400154fea | Prime_number | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | According to Wilson's theorem, what factorial must be divisible by p if some integer p > 1 is to be considered prime? | {
"answer_start": [
495,
495,
495,
495,
495
],
"text": [
"(p − 1)! + 1",
"(p − 1)! + 1",
"(p − 1)! + 1",
"(p − 1)! + 1",
"(p − 1)! + 1"
]
} | According to [MASK] 's theorem, what factorial must be divisible by p if some integer p > [MASK] is to be considered prime? | [
0.045560967177152634,
0.08375077694654465,
0.12513603270053864,
0.008309477008879185,
-0.0001748187351040542,
0.34692680835723877,
0.12831880152225494,
-0.4148595631122589,
-0.04913455620408058,
0.13754412531852722,
-0.3995624780654907,
0.16948232054710388,
-0.521643340587616,
0.1783515512... | Currently, the rapid influx of northerners and immigrants from Latin America is steadily increasing ethnic and religious diversity: the number of Roman Catholics and Jews in the state has increased, as well as general religious diversity. The second-largest Protestant denomination in North Carolina after Baptist tradit... | But bounding the computation time above by some concrete function f(n) often yields complexity classes that depend on the chosen machine model. For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machine, but necessarily requires quadratic time in the model of si... | The following table gives the largest known primes of the mentioned types. Some of these primes have been found using distributed computing. In 2009, the Great Internet Mersenne Prime Search project was awarded a US$100,000 prize for first discovering a prime with at least 10 million digits. The Electronic Frontier Fou... | (p − 1)! + 1 | 96,687 |
572995d46aef051400154feb | Prime_number | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | According to Wilson's theorem, what factorial must be divisible by n if some integer n > 4 is to be considered composite? | {
"answer_start": [
582,
582,
582,
582,
582
],
"text": [
"(n − 1)!",
"(n − 1)!",
"(n − 1)!",
"(n − 1)!",
"(n − 1)!"
]
} | According to [MASK] 's theorem, what factorial must be divisible by n if some integer n > [MASK] is to be considered composite? | [
0.0439273975789547,
0.1398973912000656,
0.016744893044233322,
-0.1464087814092636,
-0.025008607655763626,
0.4621334373950958,
0.11278721690177917,
-0.2926916778087616,
-0.23401404917240143,
0.025856060907244682,
-0.26092374324798584,
0.059763070195913315,
-0.4615950286388397,
0.15787181258... | The Greek islands are traditionally grouped into the following clusters: The Argo-Saronic Islands in the Saronic gulf near Athens, the Cyclades, a large but dense collection occupying the central part of the Aegean Sea, the North Aegean islands, a loose grouping off the west coast of Turkey, the Dodecanese, another loo... | But bounding the computation time above by some concrete function f(n) often yields complexity classes that depend on the chosen machine model. For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machine, but necessarily requires quadratic time in the model of si... | After the Greeks, little happened with the study of prime numbers until the 17th century. In 1640 Pierre de Fermat stated (without proof) Fermat's little theorem (later proved by Leibniz and Euler). Fermat also conjectured that all numbers of the form 22n + 1 are prime (they are called Fermat numbers) and he verified t... | (n − 1)! | 96,688 |
572995d46aef051400154fec | Prime_number | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | What condition what must be satisfied in order for 1/p to be expressed in base q instead of base 10 and still have a period of p - 1? | {
"answer_start": [
383,
383,
383,
383,
383
],
"text": [
"p is not a prime factor of q",
"p is not a prime factor of q",
"p is not a prime factor of q",
"p is not a prime factor of q.",
"p is not a prime factor of q."
]
} | What condition what must be satisfied in order for [MASK] [MASK] p to be expressed in base q instead of base [MASK] and still have a period of p- [MASK]? | [
0.12236596643924713,
0.03334570676088333,
0.3642048239707947,
-0.08010022342205048,
0.27590811252593994,
0.08475141227245331,
0.0756077766418457,
-0.46235600113868713,
-0.041569147258996964,
0.252436101436615,
-0.3776574730873108,
0.2673185169696808,
-0.15833912789821625,
0.173632726073265... | Under the terms of the concluding Treaty of Versailles signed in 1919, the empire reached its greatest extent with the addition of 1,800,000 square miles (4,700,000 km2) and 13 million new subjects. The colonies of Germany and the Ottoman Empire were distributed to the Allied powers as League of Nations mandates. Brita... | But bounding the computation time above by some concrete function f(n) often yields complexity classes that depend on the chosen machine model. For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machine, but necessarily requires quadratic time in the model of si... | The property of being prime (or not) is called primality. A simple but slow method of verifying the primality of a given number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and . Algorithms much more efficient than trial division have been devised to test the pri... | p is not a prime factor of q | 96,689 |
572996c73f37b319004784b3 | Prime_number | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | What is one type of public key cryptography algorithm? | {
"answer_start": [
52,
52,
52,
52
],
"text": [
"RSA",
"RSA",
"RSA",
"RSA"
]
} | What is [MASK] type of public key cryptography algorithm? | [
-0.0635882094502449,
-0.14013971388339996,
-0.22198593616485596,
0.06759999692440033,
0.21932634711265564,
0.07068166881799698,
0.14546118676662445,
-0.14925284683704376,
0.04298499971628189,
0.0978248193860054,
-0.3933826982975006,
0.09072552621364594,
-0.4463866055011749,
0.0127334706485... | The highest point in the state is Clingmans Dome at 6,643 feet (2,025 m). Clingmans Dome, which lies on Tennessee's eastern border, is the highest point on the Appalachian Trail, and is the third highest peak in the United States east of the Mississippi River. The state line between Tennessee and North Carolina crosses... | In a further refinement of the direct use of probabilistic modelling, statistical estimates can be coupled to an algorithm called arithmetic coding. Arithmetic coding is a more modern coding technique that uses the mathematical calculations of a finite-state machine to produce a string of encoded bits from a series of ... | In almost all modern computers, each memory cell is set up to store binary numbers in groups of eight bits (called a byte). Each byte is able to represent 256 different numbers (28 = 256); either from 0 to 255 or −128 to +127. To store larger numbers, several consecutive bytes may be used (typically, two, four or eight... | RSA | 96,690 |
572996c73f37b319004784b4 | Prime_number | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | What is another type of public key cryptography algorithm? | {
"answer_start": [
60,
64,
64,
64
],
"text": [
"the Diffie–Hellman key exchange",
"Diffie–Hellman",
"Diffie–Hellman key exchange",
"Diffie–Hellman key exchange"
]
} | What is another type of public key cryptography algorithm? | [
-0.010805531404912472,
-0.23366570472717285,
-0.24145278334617615,
0.07708518207073212,
0.23362883925437927,
0.0786273181438446,
0.12489492446184158,
-0.18991096317768097,
-0.01987832970917225,
0.07202627509832382,
-0.33035796880722046,
0.06498675048351288,
-0.43241623044013977,
0.00297358... | Comcast Corporation, formerly registered as Comcast Holdings,[note 1] is an American multinational mass media company and is the largest broadcasting and largest cable company in the world by revenue. It is the second largest pay-TV company after the AT&T-DirecTV acquisition, largest cable TV company and largest home I... | In a further refinement of the direct use of probabilistic modelling, statistical estimates can be coupled to an algorithm called arithmetic coding. Arithmetic coding is a more modern coding technique that uses the mathematical calculations of a finite-state machine to produce a string of encoded bits from a series of ... | Most browsers support HTTP Secure and offer quick and easy ways to delete the web cache, download history, form and search history, cookies, and browsing history. For a comparison of the current security vulnerabilities of browsers, see comparison of web browsers. | the Diffie–Hellman key exchange | 96,691 |
572996c73f37b319004784b5 | Prime_number | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | How many bits are often in the primes used for RSA public key cryptography algorithms? | {
"answer_start": [
140,
140,
140,
140
],
"text": [
"512-bit",
"512",
"512",
"512"
]
} | How many bits are often in the primes used for RSA public key cryptography algorithms? | [
0.19466286897659302,
-0.03508422523736954,
0.01911083050072193,
0.14837850630283356,
0.19072042405605316,
0.35765963792800903,
-0.02792017161846161,
-0.40165406465530396,
-0.02155929058790207,
0.32948166131973267,
-0.15732741355895996,
0.03176627308130264,
-0.5646395087242126,
0.0714469403... | In the centre of Basel, the first major city in the course of the stream, is located the "Rhine knee"; this is a major bend, where the overall direction of the Rhine changes from West to North. Here the High Rhine ends. Legally, the Central Bridge is the boundary between High and Upper Rhine. The river now flows North ... | In a further refinement of the direct use of probabilistic modelling, statistical estimates can be coupled to an algorithm called arithmetic coding. Arithmetic coding is a more modern coding technique that uses the mathematical calculations of a finite-state machine to produce a string of encoded bits from a series of ... | The committee debated the possibility of a shift function (like in ITA2), which would allow more than 64 codes to be represented by a six-bit code. In a shifted code, some character codes determine choices between options for the following character codes. It allows compact encoding, but is less reliable for data trans... | 512-bit | 96,692 |
572996c73f37b319004784b6 | Prime_number | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | On what type of exponentiation does the Diffie–Hellman key exchange depend on? | {
"answer_start": [
541,
541,
541,
541
],
"text": [
"modular exponentiation",
"modular",
"modular",
"modular"
]
} | On what type of exponentiation does the Diffie–Hellman key exchange depend on? | [
-0.059833452105522156,
0.10243729501962662,
0.03277365863323212,
0.093032605946064,
0.09166493266820908,
0.17341111600399017,
0.09350892901420593,
-0.30749082565307617,
0.25513702630996704,
0.10968971252441406,
-0.3271367847919464,
0.21779215335845947,
-0.5211145281791687,
0.26669082045555... | Birds have been domesticated by humans both as pets and for practical purposes. Colourful birds, such as parrots and mynas, are bred in captivity or kept as pets, a practice that has led to the illegal trafficking of some endangered species. Falcons and cormorants have long been used for hunting and fishing, respective... | In a further refinement of the direct use of probabilistic modelling, statistical estimates can be coupled to an algorithm called arithmetic coding. Arithmetic coding is a more modern coding technique that uses the mathematical calculations of a finite-state machine to produce a string of encoded bits from a series of ... | are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p − 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2p − 1, wher... | modular exponentiation | 96,693 |
572996c73f37b319004784b7 | Prime_number | Several public-key cryptography algorithms, such as RSA and the Diffie–Hellman key exchange, are based on large prime numbers (for example, 512-bit primes are frequently used for RSA and 1024-bit primes are typical for Diffie–Hellman.). RSA relies on the assumption that it is much easier (i.e., more efficient) to perfo... | How many bits are typically used in the primes for the Diffie–Hellman key exchange? | {
"answer_start": [
187,
187,
187,
187
],
"text": [
"1024-bit",
"1024",
"1024",
"1024"
]
} | How many bits are typically used in the primes for the Diffie–Hellman key exchange? | [
0.18787698447704315,
-0.023076312616467476,
0.055570997297763824,
0.2279430478811264,
0.26149657368659973,
0.3403785228729248,
-0.0003349541802890599,
-0.3240984380245209,
0.17502278089523315,
0.11168178915977478,
-0.2684619426727295,
0.2465631067752838,
-0.6154795289039612,
0.184767112135... | One of John's principal challenges was acquiring the large sums of money needed for his proposed campaigns to reclaim Normandy. The Angevin kings had three main sources of income available to them, namely revenue from their personal lands, or demesne; money raised through their rights as a feudal lord; and revenue from... | In a further refinement of the direct use of probabilistic modelling, statistical estimates can be coupled to an algorithm called arithmetic coding. Arithmetic coding is a more modern coding technique that uses the mathematical calculations of a finite-state machine to produce a string of encoded bits from a series of ... | There is active research to make computers out of many promising new types of technology, such as optical computers, DNA computers, neural computers, and quantum computers. Most computers are universal, and are able to calculate any computable function, and are limited only by their memory capacity and operating speed.... | 1024-bit | 96,694 |
572998673f37b319004784d5 | Prime_number | The evolutionary strategy used by cicadas of the genus Magicicada make use of prime numbers. These insects spend most of their lives as grubs underground. They only pupate and then emerge from their burrows after 7, 13 or 17 years, at which point they fly about, breed, and then die after a few weeks at most. The logic ... | What type of insect employs the use of prime numbers in its evolutionary strategy? | {
"answer_start": [
34,
34,
34,
34
],
"text": [
"cicadas",
"cicadas",
"cicadas",
"cicadas"
]
} | What type of insect employs the use of prime numbers in its evolutionary strategy? | [
0.23395951092243195,
0.01059808861464262,
-0.477316677570343,
0.12948620319366455,
0.30922186374664307,
0.3626176416873932,
0.15278874337673187,
0.08582818508148193,
-0.21729670464992523,
-0.26633408665657043,
0.0026743451599031687,
-0.17156590521335602,
-0.5092746615409851,
-0.03774906322... | John's campaign started well. In November John retook Rochester Castle from rebel baron William d'Aubigny in a sophisticated assault. One chronicler had not seen "a siege so hard pressed or so strongly resisted", whilst historian Reginald Brown describes it as "one of the greatest [siege] operations in England up to th... | The act of predation can be broken down into a maximum of four stages: Detection of prey, attack, capture and finally consumption. The relationship between predator and prey is one that is typically beneficial to the predator, and detrimental to the prey species. Sometimes, however, predation has indirect benefits to t... | Unlike in higher animals, where parthenogenesis is rare, asexual reproduction may occur in plants by several different mechanisms. The formation of stem tubers in potato is one example. Particularly in arctic or alpine habitats, where opportunities for fertilisation of flowers by animals are rare, plantlets or bulbs, m... | cicadas | 96,695 |
572998673f37b319004784d6 | Prime_number | The evolutionary strategy used by cicadas of the genus Magicicada make use of prime numbers. These insects spend most of their lives as grubs underground. They only pupate and then emerge from their burrows after 7, 13 or 17 years, at which point they fly about, breed, and then die after a few weeks at most. The logic ... | Where do cicadas spend the majority of their lives? | {
"answer_start": [
133,
142,
142,
142
],
"text": [
"as grubs underground",
"underground",
"underground",
"underground"
]
} | Where do cicadas spend the majority of their lives? | [
0.42570117115974426,
0.09768363833427429,
0.023487230762839317,
0.3067854642868042,
0.6959636807441711,
-0.00362209789454937,
0.25921764969825745,
0.39618349075317383,
-0.3699260354042053,
0.0572722926735878,
-0.15580317378044128,
-0.26399660110473633,
-0.4276692569255829,
-0.0509836040437... | On December 25, 1991, the Russian SFSR was renamed the Russian Federation. On December 26, 1991, the USSR was self-dissolved by the Soviet of Nationalities, which by that time was the only functioning house of the Supreme Soviet (the other house, Soviet of the Union, had already lost the quorum after recall of its memb... | The act of predation can be broken down into a maximum of four stages: Detection of prey, attack, capture and finally consumption. The relationship between predator and prey is one that is typically beneficial to the predator, and detrimental to the prey species. Sometimes, however, predation has indirect benefits to t... | Many long-distance migrants appear to be genetically programmed to respond to changing day length. Species that move short distances, however, may not need such a timing mechanism, instead moving in response to local weather conditions. Thus mountain and moorland breeders, such as wallcreeper Tichodroma muraria and whi... | as grubs underground | 96,696 |
572998673f37b319004784d7 | Prime_number | The evolutionary strategy used by cicadas of the genus Magicicada make use of prime numbers. These insects spend most of their lives as grubs underground. They only pupate and then emerge from their burrows after 7, 13 or 17 years, at which point they fly about, breed, and then die after a few weeks at most. The logic ... | Other than 7 and 13, what other year interval do cicadas pupate? | {
"answer_start": [
222,
222,
222,
222
],
"text": [
"17 years",
"17",
"17",
"17"
]
} | Other than [MASK] and [MASK], what other year interval do cicadas pupate? | [
0.22660960257053375,
0.2324542999267578,
-0.05439305678009987,
0.09542287141084671,
0.5231817364692688,
-0.09519494324922562,
0.27934151887893677,
0.2762919068336487,
-0.19882729649543762,
-0.10390429198741913,
-0.10670739412307739,
-0.2095693200826645,
-0.2018449753522873,
0.0909103602170... | In the early 1990s, Dell sold its products through Best Buy, Costco and Sam's Club stores in the United States. Dell stopped this practice in 1994, citing low profit-margins on the business, exclusively distributing through a direct-sales model for the next decade. In 2003, Dell briefly sold products in Sears stores in... | The act of predation can be broken down into a maximum of four stages: Detection of prey, attack, capture and finally consumption. The relationship between predator and prey is one that is typically beneficial to the predator, and detrimental to the prey species. Sometimes, however, predation has indirect benefits to t... | However, the lifecycles of most living polychaetes, which are almost all marine animals, are unknown, and only about 25% of the 300+ species whose lifecycles are known follow this pattern. About 14% use a similar external fertilization but produce yolk-rich eggs, which reduce the time the larva needs to spend among the... | 17 years | 96,697 |
572998673f37b319004784d8 | Prime_number | The evolutionary strategy used by cicadas of the genus Magicicada make use of prime numbers. These insects spend most of their lives as grubs underground. They only pupate and then emerge from their burrows after 7, 13 or 17 years, at which point they fly about, breed, and then die after a few weeks at most. The logic ... | What is the logic behind the cicadas prime number evolutionary strategy? | {
"answer_start": [
398,
411,
352,
352
],
"text": [
"make it very difficult for predators to evolve that could specialize as predators",
"difficult for predators to evolve that could specialize as predators on Magicicadas",
"the prime number intervals between emergences make it very di... | What is the logic behind the cicadas prime number evolutionary strategy? | [
0.10303045809268951,
-0.17284713685512543,
-0.03472747653722763,
0.24701346457004547,
0.5714116096496582,
0.19418613612651825,
-0.053123533725738525,
-0.15101464092731476,
-0.049383826553821564,
-0.2593640685081482,
-0.2766692042350769,
-0.06378812342882156,
-0.5852680206298828,
0.20156034... | In late February, large public rallies took place in Kiev to protest the election laws, on the eve of the March 26 elections to the USSR Congress of People's Deputies, and to call for the resignation of the first secretary of the Communist Party of Ukraine, Volodymyr Scherbytsky, lampooned as "the mastodon of stagnatio... | The act of predation can be broken down into a maximum of four stages: Detection of prey, attack, capture and finally consumption. The relationship between predator and prey is one that is typically beneficial to the predator, and detrimental to the prey species. Sometimes, however, predation has indirect benefits to t... | The primary physiological cue for migration are the changes in the day length. These changes are also related to hormonal changes in the birds. In the period before migration, many birds display higher activity or Zugunruhe (German: migratory restlessness), first described by Johann Friedrich Naumann in 1795, as well a... | make it very difficult for predators to evolve that could specialize as predators | 96,698 |
572998673f37b319004784d9 | Prime_number | The evolutionary strategy used by cicadas of the genus Magicicada make use of prime numbers. These insects spend most of their lives as grubs underground. They only pupate and then emerge from their burrows after 7, 13 or 17 years, at which point they fly about, breed, and then die after a few weeks at most. The logic ... | How much larger would cicada predator populations be if cicada outbreaks occurred at 14 and 15 year intervals? | {
"answer_start": [
775,
781,
781,
781
],
"text": [
"up to 2% higher",
"2%",
"2%",
"2%"
]
} | How much larger would cicada predator populations be if cicada outbreaks occurred at [MASK] intervals? | [
0.10509296506643295,
-0.2247534990310669,
-0.042101986706256866,
0.026678526774048805,
0.2865883708000183,
0.03699846193194389,
0.2297421395778656,
0.14610543847084045,
-0.32551756501197815,
-0.2427462786436081,
0.04990481957793236,
-0.14670425653457642,
-0.5452448129653931,
0.018775044009... | Southampton used to be home to a number of ferry services to the continent, with destinations such as San Sebastian, Lisbon, Tangier and Casablanca. A ferry port was built during the 1960s. However, a number of these relocated to Portsmouth and by 1996, there were no longer any car ferries operating from Southampton wi... | The act of predation can be broken down into a maximum of four stages: Detection of prey, attack, capture and finally consumption. The relationship between predator and prey is one that is typically beneficial to the predator, and detrimental to the prey species. Sometimes, however, predation has indirect benefits to t... | Ninety-five percent of bird species are socially monogamous. These species pair for at least the length of the breeding season or—in some cases—for several years or until the death of one mate. Monogamy allows for both paternal care and biparental care, which is especially important for species in which females require... | up to 2% higher | 96,699 |
57299a6f6aef051400155016 | Prime_number | The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q... | What does the word prime generally suggest? | {
"answer_start": [
170,
156,
156,
156
],
"text": [
"indecomposability",
"minimality",
"minimality or indecomposability",
"minimality or indecomposability"
]
} | What does the word prime generally suggest? | [
0.4019632935523987,
0.034911222755908966,
-0.23741932213306427,
0.01524374820291996,
0.06461969017982483,
0.275869220495224,
-0.13583801686763763,
0.07867850363254547,
-0.0855080708861351,
0.20018701255321503,
-0.39920270442962646,
0.2273070067167282,
-0.2964910864830017,
0.186007186770439... | Between AD 300 and 1300 in the northern part of the state along the wide, fertile valley on the San Miguel River the Casas Grandes (Big Houses) culture developed into an advanced civilization. The Casas Grandes civilization is part of a major prehistoric archaeological culture known as Mogollon which is related to the ... | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | for any constant c. Matrix groups over these fields fall under this regime, as do adele rings and adelic algebraic groups, which are basic to number theory. Galois groups of infinite field extensions such as the absolute Galois group can also be equipped with a topology, the so-called Krull topology, which in turn is c... | indecomposability | 96,700 |
57299a6f6aef051400155017 | Prime_number | The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q... | For a field F containing 0 and 1, what would be the prime field? | {
"answer_start": [
246,
246,
319,
246
],
"text": [
"the smallest subfield",
"the smallest subfield",
"Q or the finite field with p elements",
"the smallest subfield"
]
} | For a field F containing [MASK] and [MASK], what would be the prime field? | [
0.20112016797065735,
-0.18931378424167633,
0.15896911919116974,
0.10572981089353561,
-0.0359940379858017,
0.2286834567785263,
-0.15859992802143097,
-0.24344663321971893,
-0.019699789583683014,
-0.0994950607419014,
-0.3933608829975128,
0.12925401329994202,
-0.5973588228225708,
0.25887417793... | Red is the color at the end of the spectrum of visible light next to orange and opposite violet. Red color has a predominant light wavelength of roughly 620–740 nanometres. Red is one of the additive primary colors of visible light, along with green and blue, which in Red Green Blue (RGB) color systems are combined to ... | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | Of course, some complexity classes have complicated definitions that do not fit into this framework. Thus, a typical complexity class has a definition like the following: | the smallest subfield | 96,701 |
57299a6f6aef051400155019 | Prime_number | The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q... | How can any knot be distinctively indicated? | {
"answer_start": [
728,
728,
728,
728
],
"text": [
"as a connected sum of prime knots",
"as a connected sum of prime knots",
"as a connected sum of prime knots",
"as a connected sum of prime knots"
]
} | How can any knot be distinctively indicated? | [
0.1871407926082611,
0.12171047180891037,
-0.16547179222106934,
0.10419392585754395,
0.13717955350875854,
0.2670862674713135,
0.44702139496803284,
-0.2846369445323944,
-0.2278812974691391,
-0.1063762828707695,
-0.18139123916625977,
-0.2677950859069824,
-0.09593308717012405,
0.19924204051494... | According to the Framework Law (3549/2007), Public higher education "Highest Educational Institutions" (Ανώτατα Εκπαιδευτικά Ιδρύματα, Anótata Ekpaideytiká Idrýmata, "ΑΕΙ") consists of two parallel sectors:the University sector (Universities, Polytechnics, Fine Arts Schools, the Open University) and the Technological s... | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | In ring theory, the notion of number is generally replaced with that of ideal. Prime ideals, which generalize prime elements in the sense that the principal ideal generated by a prime element is a prime ideal, are an important tool and object of study in commutative algebra, algebraic number theory and algebraic geomet... | as a connected sum of prime knots | 96,702 |
57299a6f6aef05140015501a | Prime_number | The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q... | What is an additional meaning intended when the word prime is used? | {
"answer_start": [
459,
459,
459,
459
],
"text": [
"any object can be, essentially uniquely, decomposed into its prime components",
"any object can be, essentially uniquely, decomposed into its prime components",
"any object can be, essentially uniquely, decomposed into its prime comp... | What is an additional meaning intended when the word prime is used? | [
0.48295027017593384,
-0.02449856884777546,
-0.19513635337352753,
0.0571260079741478,
0.13051943480968475,
0.258170485496521,
-0.27123501896858215,
0.12056230008602142,
-0.0639973133802414,
0.1326378881931305,
-0.4410281181335449,
0.17574574053287506,
-0.3827820420265198,
0.2437537759542465... | During 1824–28 Chopin spent his vacations away from Warsaw, at a number of locales.[n 4] In 1824 and 1825, at Szafarnia, he was a guest of Dominik Dziewanowski, the father of a schoolmate. Here for the first time he encountered Polish rural folk music. His letters home from Szafarnia (to which he gave the title "The Sz... | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | any object can be, essentially uniquely, decomposed into its prime components | 96,703 |
57299a6f6aef051400155018 | Prime_number | The concept of prime number is so important that it has been generalized in different ways in various branches of mathematics. Generally, "prime" indicates minimality or indecomposability, in an appropriate sense. For example, the prime field is the smallest subfield of a field F containing both 0 and 1. It is either Q... | What does it mean for a knot to be considered indecomposable? | {
"answer_start": [
631,
634,
634,
631
],
"text": [
"it cannot be written as the knot sum of two nontrivial knots",
"cannot be written as the knot sum of two nontrivial knots",
"cannot be written as the knot sum of two nontrivial knots",
"it cannot be written as the knot sum of two... | What does it mean for a knot to be considered indecomposable? | [
-0.05304011330008507,
-0.10577085614204407,
-0.11791438609361649,
0.3088425397872925,
0.3142760396003723,
0.0649377629160881,
0.39970511198043823,
-0.24832379817962646,
-0.36308053135871887,
-0.06229764595627785,
-0.3317946195602417,
-0.14350996911525726,
-0.49767768383026123,
0.1412274092... | Originating as the Jama'at al-Tawhid wal-Jihad in 1999, it pledged allegiance to al-Qaeda in 2004, participated in the Iraqi insurgency that followed the March 2003 invasion of Iraq by Western forces, joined the fight in the Syrian Civil War beginning in March 2011, and was expelled from al-Qaeda in early 2014, (which ... | can have infinitely many primes only when a and q are coprime, i.e., their greatest common divisor is one. If this necessary condition is satisfied, Dirichlet's theorem on arithmetic progressions asserts that the progression contains infinitely many primes. The picture below illustrates this with q = 9: the numbers are... | Many known complexity classes are suspected to be unequal, but this has not been proved. For instance P ⊆ NP ⊆ PP ⊆ PSPACE, but it is possible that P = PSPACE. If P is not equal to NP, then P is not equal to PSPACE either. Since there are many known complexity classes between P and PSPACE, such as RP, BPP, PP, BQP, MA,... | it cannot be written as the knot sum of two nontrivial knots | 96,704 |
57299c2c6aef051400155020 | Prime_number | Prime numbers give rise to two more general concepts that apply to elements of any commutative ring R, an algebraic structure where addition, subtraction and multiplication are defined: prime elements and irreducible elements. An element p of R is called prime element if it is neither zero nor a unit (i.e., does not ha... | What is the name of an algebraic structure in which addition, subtraction and multiplication are defined? | {
"answer_start": [
83,
83,
95,
83
],
"text": [
"commutative ring R",
"commutative ring",
"ring R",
"commutative ring R"
]
} | What is the name of an algebraic structure in which addition, subtraction and multiplication are defined? | [
-0.19315780699253082,
0.2863808870315552,
-0.09892932325601578,
-0.06215137988328934,
-0.11095547676086426,
0.2972419857978821,
0.03768071159720421,
-0.024701979011297226,
-0.3031792640686035,
0.06076415255665779,
-0.3050660789012909,
-0.03510144725441933,
-0.26679661870002747,
0.088252186... | Heitaro Nakajima, who developed an early digital audio recorder within Japan's national public broadcasting organization NHK in 1970, became general manager of Sony's audio department in 1971. His team developed a digital PCM adaptor audio tape recorder using a Betamax video recorder in 1973. After this, in 1974 the le... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | The property of being prime (or not) is called primality. A simple but slow method of verifying the primality of a given number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and . Algorithms much more efficient than trial division have been devised to test the pri... | commutative ring R | 96,705 |
57299c2c6aef051400155021 | Prime_number | Prime numbers give rise to two more general concepts that apply to elements of any commutative ring R, an algebraic structure where addition, subtraction and multiplication are defined: prime elements and irreducible elements. An element p of R is called prime element if it is neither zero nor a unit (i.e., does not ha... | What is one general concept that applies to elements of commutative rings? | {
"answer_start": [
186,
186,
186,
186
],
"text": [
"prime elements",
"prime elements",
"prime elements",
"prime elements"
]
} | What is [MASK] general concept that applies to elements of commutative rings? | [
0.1595078408718109,
0.29665616154670715,
0.23205769062042236,
-0.23318727314472198,
0.042944781482219696,
0.009509766474366188,
0.1055205836892128,
-0.3526290953159332,
0.0031121415086090565,
0.30428141355514526,
-0.46563920378685,
0.24002774059772491,
-0.5403175354003906,
0.08301630616188... | London's most popular sport is football and it has fourteen League football clubs, including five in the Premier League: Arsenal, Chelsea, Crystal Palace, Tottenham Hotspur, and West Ham United. Among other professional teams based in London include Fulham, Queens Park Rangers, Millwall and Charlton Athletic. In May 20... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | In particular, this norm gets smaller when a number is multiplied by p, in sharp contrast to the usual absolute value (also referred to as the infinite prime). While completing Q (roughly, filling the gaps) with respect to the absolute value yields the field of real numbers, completing with respect to the p-adic norm |... | prime elements | 96,706 |
57299c2c6aef051400155022 | Prime_number | Prime numbers give rise to two more general concepts that apply to elements of any commutative ring R, an algebraic structure where addition, subtraction and multiplication are defined: prime elements and irreducible elements. An element p of R is called prime element if it is neither zero nor a unit (i.e., does not ha... | What is another general concept that applies to elements of commutative rings? | {
"answer_start": [
205,
205,
205,
205
],
"text": [
"irreducible elements",
"irreducible elements",
"irreducible elements",
"irreducible elements"
]
} | What is another general concept that applies to elements of commutative rings? | [
0.1672203689813614,
0.27745744585990906,
0.1722215712070465,
-0.19805245101451874,
0.03151269257068634,
0.01832929439842701,
0.10874679684638977,
-0.3161446452140808,
-0.046654824167490005,
0.3176353871822357,
-0.4156073331832886,
0.2075197696685791,
-0.5389273166656494,
0.0653865039348602... | The Flushing Remonstrance shows support for separation of church and state as early as the mid-17th century, stating their opposition to religious persecution of any sort: "The law of love, peace and liberty in the states extending to Jews, Turks and Egyptians, as they are considered sons of Adam, which is the glory of... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | In particular, this norm gets smaller when a number is multiplied by p, in sharp contrast to the usual absolute value (also referred to as the infinite prime). While completing Q (roughly, filling the gaps) with respect to the absolute value yields the field of real numbers, completing with respect to the p-adic norm |... | irreducible elements | 96,707 |
57299c2c6aef051400155023 | Prime_number | Prime numbers give rise to two more general concepts that apply to elements of any commutative ring R, an algebraic structure where addition, subtraction and multiplication are defined: prime elements and irreducible elements. An element p of R is called prime element if it is neither zero nor a unit (i.e., does not ha... | What is one condition that an element p of R must satisfy in order to be considered a prime element? | {
"answer_start": [
272,
278,
272,
272
],
"text": [
"it is neither zero nor a unit",
"neither zero nor a unit",
"it is neither zero nor a unit",
"it is neither zero nor a unit"
]
} | What is [MASK] condition that an element p of R must satisfy in order to be considered a prime element? | [
0.2247331589460373,
0.33767467737197876,
0.08386584371328354,
-0.002416016533970833,
0.282262921333313,
0.04256698861718178,
0.2270824909210205,
-0.5855117440223694,
-0.05103447288274765,
0.5888912081718445,
-0.388874351978302,
0.39023181796073914,
-0.36962491273880005,
0.08584963530302048... | Luther spoke out against the Jews in Saxony, Brandenburg, and Silesia. Josel of Rosheim, the Jewish spokesman who tried to help the Jews of Saxony in 1537, later blamed their plight on "that priest whose name was Martin Luther—may his body and soul be bound up in hell!—who wrote and issued many heretical books in which... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | Giuga's conjecture says that this equation is also a sufficient condition for p to be prime. Another consequence of Fermat's little theorem is the following: if p is a prime number other than 2 and 5, 1/p is always a recurring decimal, whose period is p − 1 or a divisor of p − 1. The fraction 1/p expressed likewise in ... | it is neither zero nor a unit | 96,708 |
57299c2c6aef051400155024 | Prime_number | Prime numbers give rise to two more general concepts that apply to elements of any commutative ring R, an algebraic structure where addition, subtraction and multiplication are defined: prime elements and irreducible elements. An element p of R is called prime element if it is neither zero nor a unit (i.e., does not ha... | Under what condition is an element irreducible? | {
"answer_start": [
518,
503,
497,
497
],
"text": [
"cannot be written as a product of two ring elements that are not units",
"not a unit and cannot be written as a product of two ring elements that are not units.",
"it is not a unit and cannot be written as a product of two ring eleme... | Under what condition is an element irreducible? | [
-0.24694590270519257,
0.2551089823246002,
-0.14085912704467773,
-0.2130001336336136,
-0.3488675057888031,
0.11326871812343597,
0.5024011731147766,
-0.3745671212673187,
0.17752699553966522,
-0.13508369028568268,
-0.13848231732845306,
0.3134303390979767,
-0.23921187222003937,
0.1517297774553... | The unlicensed clone market has flourished following Nintendo's discontinuation of the NES. Some of the more exotic of these resulting systems have gone beyond the functionality of the original hardware and have included variations such as a portable system with a color LCD (e.g. PocketFami). Others have been produced ... | The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prim... | In the example above, the identity and the rotations constitute a subgroup R = {id, r1, r2, r3}, highlighted in red in the group table above: any two rotations composed are still a rotation, and a rotation can be undone by (i.e. is inverse to) the complementary rotations 270° for 90°, 180° for 180°, and 90° for 270° (n... | cannot be written as a product of two ring elements that are not units | 96,709 |
57299d1c1d04691400779581 | Prime_number | The fundamental theorem of arithmetic continues to hold in unique factorization domains. An example of such a domain is the Gaussian integers Z[i], that is, the set of complex numbers of the form a + bi where i denotes the imaginary unit and a and b are arbitrary integers. Its prime elements are known as Gaussian prime... | What theorem remains valid in unique factorization domains? | {
"answer_start": [
0,
16,
4,
0
],
"text": [
"The fundamental theorem of arithmetic",
"theorem of arithmetic",
"fundamental theorem of arithmetic",
"The fundamental theorem of arithmetic"
]
} | What theorem remains valid in unique factorization domains? | [
-0.07329500466585159,
0.026340460404753685,
0.3328889012336731,
0.12679915130138397,
0.13343445956707,
-0.05055318772792816,
-0.0997982993721962,
-0.23005259037017822,
-0.0640857145190239,
0.004277237690985203,
-0.4092341363430023,
0.07169541716575623,
-0.4229781925678253,
0.31144091486930... | With the emergence of ISIL and its capture of large areas of Iraq and Syria, a number of crises resulted that sparked international attention. ISIL had perpetrated sectarian killings and war crimes in both Iraq and Syria. Gains made in the Iraq war were rolled back as Iraqi army units abandoned their posts. Cities were... | Mathematicians often strive for a complete classification (or list) of a mathematical notion. In the context of finite groups, this aim leads to difficult mathematics. According to Lagrange's theorem, finite groups of order p, a prime number, are necessarily cyclic (abelian) groups Zp. Groups of order p2 can also be sh... | Similarly, it is not known if L (the set of all problems that can be solved in logarithmic space) is strictly contained in P or equal to P. Again, there are many complexity classes between the two, such as NL and NC, and it is not known if they are distinct or equal classes. | The fundamental theorem of arithmetic | 96,710 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.