<article>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#article09_10_15_154227</id>
	<title>12M Digit Prime Number Sets Record, Nets $100,000</title>
	<author>CmdrTaco</author>
	<datestamp>1255621380000</datestamp>
	<htmltext>coondoggie writes <i>"A <a href="http://www.networkworld.com/community/node/46184">12-million-digit prime number</a>, the largest such number ever discovered, has landed a voluntary math research group a $100,000 prize from the Electronic Frontier Foundation (EFF). The number, known as a Mersenne prime, is the 45th known Mersenne prime, written shorthand as 2 to the power of 43,112,609, minus 1 . A Mersenne number is a positive integer that is one less than a power of two, the group stated.   The computing project called the Great Internet Mersenne Prime Search (GIMPS) made the discovery on a computer at the University of California, Los Angeles (UCLA) Mathematics Department."</i></htmltext>
<tokenext>coondoggie writes " A 12-million-digit prime number , the largest such number ever discovered , has landed a voluntary math research group a $ 100,000 prize from the Electronic Frontier Foundation ( EFF ) .
The number , known as a Mersenne prime , is the 45th known Mersenne prime , written shorthand as 2 to the power of 43,112,609 , minus 1 .
A Mersenne number is a positive integer that is one less than a power of two , the group stated .
The computing project called the Great Internet Mersenne Prime Search ( GIMPS ) made the discovery on a computer at the University of California , Los Angeles ( UCLA ) Mathematics Department .
"</tokentext>
<sentencetext>coondoggie writes "A 12-million-digit prime number, the largest such number ever discovered, has landed a voluntary math research group a $100,000 prize from the Electronic Frontier Foundation (EFF).
The number, known as a Mersenne prime, is the 45th known Mersenne prime, written shorthand as 2 to the power of 43,112,609, minus 1 .
A Mersenne number is a positive integer that is one less than a power of two, the group stated.
The computing project called the Great Internet Mersenne Prime Search (GIMPS) made the discovery on a computer at the University of California, Los Angeles (UCLA) Mathematics Department.
"</sentencetext>
</article>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759597</id>
	<title>Amazing coincidence</title>
	<author>noidentity</author>
	<datestamp>1255631280000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><blockquote><div><p>The number, known as a Mersenne prime, is the 45th known Mersenne prime, written shorthand as 2 to the power of 43,112,609, minus 1</p></div></blockquote><p>That's amazing. I've got the same combination on my luggage!</p></div>
	</htmltext>
<tokenext>The number , known as a Mersenne prime , is the 45th known Mersenne prime , written shorthand as 2 to the power of 43,112,609 , minus 1That 's amazing .
I 've got the same combination on my luggage !</tokentext>
<sentencetext>The number, known as a Mersenne prime, is the 45th known Mersenne prime, written shorthand as 2 to the power of 43,112,609, minus 1That's amazing.
I've got the same combination on my luggage!
	</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225</id>
	<title>so?</title>
	<author>Anonymous</author>
	<datestamp>1255625220000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>What can you do with big primes?  Why the fascination?</p><p>I've heard the "Oh, it's useful in crypto" answer, but never WHY it's useful in crypto.</p></htmltext>
<tokenext>What can you do with big primes ?
Why the fascination ? I 've heard the " Oh , it 's useful in crypto " answer , but never WHY it 's useful in crypto .</tokentext>
<sentencetext>What can you do with big primes?
Why the fascination?I've heard the "Oh, it's useful in crypto" answer, but never WHY it's useful in crypto.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760031</id>
	<title>WHO CARES???</title>
	<author>Anonymous</author>
	<datestamp>1255633080000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Honestly, what practical application does a 12 million digit number server.</p></htmltext>
<tokenext>Honestly , what practical application does a 12 million digit number server .</tokentext>
<sentencetext>Honestly, what practical application does a 12 million digit number server.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761221</id>
	<title>Re:Actually the 47th</title>
	<author>COMON$</author>
	<datestamp>1255638720000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>There are many many many applications for a large prime...stronger encryption being just one.  Google is your friend.</htmltext>
<tokenext>There are many many many applications for a large prime...stronger encryption being just one .
Google is your friend .</tokentext>
<sentencetext>There are many many many applications for a large prime...stronger encryption being just one.
Google is your friend.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760447</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</id>
	<title>Sounds cool, but...</title>
	<author>Anonymous</author>
	<datestamp>1255625340000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>2</modscore>
	<htmltext><p>Call me a n00b, but I'm unsure there are any ways to use this newfound information about prime numbers.</p><p>Next time good ol' (2^43,112,609 - 1) comes up in conversation, I'll make sure to impress everyone with my new knowledge, but other than that, I feel no smarter for having read this article.</p></htmltext>
<tokenext>Call me a n00b , but I 'm unsure there are any ways to use this newfound information about prime numbers.Next time good ol ' ( 2 ^ 43,112,609 - 1 ) comes up in conversation , I 'll make sure to impress everyone with my new knowledge , but other than that , I feel no smarter for having read this article .</tokentext>
<sentencetext>Call me a n00b, but I'm unsure there are any ways to use this newfound information about prime numbers.Next time good ol' (2^43,112,609 - 1) comes up in conversation, I'll make sure to impress everyone with my new knowledge, but other than that, I feel no smarter for having read this article.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758503</id>
	<title>Re:Sounds cool, but...</title>
	<author>Anonymous</author>
	<datestamp>1255626360000</datestamp>
	<modclass>Funny</modclass>
	<modscore>2</modscore>
	<htmltext><p><div class="quote"><p>Call me a n00b, but I'm unsure there are any ways to use this newfound information about prime numbers.</p><p>Next time good ol' (2^43,112,609 - 1) comes up in conversation, I'll make sure to impress everyone with my new knowledge, but other than that, I feel no smarter for having read this article.</p></div><p>You think you feel bad?  Talk to the guy who just signed that $100,000 check for this...</p></div>
	</htmltext>
<tokenext>Call me a n00b , but I 'm unsure there are any ways to use this newfound information about prime numbers.Next time good ol ' ( 2 ^ 43,112,609 - 1 ) comes up in conversation , I 'll make sure to impress everyone with my new knowledge , but other than that , I feel no smarter for having read this article.You think you feel bad ?
Talk to the guy who just signed that $ 100,000 check for this.. .</tokentext>
<sentencetext>Call me a n00b, but I'm unsure there are any ways to use this newfound information about prime numbers.Next time good ol' (2^43,112,609 - 1) comes up in conversation, I'll make sure to impress everyone with my new knowledge, but other than that, I feel no smarter for having read this article.You think you feel bad?
Talk to the guy who just signed that $100,000 check for this...
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760263</id>
	<title>Re:Sounds cool, but...</title>
	<author>Anonymous</author>
	<datestamp>1255633980000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Isn't knowledge for knowledge's sake good enough? As prime numbers have a concrete and useful application in various forms of cryptography, I don't see why you are acting apathetic about this.</p></htmltext>
<tokenext>Is n't knowledge for knowledge 's sake good enough ?
As prime numbers have a concrete and useful application in various forms of cryptography , I do n't see why you are acting apathetic about this .</tokentext>
<sentencetext>Isn't knowledge for knowledge's sake good enough?
As prime numbers have a concrete and useful application in various forms of cryptography, I don't see why you are acting apathetic about this.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758243</id>
	<title>waste of money</title>
	<author>Anonymous</author>
	<datestamp>1255625280000</datestamp>
	<modclass>Troll</modclass>
	<modscore>-1</modscore>
	<htmltext><p>isn't there anyone out there doing useful research we could fund with this money?</p></htmltext>
<tokenext>is n't there anyone out there doing useful research we could fund with this money ?</tokentext>
<sentencetext>isn't there anyone out there doing useful research we could fund with this money?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760685</id>
	<title>Re:Actually the 47th</title>
	<author>Anonymous</author>
	<datestamp>1255636020000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>what I'd pay for an abacus that could solve that problem...</p></htmltext>
<tokenext>what I 'd pay for an abacus that could solve that problem.. .</tokentext>
<sentencetext>what I'd pay for an abacus that could solve that problem...</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758643</id>
	<title>Mersenne Primes Link</title>
	<author>KiwiCanuck</author>
	<datestamp>1255627020000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>2</modscore>
	<htmltext><a href="http://primes.utm.edu/mersenne/" title="utm.edu" rel="nofollow">http://primes.utm.edu/mersenne/</a> [utm.edu]</htmltext>
<tokenext>http : //primes.utm.edu/mersenne/ [ utm.edu ]</tokentext>
<sentencetext>http://primes.utm.edu/mersenne/ [utm.edu]</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758355</id>
	<title>Re:so?</title>
	<author>Anonymous</author>
	<datestamp>1255625760000</datestamp>
	<modclass>Flamebait</modclass>
	<modscore>0</modscore>
	<htmltext><p>What can you do with plutonium? I mean, I've heard, oh it's useful in nuclear bombs, but never WHY it's useful in nuclear bombs.</p><p>You haven't heard why because <i>you're not a fucking cryptoanalyst. </i></p><p>Now, if you really want a primer on primes and cryptography <a href="http://en.wikipedia.org/wiki/RSA" title="wikipedia.org" rel="nofollow">http://en.wikipedia.org/wiki/RSA</a> [wikipedia.org] is a good place to start. But anyone with a CS degree at least should understand the basics of why big primes make good private keys</p></htmltext>
<tokenext>What can you do with plutonium ?
I mean , I 've heard , oh it 's useful in nuclear bombs , but never WHY it 's useful in nuclear bombs.You have n't heard why because you 're not a fucking cryptoanalyst .
Now , if you really want a primer on primes and cryptography http : //en.wikipedia.org/wiki/RSA [ wikipedia.org ] is a good place to start .
But anyone with a CS degree at least should understand the basics of why big primes make good private keys</tokentext>
<sentencetext>What can you do with plutonium?
I mean, I've heard, oh it's useful in nuclear bombs, but never WHY it's useful in nuclear bombs.You haven't heard why because you're not a fucking cryptoanalyst.
Now, if you really want a primer on primes and cryptography http://en.wikipedia.org/wiki/RSA [wikipedia.org] is a good place to start.
But anyone with a CS degree at least should understand the basics of why big primes make good private keys</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758827</id>
	<title>Re:Sounds cool, but...</title>
	<author>Anonymous</author>
	<datestamp>1255627800000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>1</modscore>
	<htmltext><p>http://primes.utm.edu/notes/faq/why.html</p><p>"Why?" we are often asked, "why would anyone want to find a prime that big?""  I often now answer with "did you ever collect anything?"" or "did you ever try to win a competition?"" Much of the answer for why we collect large primes is the same as why we might collect other rare items. Below I will present a more complete answer divided into several parts.</p><p>Tradition!<br>For the by-products of the quest<br>People collect rare and beautiful items<br>For the glory!<br>To test the hardware<br>To learn more about their distribution<br>For the money?<br>This does not exhaust the list of reasons, for example some might be motivated by primary research or a need for publication. Many others just hate to see a good machine wasting cycles (sitting idle or running an inane screen saver).<br>Perhaps these arguments will not convince you.  If not, just recall that the eye may not see what the ear hears, but that does not reduce the value of sound.  There are always melodies beyond our grasp. (*)</p><p>1. Tradition!</p><p>Euclid may have been the first to define primality in his Elements approximately 300 BC. His goal was to characterize the even perfect numbers (numbers like 6 and 28 which are equal to the sum of their aliquot divisors: 6 = 1+2+3, 28=1+2+4+7+14). He realized that the even perfect numbers (no odd perfect numbers are known) are all closely related to the primes of the form 2p-1 for some prime p (now called Mersennes). So the quest for these jewels began near 300 BC.<br>Large primes (especially of this form) were then studied (in chronological order) by Cataldi, Descartes, Fermat, Mersenne, Frenicle, Leibniz, Euler, Landry, Lucas, Catalan, Sylvester, Cunningham, Pepin, Putnam and Lehmer (to name a few).  How can we resist joining such an illustrious group?</p><p>Much of elementary number theory was developed while deciding how to handle large numbers, how to characterize their factors and discover those which are prime.  (Look, for example, at the concepts required to develop simple proofs such as [1] or [2].) In short, the tradition of seeking large primes (especially the Mersennes) has been long and fruitful It is a tradition well worth continuing.</p><p>2. For the by-products of the quest</p><p>Being the first to put a man on the moon had great political value for the United States of America, but what was perhaps of the most lasting value to the society was the by-products of the race.  By-products such as the new technologies and materials that were developed for the race that are now common everyday items, and the improvements to education's infrastructure that led many man and women into productive lives as scientists and engineers.<br>The same is true for the quest for record primes.  In the tradition section above I listed some of the giants who were in the search (such as Euclid, Euler and Fermat).  They left in their wake some of the greatest theorems of elementary number theory (such as Fermat''s little theorem and quadratic reciprocity).</p><p>More recently, the search has demanded new and faster ways of multiplying large integers.  In 1968 Strassen discovered how to multiply quickly using Fast Fourier Transforms. He and Sch&#246;nhage refined and published the method in 1971. GIMPS now uses an improved version of their algorithm developed by the long time Mersenne searcher Richard Crandall [see CF94].</p><p>The Mersenne search is also used by school teachers to involve their students in mathematical research, and perhaps to excite them into careers in science or engineering. And these are just a few of the by-products of the search.</p><p>3. People collect rare and beautiful items</p><p>Mersenne primes, which are usually the largest known primes, are both rare and beautiful.  Since Euclid initiated the search for and study of Mersennes approximately 300 BC, very few have been found.  Less than fifty in all of human history--that is rare!<br>But they are also beautiful.  Mathematics, like all fields of study, has a definite notion of beauty.  What qual</p></htmltext>
<tokenext>http : //primes.utm.edu/notes/faq/why.html " Why ?
" we are often asked , " why would anyone want to find a prime that big ?
" " I often now answer with " did you ever collect anything ?
" " or " did you ever try to win a competition ?
" " Much of the answer for why we collect large primes is the same as why we might collect other rare items .
Below I will present a more complete answer divided into several parts.Tradition ! For the by-products of the questPeople collect rare and beautiful itemsFor the glory ! To test the hardwareTo learn more about their distributionFor the money ? This does not exhaust the list of reasons , for example some might be motivated by primary research or a need for publication .
Many others just hate to see a good machine wasting cycles ( sitting idle or running an inane screen saver ) .Perhaps these arguments will not convince you .
If not , just recall that the eye may not see what the ear hears , but that does not reduce the value of sound .
There are always melodies beyond our grasp .
( * ) 1. Tradition ! Euclid may have been the first to define primality in his Elements approximately 300 BC .
His goal was to characterize the even perfect numbers ( numbers like 6 and 28 which are equal to the sum of their aliquot divisors : 6 = 1 + 2 + 3 , 28 = 1 + 2 + 4 + 7 + 14 ) .
He realized that the even perfect numbers ( no odd perfect numbers are known ) are all closely related to the primes of the form 2p-1 for some prime p ( now called Mersennes ) .
So the quest for these jewels began near 300 BC.Large primes ( especially of this form ) were then studied ( in chronological order ) by Cataldi , Descartes , Fermat , Mersenne , Frenicle , Leibniz , Euler , Landry , Lucas , Catalan , Sylvester , Cunningham , Pepin , Putnam and Lehmer ( to name a few ) .
How can we resist joining such an illustrious group ? Much of elementary number theory was developed while deciding how to handle large numbers , how to characterize their factors and discover those which are prime .
( Look , for example , at the concepts required to develop simple proofs such as [ 1 ] or [ 2 ] .
) In short , the tradition of seeking large primes ( especially the Mersennes ) has been long and fruitful It is a tradition well worth continuing.2 .
For the by-products of the questBeing the first to put a man on the moon had great political value for the United States of America , but what was perhaps of the most lasting value to the society was the by-products of the race .
By-products such as the new technologies and materials that were developed for the race that are now common everyday items , and the improvements to education 's infrastructure that led many man and women into productive lives as scientists and engineers.The same is true for the quest for record primes .
In the tradition section above I listed some of the giants who were in the search ( such as Euclid , Euler and Fermat ) .
They left in their wake some of the greatest theorems of elementary number theory ( such as Fermat ' 's little theorem and quadratic reciprocity ) .More recently , the search has demanded new and faster ways of multiplying large integers .
In 1968 Strassen discovered how to multiply quickly using Fast Fourier Transforms .
He and Sch   nhage refined and published the method in 1971 .
GIMPS now uses an improved version of their algorithm developed by the long time Mersenne searcher Richard Crandall [ see CF94 ] .The Mersenne search is also used by school teachers to involve their students in mathematical research , and perhaps to excite them into careers in science or engineering .
And these are just a few of the by-products of the search.3 .
People collect rare and beautiful itemsMersenne primes , which are usually the largest known primes , are both rare and beautiful .
Since Euclid initiated the search for and study of Mersennes approximately 300 BC , very few have been found .
Less than fifty in all of human history--that is rare ! But they are also beautiful .
Mathematics , like all fields of study , has a definite notion of beauty .
What qual</tokentext>
<sentencetext>http://primes.utm.edu/notes/faq/why.html"Why?
" we are often asked, "why would anyone want to find a prime that big?
""  I often now answer with "did you ever collect anything?
"" or "did you ever try to win a competition?
"" Much of the answer for why we collect large primes is the same as why we might collect other rare items.
Below I will present a more complete answer divided into several parts.Tradition!For the by-products of the questPeople collect rare and beautiful itemsFor the glory!To test the hardwareTo learn more about their distributionFor the money?This does not exhaust the list of reasons, for example some might be motivated by primary research or a need for publication.
Many others just hate to see a good machine wasting cycles (sitting idle or running an inane screen saver).Perhaps these arguments will not convince you.
If not, just recall that the eye may not see what the ear hears, but that does not reduce the value of sound.
There are always melodies beyond our grasp.
(*)1. Tradition!Euclid may have been the first to define primality in his Elements approximately 300 BC.
His goal was to characterize the even perfect numbers (numbers like 6 and 28 which are equal to the sum of their aliquot divisors: 6 = 1+2+3, 28=1+2+4+7+14).
He realized that the even perfect numbers (no odd perfect numbers are known) are all closely related to the primes of the form 2p-1 for some prime p (now called Mersennes).
So the quest for these jewels began near 300 BC.Large primes (especially of this form) were then studied (in chronological order) by Cataldi, Descartes, Fermat, Mersenne, Frenicle, Leibniz, Euler, Landry, Lucas, Catalan, Sylvester, Cunningham, Pepin, Putnam and Lehmer (to name a few).
How can we resist joining such an illustrious group?Much of elementary number theory was developed while deciding how to handle large numbers, how to characterize their factors and discover those which are prime.
(Look, for example, at the concepts required to develop simple proofs such as [1] or [2].
) In short, the tradition of seeking large primes (especially the Mersennes) has been long and fruitful It is a tradition well worth continuing.2.
For the by-products of the questBeing the first to put a man on the moon had great political value for the United States of America, but what was perhaps of the most lasting value to the society was the by-products of the race.
By-products such as the new technologies and materials that were developed for the race that are now common everyday items, and the improvements to education's infrastructure that led many man and women into productive lives as scientists and engineers.The same is true for the quest for record primes.
In the tradition section above I listed some of the giants who were in the search (such as Euclid, Euler and Fermat).
They left in their wake some of the greatest theorems of elementary number theory (such as Fermat''s little theorem and quadratic reciprocity).More recently, the search has demanded new and faster ways of multiplying large integers.
In 1968 Strassen discovered how to multiply quickly using Fast Fourier Transforms.
He and Schönhage refined and published the method in 1971.
GIMPS now uses an improved version of their algorithm developed by the long time Mersenne searcher Richard Crandall [see CF94].The Mersenne search is also used by school teachers to involve their students in mathematical research, and perhaps to excite them into careers in science or engineering.
And these are just a few of the by-products of the search.3.
People collect rare and beautiful itemsMersenne primes, which are usually the largest known primes, are both rare and beautiful.
Since Euclid initiated the search for and study of Mersennes approximately 300 BC, very few have been found.
Less than fifty in all of human history--that is rare!But they are also beautiful.
Mathematics, like all fields of study, has a definite notion of beauty.
What qual</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759023</id>
	<title>I'm pissed!</title>
	<author>UnknowingFool</author>
	<datestamp>1255628700000</datestamp>
	<modclass>Funny</modclass>
	<modscore>3</modscore>
	<htmltext>Now that everyone knows this number, I have to change my luggage combination again.  Thanks for nothing EFF!</htmltext>
<tokenext>Now that everyone knows this number , I have to change my luggage combination again .
Thanks for nothing EFF !</tokentext>
<sentencetext>Now that everyone knows this number, I have to change my luggage combination again.
Thanks for nothing EFF!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759847</id>
	<title>Mersenne number</title>
	<author>Anonymous</author>
	<datestamp>1255632300000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>1</modscore>
	<htmltext><p><i>A Mersenne number is a positive integer that is one less than a power of two, <b>the group stated.</b> </i></p><p>Yeah, well, you know, that's just, like, their opinion, man.</p></htmltext>
<tokenext>A Mersenne number is a positive integer that is one less than a power of two , the group stated .
Yeah , well , you know , that 's just , like , their opinion , man .</tokentext>
<sentencetext>A Mersenne number is a positive integer that is one less than a power of two, the group stated.
Yeah, well, you know, that's just, like, their opinion, man.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29765585</id>
	<title>Re:Thank goodness it's voluntary</title>
	<author>Anonymous</author>
	<datestamp>1255624500000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p><div class="quote"><blockquote><div><p> I'm trying to imagine an "involuntary" math research group, </p></div> </blockquote></div><p>I believe there's one in every major high school on the continent (with a few exceptions, of course).</p></div>
	</htmltext>
<tokenext>I 'm trying to imagine an " involuntary " math research group , I believe there 's one in every major high school on the continent ( with a few exceptions , of course ) .</tokentext>
<sentencetext> I'm trying to imagine an "involuntary" math research group,  I believe there's one in every major high school on the continent (with a few exceptions, of course).
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759887</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759211</id>
	<title>Re:so?</title>
	<author>cez</author>
	<datestamp>1255629480000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>duh... to win $100,000 of course!</htmltext>
<tokenext>duh... to win $ 100,000 of course !</tokentext>
<sentencetext>duh... to win $100,000 of course!</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758557</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193</id>
	<title>Actually the 47th</title>
	<author>Anonymous</author>
	<datestamp>1255625100000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>4</modscore>
	<htmltext><p><div class="quote"><p>The number known as a Mersenne prime, is the 45th known Mersenne prime, written shorthand as 2 to the power of 43,112,609, minus 1</p></div><p>Wikipedia <a href="http://en.wikipedia.org/wiki/Mersenne\_prime#List\_of\_known\_Mersenne\_primes" title="wikipedia.org">lists it as</a> [wikipedia.org] the 47th known prime.</p></div>
	</htmltext>
<tokenext>The number known as a Mersenne prime , is the 45th known Mersenne prime , written shorthand as 2 to the power of 43,112,609 , minus 1Wikipedia lists it as [ wikipedia.org ] the 47th known prime .</tokentext>
<sentencetext>The number known as a Mersenne prime, is the 45th known Mersenne prime, written shorthand as 2 to the power of 43,112,609, minus 1Wikipedia lists it as [wikipedia.org] the 47th known prime.
	</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758853</id>
	<title>Re:I haven't tested this thoroughly, but...</title>
	<author>Anonymous</author>
	<datestamp>1255627860000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Why go to all that trouble when you can just take all known primes, multiply them by each other, then add 1? Repeat as necessary until you achieve the desired size BFPN (Big Fricking Prime Number).</p></htmltext>
<tokenext>Why go to all that trouble when you can just take all known primes , multiply them by each other , then add 1 ?
Repeat as necessary until you achieve the desired size BFPN ( Big Fricking Prime Number ) .</tokentext>
<sentencetext>Why go to all that trouble when you can just take all known primes, multiply them by each other, then add 1?
Repeat as necessary until you achieve the desired size BFPN (Big Fricking Prime Number).</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761005</id>
	<title>Re:So what is it?</title>
	<author>AP31R0N</author>
	<datestamp>1255637520000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>i was.</p><p>Yeah, that would be h00t.  Lemme see what happens to IE....</p><p>170MB.  Wow.</p></htmltext>
<tokenext>i was.Yeah , that would be h00t .
Lem me see what happens to IE....170MB .
Wow .</tokentext>
<sentencetext>i was.Yeah, that would be h00t.
Lemme see what happens to IE....170MB.
Wow.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759689</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759033</id>
	<title>45th in order of discovery</title>
	<author>Noren</author>
	<datestamp>1255628700000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>3</modscore>
	<htmltext>The article is correct by order of discovery- it was the 45th Mersenne prime to be discovered (on August 23, 2008.)  Two smaller Mersenne primes were discovered later, on September 6, 2008 and April 12, 2009, which are also included in the Wikipedia table.</htmltext>
<tokenext>The article is correct by order of discovery- it was the 45th Mersenne prime to be discovered ( on August 23 , 2008 .
) Two smaller Mersenne primes were discovered later , on September 6 , 2008 and April 12 , 2009 , which are also included in the Wikipedia table .</tokentext>
<sentencetext>The article is correct by order of discovery- it was the 45th Mersenne prime to be discovered (on August 23, 2008.
)  Two smaller Mersenne primes were discovered later, on September 6, 2008 and April 12, 2009, which are also included in the Wikipedia table.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29764255</id>
	<title>Re:I haven't tested this thoroughly, but...</title>
	<author>harry666t</author>
	<datestamp>1255610580000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Just test it out already!</p><p>$ python<br>&gt;&gt;&gt; from commands import getouput as sh<br>&gt;&gt;&gt; # i'm too lazy to write my own prime test function:<br>&gt;&gt;&gt; def is\_prime(n): return not bool(sh("factor \%d" \% n).split()[2:])<br>&gt;&gt;&gt; # check a few integers to make sure it works:<br>&gt;&gt;&gt; zip(xrange(10), map(is\_prime, xrange(10)))<br>&gt;&gt;&gt; maybe\_primes = [(((i*10)+4)**2)+1 for i in xrange(20)]<br>&gt;&gt;&gt; zip(maybe\_primes, map(is\_prime, maybe\_primes))</p><p>That's what we have computers for.</p></htmltext>
<tokenext>Just test it out already ! $ python &gt; &gt; &gt; from commands import getouput as sh &gt; &gt; &gt; # i 'm too lazy to write my own prime test function : &gt; &gt; &gt; def is \ _prime ( n ) : return not bool ( sh ( " factor \ % d " \ % n ) .split ( ) [ 2 : ] ) &gt; &gt; &gt; # check a few integers to make sure it works : &gt; &gt; &gt; zip ( xrange ( 10 ) , map ( is \ _prime , xrange ( 10 ) ) ) &gt; &gt; &gt; maybe \ _primes = [ ( ( ( i * 10 ) + 4 ) * * 2 ) + 1 for i in xrange ( 20 ) ] &gt; &gt; &gt; zip ( maybe \ _primes , map ( is \ _prime , maybe \ _primes ) ) That 's what we have computers for .</tokentext>
<sentencetext>Just test it out already!$ python&gt;&gt;&gt; from commands import getouput as sh&gt;&gt;&gt; # i'm too lazy to write my own prime test function:&gt;&gt;&gt; def is\_prime(n): return not bool(sh("factor \%d" \% n).split()[2:])&gt;&gt;&gt; # check a few integers to make sure it works:&gt;&gt;&gt; zip(xrange(10), map(is\_prime, xrange(10)))&gt;&gt;&gt; maybe\_primes = [(((i*10)+4)**2)+1 for i in xrange(20)]&gt;&gt;&gt; zip(maybe\_primes, map(is\_prime, maybe\_primes))That's what we have computers for.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758941</id>
	<title>Re:A Question</title>
	<author>Locke2005</author>
	<datestamp>1255628340000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>What is it about going to the Moon that makes it worth spending $20 billion? Advances in pure mathematics aren't done for immediate benefit, they are done on the off chance that the new "discovery" might be useful some day, like non-Euclidean geometry. In this case, it was more of an incentive to develop the algorithms and computing power necessary to deal effectively with the problem space. Hopefully this provided insights into how other large, intractable problems may be solved.</htmltext>
<tokenext>What is it about going to the Moon that makes it worth spending $ 20 billion ?
Advances in pure mathematics are n't done for immediate benefit , they are done on the off chance that the new " discovery " might be useful some day , like non-Euclidean geometry .
In this case , it was more of an incentive to develop the algorithms and computing power necessary to deal effectively with the problem space .
Hopefully this provided insights into how other large , intractable problems may be solved .</tokentext>
<sentencetext>What is it about going to the Moon that makes it worth spending $20 billion?
Advances in pure mathematics aren't done for immediate benefit, they are done on the off chance that the new "discovery" might be useful some day, like non-Euclidean geometry.
In this case, it was more of an incentive to develop the algorithms and computing power necessary to deal effectively with the problem space.
Hopefully this provided insights into how other large, intractable problems may be solved.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758661</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29768171</id>
	<title>Re:45th in order of discovery or just RTFWikipedia</title>
	<author>dezent</author>
	<datestamp>1255705500000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>If you read the wikipedia article..

"It is not known whether any undiscovered Mersenne primes exist between the 39th (M13,466,917) and the 47th (M43,112,609) on this chart; the ranking is therefore provisional. Primes have also not been discovered in increasing order. For example, the 29th Mersenne prime was discovered after the 30th and the 31st. Similarly, the current record holder was followed by 2 smaller Mersenne primes, first 2 weeks later and then 8 months later."</htmltext>
<tokenext>If you read the wikipedia article. . " It is not known whether any undiscovered Mersenne primes exist between the 39th ( M13,466,917 ) and the 47th ( M43,112,609 ) on this chart ; the ranking is therefore provisional .
Primes have also not been discovered in increasing order .
For example , the 29th Mersenne prime was discovered after the 30th and the 31st .
Similarly , the current record holder was followed by 2 smaller Mersenne primes , first 2 weeks later and then 8 months later .
"</tokentext>
<sentencetext>If you read the wikipedia article..

"It is not known whether any undiscovered Mersenne primes exist between the 39th (M13,466,917) and the 47th (M43,112,609) on this chart; the ranking is therefore provisional.
Primes have also not been discovered in increasing order.
For example, the 29th Mersenne prime was discovered after the 30th and the 31st.
Similarly, the current record holder was followed by 2 smaller Mersenne primes, first 2 weeks later and then 8 months later.
"</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759033</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758745</id>
	<title>Re:I haven't tested this thoroughly, but...</title>
	<author>Anonymous</author>
	<datestamp>1255627440000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext>I have read many crazy ways people find primes. I must admit, the one you suggested is the craziest i have come across.</htmltext>
<tokenext>I have read many crazy ways people find primes .
I must admit , the one you suggested is the craziest i have come across .</tokentext>
<sentencetext>I have read many crazy ways people find primes.
I must admit, the one you suggested is the craziest i have come across.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761591</id>
	<title>Re:Sounds cool, but...</title>
	<author>Anonymous</author>
	<datestamp>1255597380000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>I agree; this is dubious piece of research. After all, of what value (if any) is this discovery of a new inconceivably large prime compared to the previous discovery of a large prime...</p><p>(I'm sure there was some reasonably clever software programming behind the search algorithum).</p></htmltext>
<tokenext>I agree ; this is dubious piece of research .
After all , of what value ( if any ) is this discovery of a new inconceivably large prime compared to the previous discovery of a large prime... ( I 'm sure there was some reasonably clever software programming behind the search algorithum ) .</tokentext>
<sentencetext>I agree; this is dubious piece of research.
After all, of what value (if any) is this discovery of a new inconceivably large prime compared to the previous discovery of a large prime...(I'm sure there was some reasonably clever software programming behind the search algorithum).</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759195</id>
	<title>Re:so?</title>
	<author>Anonymous</author>
	<datestamp>1255629420000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>What use is a newborn child?</p></htmltext>
<tokenext>What use is a newborn child ?</tokentext>
<sentencetext>What use is a newborn child?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758557</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760447</id>
	<title>Re:Actually the 47th</title>
	<author>AmberBlackCat</author>
	<datestamp>1255634700000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>What are these numbers good for? Is there a reason, other than the love of math, that a non-profit which accepts donations would pay $100,000 for this?</htmltext>
<tokenext>What are these numbers good for ?
Is there a reason , other than the love of math , that a non-profit which accepts donations would pay $ 100,000 for this ?</tokentext>
<sentencetext>What are these numbers good for?
Is there a reason, other than the love of math, that a non-profit which accepts donations would pay $100,000 for this?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758825</id>
	<title>Re:Man, oh, man...</title>
	<author>sconeu</author>
	<datestamp>1255627800000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Damn you Tommy Tutone!</p></htmltext>
<tokenext>Damn you Tommy Tutone !</tokentext>
<sentencetext>Damn you Tommy Tutone!</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759021</id>
	<title>Re:Actually the 47th</title>
	<author>Anonymous</author>
	<datestamp>1255628700000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>1</modscore>
	<htmltext><p>It's the 47th by size; 45th by order of discovery.  Two smaller Mersenne primes were discovered after the current record-holder.  One was discovered within a couple of days of the discovery of the prize-winner-- and it was, itself, large enough to claim the EFF prize ($100k for 10M digits).</p></htmltext>
<tokenext>It 's the 47th by size ; 45th by order of discovery .
Two smaller Mersenne primes were discovered after the current record-holder .
One was discovered within a couple of days of the discovery of the prize-winner-- and it was , itself , large enough to claim the EFF prize ( $ 100k for 10M digits ) .</tokentext>
<sentencetext>It's the 47th by size; 45th by order of discovery.
Two smaller Mersenne primes were discovered after the current record-holder.
One was discovered within a couple of days of the discovery of the prize-winner-- and it was, itself, large enough to claim the EFF prize ($100k for 10M digits).</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759625</id>
	<title>Re:Man, oh, man...</title>
	<author>Anonymous</author>
	<datestamp>1255631400000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext>Jenny, I got your number, I need to make you prime.</htmltext>
<tokenext>Jenny , I got your number , I need to make you prime .</tokentext>
<sentencetext>Jenny, I got your number, I need to make you prime.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758883</id>
	<title>Re:so?</title>
	<author>91degrees</author>
	<datestamp>1255628040000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>2</modscore>
	<htmltext><i>But anyone with a CS degree at least should understand the basics of why big primes make good private keys</i> <br> <br>
Indeed.  Although it should be noted that Mersenne primes are sort of useless for this.  If you know one of the factors is a Mersenne Prime then there are only 47 candidates.</htmltext>
<tokenext>But anyone with a CS degree at least should understand the basics of why big primes make good private keys Indeed .
Although it should be noted that Mersenne primes are sort of useless for this .
If you know one of the factors is a Mersenne Prime then there are only 47 candidates .</tokentext>
<sentencetext>But anyone with a CS degree at least should understand the basics of why big primes make good private keys  
Indeed.
Although it should be noted that Mersenne primes are sort of useless for this.
If you know one of the factors is a Mersenne Prime then there are only 47 candidates.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758355</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758557</id>
	<title>Re:so?</title>
	<author>Jeian</author>
	<datestamp>1255626660000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>I have a basic understanding of the principle, but I'm still not seeing the practical application of constantly finding larger and larger prime numbers. Sure, a million-digit prime number is cool if math is your thing, but as best I can tell it's not useful in a practical sense. (Maybe it has some academic value that I'm not aware of, entirely possible.)</p><p>I can run PGP and have it generate primes for me within a few seconds that are sufficient for decent encryption, and they don't need to be a gazillion digits long.</p><p>I could be way off on this, but that's just how it seems to me.</p></htmltext>
<tokenext>I have a basic understanding of the principle , but I 'm still not seeing the practical application of constantly finding larger and larger prime numbers .
Sure , a million-digit prime number is cool if math is your thing , but as best I can tell it 's not useful in a practical sense .
( Maybe it has some academic value that I 'm not aware of , entirely possible .
) I can run PGP and have it generate primes for me within a few seconds that are sufficient for decent encryption , and they do n't need to be a gazillion digits long.I could be way off on this , but that 's just how it seems to me .</tokentext>
<sentencetext>I have a basic understanding of the principle, but I'm still not seeing the practical application of constantly finding larger and larger prime numbers.
Sure, a million-digit prime number is cool if math is your thing, but as best I can tell it's not useful in a practical sense.
(Maybe it has some academic value that I'm not aware of, entirely possible.
)I can run PGP and have it generate primes for me within a few seconds that are sufficient for decent encryption, and they don't need to be a gazillion digits long.I could be way off on this, but that's just how it seems to me.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758355</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758357</id>
	<title>I'm way late to this thread</title>
	<author>Anonymous</author>
	<datestamp>1255625760000</datestamp>
	<modclass>Funny</modclass>
	<modscore>2</modscore>
	<htmltext><p>(2^43,112,609 - 1)th post!</p></htmltext>
<tokenext>( 2 ^ 43,112,609 - 1 ) th post !</tokentext>
<sentencetext>(2^43,112,609 - 1)th post!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29765815</id>
	<title>Re:Sooooo Last Year</title>
	<author>Samah</author>
	<datestamp>1255627920000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><div class="quote"><p>I don't know why they are running a story about something that happened August 2008!</p></div><p>I dunno, that's pretty close to breaking news for Slashdot.</p></div>
	</htmltext>
<tokenext>I do n't know why they are running a story about something that happened August 2008 ! I dunno , that 's pretty close to breaking news for Slashdot .</tokentext>
<sentencetext>I don't know why they are running a story about something that happened August 2008!I dunno, that's pretty close to breaking news for Slashdot.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759513</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758533</id>
	<title>What?!? Somebody else found this number?</title>
	<author>Anonymous</author>
	<datestamp>1255626540000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Now I'll gave to change my PIN number again. Just as well... I was getting a little tired typing it in every time anyway!</p></htmltext>
<tokenext>Now I 'll gave to change my PIN number again .
Just as well... I was getting a little tired typing it in every time anyway !</tokentext>
<sentencetext>Now I'll gave to change my PIN number again.
Just as well... I was getting a little tired typing it in every time anyway!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759513</id>
	<title>Sooooo Last Year</title>
	<author>Buffaloaf</author>
	<datestamp>1255630920000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>I don't know why they are running a story about something that happened August 2008!</p><p><a href="http://science.slashdot.org/story/08/09/13/1940218/45th-and-46th-Mersenne-Primes-Confirmed" title="slashdot.org" rel="nofollow">http://science.slashdot.org/story/08/09/13/1940218/45th-and-46th-Mersenne-Primes-Confirmed</a> [slashdot.org]</p><p>And since then we've found 2 more hence the 47th prime.<br><a href="http://science.slashdot.org/story/09/06/13/2218226/47th-Mersenne-Prime-Confirmed" title="slashdot.org" rel="nofollow">http://science.slashdot.org/story/09/06/13/2218226/47th-Mersenne-Prime-Confirmed</a> [slashdot.org]</p></htmltext>
<tokenext>I do n't know why they are running a story about something that happened August 2008 ! http : //science.slashdot.org/story/08/09/13/1940218/45th-and-46th-Mersenne-Primes-Confirmed [ slashdot.org ] And since then we 've found 2 more hence the 47th prime.http : //science.slashdot.org/story/09/06/13/2218226/47th-Mersenne-Prime-Confirmed [ slashdot.org ]</tokentext>
<sentencetext>I don't know why they are running a story about something that happened August 2008!http://science.slashdot.org/story/08/09/13/1940218/45th-and-46th-Mersenne-Primes-Confirmed [slashdot.org]And since then we've found 2 more hence the 47th prime.http://science.slashdot.org/story/09/06/13/2218226/47th-Mersenne-Prime-Confirmed [slashdot.org]</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595</id>
	<title>I haven't tested this thoroughly, but...</title>
	<author>Anonymous</author>
	<datestamp>1255626780000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Take any base 10 number that ends with 4 or 6. Square it. Add 1. So far, in my limited testing experience, it has worked.</htmltext>
<tokenext>Take any base 10 number that ends with 4 or 6 .
Square it .
Add 1 .
So far , in my limited testing experience , it has worked .</tokentext>
<sentencetext>Take any base 10 number that ends with 4 or 6.
Square it.
Add 1.
So far, in my limited testing experience, it has worked.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759687</id>
	<title>Various useful details</title>
	<author>Anonymous</author>
	<datestamp>1255631640000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>3</modscore>
	<htmltext><p>
The project GIMPS that is mentioned in the title uses a distributed computing system to search for Mersenne primes. They use a modified form of the Lucas-Lehmer test <a href="http://en.wikipedia.org/wiki/Lucas\%E2\%80\%93Lehmer\_primality\_test" title="wikipedia.org">http://en.wikipedia.org/wiki/Lucas\%E2\%80\%93Lehmer\_primality\_test</a> [wikipedia.org] where they use a Fast Fourier Transform to be able to do the large multiplications efficiently.
</p><p>
We care about Mersenne primes because they correspond to even perfect numbers. If one has a Mersenne prime 2^p -1 then (2^p-1)(2^(p-1)) is an even perfect number. This was proven by the ancient Greeks. Euler then proved much later that every even perfect number is of this form. The oldest two unsolved problems in mathematics are whether there are infinitely many even perfect numbers and whether there are any odd perfect numbers. Thus, every time we discover a new Mersenne prime we get a new even perfect number. And if we can ever get enough insight to resolve whether or not there are infinitely many Mersenne primes then we can resolve one of the oldest unsolved problems in all of mathematics.</p></htmltext>
<tokenext>The project GIMPS that is mentioned in the title uses a distributed computing system to search for Mersenne primes .
They use a modified form of the Lucas-Lehmer test http : //en.wikipedia.org/wiki/Lucas \ % E2 \ % 80 \ % 93Lehmer \ _primality \ _test [ wikipedia.org ] where they use a Fast Fourier Transform to be able to do the large multiplications efficiently .
We care about Mersenne primes because they correspond to even perfect numbers .
If one has a Mersenne prime 2 ^ p -1 then ( 2 ^ p-1 ) ( 2 ^ ( p-1 ) ) is an even perfect number .
This was proven by the ancient Greeks .
Euler then proved much later that every even perfect number is of this form .
The oldest two unsolved problems in mathematics are whether there are infinitely many even perfect numbers and whether there are any odd perfect numbers .
Thus , every time we discover a new Mersenne prime we get a new even perfect number .
And if we can ever get enough insight to resolve whether or not there are infinitely many Mersenne primes then we can resolve one of the oldest unsolved problems in all of mathematics .</tokentext>
<sentencetext>
The project GIMPS that is mentioned in the title uses a distributed computing system to search for Mersenne primes.
They use a modified form of the Lucas-Lehmer test http://en.wikipedia.org/wiki/Lucas\%E2\%80\%93Lehmer\_primality\_test [wikipedia.org] where they use a Fast Fourier Transform to be able to do the large multiplications efficiently.
We care about Mersenne primes because they correspond to even perfect numbers.
If one has a Mersenne prime 2^p -1 then (2^p-1)(2^(p-1)) is an even perfect number.
This was proven by the ancient Greeks.
Euler then proved much later that every even perfect number is of this form.
The oldest two unsolved problems in mathematics are whether there are infinitely many even perfect numbers and whether there are any odd perfect numbers.
Thus, every time we discover a new Mersenne prime we get a new even perfect number.
And if we can ever get enough insight to resolve whether or not there are infinitely many Mersenne primes then we can resolve one of the oldest unsolved problems in all of mathematics.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759317</id>
	<title>Re:Sounds cool, but...</title>
	<author>Duradin</author>
	<datestamp>1255630020000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><div class="quote"><p>Call me a n00b, but I'm unsure there are any ways to use this newfound information about prime numbers.

Next time good ol' (2^43,112,609 - 1) comes up in conversation, I'll make sure to impress everyone with my new knowledge, but other than that, I feel no smarter for having read this article.</p></div><p>

So as long as you know that water is wet, the sky is blue, and the Sun goes around the Earth you are content?</p></div>
	</htmltext>
<tokenext>Call me a n00b , but I 'm unsure there are any ways to use this newfound information about prime numbers .
Next time good ol ' ( 2 ^ 43,112,609 - 1 ) comes up in conversation , I 'll make sure to impress everyone with my new knowledge , but other than that , I feel no smarter for having read this article .
So as long as you know that water is wet , the sky is blue , and the Sun goes around the Earth you are content ?</tokentext>
<sentencetext>Call me a n00b, but I'm unsure there are any ways to use this newfound information about prime numbers.
Next time good ol' (2^43,112,609 - 1) comes up in conversation, I'll make sure to impress everyone with my new knowledge, but other than that, I feel no smarter for having read this article.
So as long as you know that water is wet, the sky is blue, and the Sun goes around the Earth you are content?
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758663</id>
	<title>Re:Man, oh, man...</title>
	<author>Anonymous</author>
	<datestamp>1255627080000</datestamp>
	<modclass>Funny</modclass>
	<modscore>1</modscore>
	<htmltext><p>the prime number 641 should be high enough for everybody</p></htmltext>
<tokenext>the prime number 641 should be high enough for everybody</tokentext>
<sentencetext>the prime number 641 should be high enough for everybody</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760181</id>
	<title>Re:I haven't tested this thoroughly, but...</title>
	<author>Anonymous</author>
	<datestamp>1255633680000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>try 44, and divide result by 13.</p></htmltext>
<tokenext>try 44 , and divide result by 13 .</tokentext>
<sentencetext>try 44, and divide result by 13.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758599</id>
	<title>Re:woo</title>
	<author>Nibbler999</author>
	<datestamp>1255626780000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>5</modscore>
	<htmltext><p>The money does not come from regular donations.</p><p><a href="http://www.eff.org/awards/coop" title="eff.org">http://www.eff.org/awards/coop</a> [eff.org] </p><p><div class="quote"><p>(Prize money comes from a special donation provided by an individual EFF supporter, earmarked specifically for this project. Prize money does NOT come from EFF membership dues, corporate or foundation grants, or other general EFF funds.)</p></div></div>
	</htmltext>
<tokenext>The money does not come from regular donations.http : //www.eff.org/awards/coop [ eff.org ] ( Prize money comes from a special donation provided by an individual EFF supporter , earmarked specifically for this project .
Prize money does NOT come from EFF membership dues , corporate or foundation grants , or other general EFF funds .
)</tokentext>
<sentencetext>The money does not come from regular donations.http://www.eff.org/awards/coop [eff.org] (Prize money comes from a special donation provided by an individual EFF supporter, earmarked specifically for this project.
Prize money does NOT come from EFF membership dues, corporate or foundation grants, or other general EFF funds.
)
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758329</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758585</id>
	<title>Obligatory</title>
	<author>Anonymous</author>
	<datestamp>1255626720000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>2 ^ 43112609 - 1? That's the same combination I have on my luggage!</p></htmltext>
<tokenext>2 ^ 43112609 - 1 ?
That 's the same combination I have on my luggage !</tokentext>
<sentencetext>2 ^ 43112609 - 1?
That's the same combination I have on my luggage!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29764937</id>
	<title>Re:Man, oh, man...</title>
	<author>Anonymous</author>
	<datestamp>1255616760000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>My prime goes to 11.</p></htmltext>
<tokenext>My prime goes to 11 .</tokentext>
<sentencetext>My prime goes to 11.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758663</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758837</id>
	<title>Re:so?</title>
	<author>gnick</author>
	<datestamp>1255627800000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>2</modscore>
	<htmltext><p><div class="quote"><p>I can run PGP and have it generate primes for me within a few seconds that are <b>sufficient</b> for <b>decent</b> encryption, and they don't need to be a gazillion digits long.</p></div><p>I agree with you entirely.  The debate, however, is in the definitions of "sufficient" and "decent".  For most needs, you need far fewer than a gazillion digits.  For national security type stuff, a gazillion digits may be appropriate.  For a math/crypto nerd, even a bazillion gazillion digits will never be enough.</p></div>
	</htmltext>
<tokenext>I can run PGP and have it generate primes for me within a few seconds that are sufficient for decent encryption , and they do n't need to be a gazillion digits long.I agree with you entirely .
The debate , however , is in the definitions of " sufficient " and " decent " .
For most needs , you need far fewer than a gazillion digits .
For national security type stuff , a gazillion digits may be appropriate .
For a math/crypto nerd , even a bazillion gazillion digits will never be enough .</tokentext>
<sentencetext>I can run PGP and have it generate primes for me within a few seconds that are sufficient for decent encryption, and they don't need to be a gazillion digits long.I agree with you entirely.
The debate, however, is in the definitions of "sufficient" and "decent".
For most needs, you need far fewer than a gazillion digits.
For national security type stuff, a gazillion digits may be appropriate.
For a math/crypto nerd, even a bazillion gazillion digits will never be enough.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758557</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29763595</id>
	<title>My prime</title>
	<author>Anonymous</author>
	<datestamp>1255606500000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>is bigger than your prime!</p></htmltext>
<tokenext>is bigger than your prime !</tokentext>
<sentencetext>is bigger than your prime!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758555</id>
	<title>Re:so?</title>
	<author>Yold</author>
	<datestamp>1255626600000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>(wikipedia)<br>Several public-key cryptography algorithms, such as RSA or the Diffie-Hellman key exchange are based on large prime numbers (for example with 512 bits). They rely on the fact that it is thought to be much easier (i.e., more efficient) to perform the multiplication of two (large) numbers x and y than to calculate x and y (assumed coprime) if only the product xy is known.</p><p>Many mathematical research subjects are not firmly grounded in real-world applications.</p></htmltext>
<tokenext>( wikipedia ) Several public-key cryptography algorithms , such as RSA or the Diffie-Hellman key exchange are based on large prime numbers ( for example with 512 bits ) .
They rely on the fact that it is thought to be much easier ( i.e. , more efficient ) to perform the multiplication of two ( large ) numbers x and y than to calculate x and y ( assumed coprime ) if only the product xy is known.Many mathematical research subjects are not firmly grounded in real-world applications .</tokentext>
<sentencetext>(wikipedia)Several public-key cryptography algorithms, such as RSA or the Diffie-Hellman key exchange are based on large prime numbers (for example with 512 bits).
They rely on the fact that it is thought to be much easier (i.e., more efficient) to perform the multiplication of two (large) numbers x and y than to calculate x and y (assumed coprime) if only the product xy is known.Many mathematical research subjects are not firmly grounded in real-world applications.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759745</id>
	<title>I'm glad it's voluntary</title>
	<author>onemorechip</author>
	<datestamp>1255631880000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>From TFA:</p><p><div class="quote"><p>A 12 million digit prime number, the largest such number ever discovered, has landed a voluntary math research group a $100,000 prize from the Electronic Frontier Foundation (EFF).</p> </div><p>I'd hate to learn that EFF is using slave labor.</p></div>
	</htmltext>
<tokenext>From TFA : A 12 million digit prime number , the largest such number ever discovered , has landed a voluntary math research group a $ 100,000 prize from the Electronic Frontier Foundation ( EFF ) .
I 'd hate to learn that EFF is using slave labor .</tokentext>
<sentencetext>From TFA:A 12 million digit prime number, the largest such number ever discovered, has landed a voluntary math research group a $100,000 prize from the Electronic Frontier Foundation (EFF).
I'd hate to learn that EFF is using slave labor.
	</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760167</id>
	<title>Slashdot Mods: Grow Up</title>
	<author>Rary</author>
	<datestamp>1255633620000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Your point is valid, and you're not the only one who thought of it. Others have pointed out that this didn't come from regular donations, but I just wanted to weigh in and say that the moderation you've received (currently "Score: 0, Troll") is ridiculous. Yours was a valid comment, and a useful contribution to this discussion.</p></htmltext>
<tokenext>Your point is valid , and you 're not the only one who thought of it .
Others have pointed out that this did n't come from regular donations , but I just wanted to weigh in and say that the moderation you 've received ( currently " Score : 0 , Troll " ) is ridiculous .
Yours was a valid comment , and a useful contribution to this discussion .</tokentext>
<sentencetext>Your point is valid, and you're not the only one who thought of it.
Others have pointed out that this didn't come from regular donations, but I just wanted to weigh in and say that the moderation you've received (currently "Score: 0, Troll") is ridiculous.
Yours was a valid comment, and a useful contribution to this discussion.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758329</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758661</id>
	<title>A Question</title>
	<author>rshol</author>
	<datestamp>1255627080000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>What is it about Mersenne Primes that makes finding a new one worth $100k? Is there an intrinsic value to the number or is it just one of those things that are so hard to do, like running a world's record hundred meters, that the effort and talent to do it merits a rewarded?</htmltext>
<tokenext>What is it about Mersenne Primes that makes finding a new one worth $ 100k ?
Is there an intrinsic value to the number or is it just one of those things that are so hard to do , like running a world 's record hundred meters , that the effort and talent to do it merits a rewarded ?</tokentext>
<sentencetext>What is it about Mersenne Primes that makes finding a new one worth $100k?
Is there an intrinsic value to the number or is it just one of those things that are so hard to do, like running a world's record hundred meters, that the effort and talent to do it merits a rewarded?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283</id>
	<title>Man, oh, man...</title>
	<author>Anonymous</author>
	<datestamp>1255625400000</datestamp>
	<modclass>Funny</modclass>
	<modscore>4</modscore>
	<htmltext>The biggest prime number I know is 8675309.  I'll have to tell Jenny about this new one.</htmltext>
<tokenext>The biggest prime number I know is 8675309 .
I 'll have to tell Jenny about this new one .</tokentext>
<sentencetext>The biggest prime number I know is 8675309.
I'll have to tell Jenny about this new one.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758787</id>
	<title>Re:I haven't tested this thoroughly, but...</title>
	<author>Anonymous</author>
	<datestamp>1255627620000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>2</modscore>
	<htmltext><p>(6*6) -1 = 35</p></htmltext>
<tokenext>( 6 * 6 ) -1 = 35</tokentext>
<sentencetext>(6*6) -1 = 35</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759689</id>
	<title>Re:So what is it?</title>
	<author>wastedlife</author>
	<datestamp>1255631640000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>I hope you were going for funny here, although I am curious as to how much RAM firefox would eat trying to display a page displaying a 12 million digit long string.</p></htmltext>
<tokenext>I hope you were going for funny here , although I am curious as to how much RAM firefox would eat trying to display a page displaying a 12 million digit long string .</tokentext>
<sentencetext>I hope you were going for funny here, although I am curious as to how much RAM firefox would eat trying to display a page displaying a 12 million digit long string.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759253</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759577</id>
	<title>Re:Man, oh, man...</title>
	<author>mcgrew</author>
	<datestamp>1255631220000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>But the <b>best</b> prime "number" (encoded of course) is 5t34k.</p></htmltext>
<tokenext>But the best prime " number " ( encoded of course ) is 5t34k .</tokentext>
<sentencetext>But the best prime "number" (encoded of course) is 5t34k.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758387</id>
	<title>nice!</title>
	<author>Anonymous</author>
	<datestamp>1255625820000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>A prime example of what can be done when....gah *dodges tomatoes*</p></htmltext>
<tokenext>A prime example of what can be done when....gah * dodges tomatoes *</tokentext>
<sentencetext>A prime example of what can be done when....gah *dodges tomatoes*</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759253</id>
	<title>So what is it?</title>
	<author>AP31R0N</author>
	<datestamp>1255629720000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>What is the awesome number?  The summary makes a big deal about this number but doesn't include it!  WtF?</p></htmltext>
<tokenext>What is the awesome number ?
The summary makes a big deal about this number but does n't include it !
WtF ?</tokentext>
<sentencetext>What is the awesome number?
The summary makes a big deal about this number but doesn't include it!
WtF?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761719</id>
	<title>Re:Sounds cool, but...</title>
	<author>Anonymous</author>
	<datestamp>1255598040000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Even if there is no application at the moment (I'm not sure if there is either), there could be applications discovered in the future.</p><p>For example, there were areas in the study of number theory that were once thought to be purely abstract with no real application. Those studies have been incorporated into cryptography and internet security.</p></htmltext>
<tokenext>Even if there is no application at the moment ( I 'm not sure if there is either ) , there could be applications discovered in the future.For example , there were areas in the study of number theory that were once thought to be purely abstract with no real application .
Those studies have been incorporated into cryptography and internet security .</tokentext>
<sentencetext>Even if there is no application at the moment (I'm not sure if there is either), there could be applications discovered in the future.For example, there were areas in the study of number theory that were once thought to be purely abstract with no real application.
Those studies have been incorporated into cryptography and internet security.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759553</id>
	<title>Re:Sounds cool, but...</title>
	<author>Anonymous</author>
	<datestamp>1255631100000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>memorize 43112609 now and if you happen to travel back more than 30 but less than 50 years, people who have access to millions of dollars in computer equipment just might believe your story.</p></htmltext>
<tokenext>memorize 43112609 now and if you happen to travel back more than 30 but less than 50 years , people who have access to millions of dollars in computer equipment just might believe your story .</tokentext>
<sentencetext>memorize 43112609 now and if you happen to travel back more than 30 but less than 50 years, people who have access to millions of dollars in computer equipment just might believe your story.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759117</id>
	<title>Re:Man, oh, man...</title>
	<author>dkleinsc</author>
	<datestamp>1255629120000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>What about 2 ^ 2079460347? You know, the odds that you can get rescued while floating in outer space by a passing Heart of Gold.</p></htmltext>
<tokenext>What about 2 ^ 2079460347 ?
You know , the odds that you can get rescued while floating in outer space by a passing Heart of Gold .</tokentext>
<sentencetext>What about 2 ^ 2079460347?
You know, the odds that you can get rescued while floating in outer space by a passing Heart of Gold.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759977</id>
	<title>Re:so?</title>
	<author>onemorechip</author>
	<datestamp>1255632840000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>If you're Bill Gates, you can try to factor them.</p></htmltext>
<tokenext>If you 're Bill Gates , you can try to factor them .</tokentext>
<sentencetext>If you're Bill Gates, you can try to factor them.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758517</id>
	<title>Re:woo</title>
	<author>Computer\_kid</author>
	<datestamp>1255626420000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>2</modscore>
	<htmltext>One of EFFs goals is personal privacy.  Encryption is based on prime numbers, the larger the prime, the more secure it is.  Having an insanely large prime would take nearly forever to crack the encrypted message.

<a href="http://www.cpaadvisor.us/sub/8\_encryption.htm" title="cpaadvisor.us" rel="nofollow">http://www.cpaadvisor.us/sub/8\_encryption.htm</a> [cpaadvisor.us]</htmltext>
<tokenext>One of EFFs goals is personal privacy .
Encryption is based on prime numbers , the larger the prime , the more secure it is .
Having an insanely large prime would take nearly forever to crack the encrypted message .
http : //www.cpaadvisor.us/sub/8 \ _encryption.htm [ cpaadvisor.us ]</tokentext>
<sentencetext>One of EFFs goals is personal privacy.
Encryption is based on prime numbers, the larger the prime, the more secure it is.
Having an insanely large prime would take nearly forever to crack the encrypted message.
http://www.cpaadvisor.us/sub/8\_encryption.htm [cpaadvisor.us]</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758329</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759379</id>
	<title>Re:A Question</title>
	<author>Hadlock</author>
	<datestamp>1255630260000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>2</modscore>
	<htmltext><p>I think $100,000 is roughly how much, in electricity costs, it costs to run the many, many computers for 5-10 years needed to grind out this particular number. Plus maintenance and taxes. You could pretty much say this research was done "at cost".</p></htmltext>
<tokenext>I think $ 100,000 is roughly how much , in electricity costs , it costs to run the many , many computers for 5-10 years needed to grind out this particular number .
Plus maintenance and taxes .
You could pretty much say this research was done " at cost " .</tokentext>
<sentencetext>I think $100,000 is roughly how much, in electricity costs, it costs to run the many, many computers for 5-10 years needed to grind out this particular number.
Plus maintenance and taxes.
You could pretty much say this research was done "at cost".</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758661</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758771</id>
	<title>Re:Actually the 47th</title>
	<author>Anonymous</author>
	<datestamp>1255627560000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>It is the second largest prime: Both of all primes and Mersennes.  It is not, as the summary states, the "largest such number ever discovered"</htmltext>
<tokenext>It is the second largest prime : Both of all primes and Mersennes .
It is not , as the summary states , the " largest such number ever discovered "</tokentext>
<sentencetext>It is the second largest prime: Both of all primes and Mersennes.
It is not, as the summary states, the "largest such number ever discovered"</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760583</id>
	<title>Re:Thank goodness it's voluntary</title>
	<author>Anonymous</author>
	<datestamp>1255635480000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext>Yes, the PAID kind.</htmltext>
<tokenext>Yes , the PAID kind .</tokentext>
<sentencetext>Yes, the PAID kind.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759887</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759599</id>
	<title>Re:So what is it?</title>
	<author>LordEd</author>
	<datestamp>1255631280000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>2</modscore>
	<htmltext><p>There is a link in TFA to the number.  It gives an abbreviated version first, but links to the full number as well:</p><p><a href="http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime-c.html" title="isthe.com" rel="nofollow">http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime-c.html</a> [isthe.com]</p></htmltext>
<tokenext>There is a link in TFA to the number .
It gives an abbreviated version first , but links to the full number as well : http : //prime.isthe.com/chongo/tech/math/prime/m42643801/prime-c.html [ isthe.com ]</tokentext>
<sentencetext>There is a link in TFA to the number.
It gives an abbreviated version first, but links to the full number as well:http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime-c.html [isthe.com]</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759253</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759887</id>
	<title>Thank goodness it's voluntary</title>
	<author>handy\_vandal</author>
	<datestamp>1255632420000</datestamp>
	<modclass>Funny</modclass>
	<modscore>4</modscore>
	<htmltext><blockquote><div><p>A 12-million-digit prime number, the largest such number ever discovered, has landed a voluntary math research group a $100,000 prize from the Electronic Frontier Foundation (EFF).</p></div> </blockquote><p>"Voluntary" math research group? Is there any other kind?</p><p> I'm trying to imagine an "involuntary" math research group, and all I'm getting is scenes from dystopian science fiction<nobr> <wbr></nobr>... or possibly a scene from the life of <a href="http://en.wikipedia.org/wiki/L\%C3\%A9on\_Theremin#Return\_to\_the\_Soviet\_Union" title="wikipedia.org">L&#233;on Theremin</a> [wikipedia.org].</p></div>
	</htmltext>
<tokenext>A 12-million-digit prime number , the largest such number ever discovered , has landed a voluntary math research group a $ 100,000 prize from the Electronic Frontier Foundation ( EFF ) .
" Voluntary " math research group ?
Is there any other kind ?
I 'm trying to imagine an " involuntary " math research group , and all I 'm getting is scenes from dystopian science fiction ... or possibly a scene from the life of L   on Theremin [ wikipedia.org ] .</tokentext>
<sentencetext>A 12-million-digit prime number, the largest such number ever discovered, has landed a voluntary math research group a $100,000 prize from the Electronic Frontier Foundation (EFF).
"Voluntary" math research group?
Is there any other kind?
I'm trying to imagine an "involuntary" math research group, and all I'm getting is scenes from dystopian science fiction ... or possibly a scene from the life of Léon Theremin [wikipedia.org].
	</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29766215</id>
	<title>Re:A Question</title>
	<author>Anonymous</author>
	<datestamp>1255635660000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p><div class="quote"><p>What is it about going to the Moon that makes it worth spending $20 billion?</p></div><p>As far as I can tell, absolutely nothing.</p></div>
	</htmltext>
<tokenext>What is it about going to the Moon that makes it worth spending $ 20 billion ? As far as I can tell , absolutely nothing .</tokentext>
<sentencetext>What is it about going to the Moon that makes it worth spending $20 billion?As far as I can tell, absolutely nothing.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758941</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758889</id>
	<title>they're useful for security researchers</title>
	<author>circletimessquare</author>
	<datestamp>1255628100000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><a href="http://www.jcu.edu/math/vignettes/mersenne.htm" title="jcu.edu" rel="nofollow">http://www.jcu.edu/math/vignettes/mersenne.htm</a> [jcu.edu] </p><blockquote><div><p>Why So Much Interest in Primes?</p><p>You might wonder whether the search for large primes is of any value.  Apart from the adventurous spirit of exploration, there actually are uses for large prime numbers.  One of the most important applications is to the field of cryptography -- the encoding and decoding of messages.  National security often relies on having a secure method of encoding and deciphering messages; yet the existence of high-speed computers have rendered all but the most sophisticated coding schemes insecure.  One commonly used method of message coding is the RSA scheme, named for its creators, Ron Rivest, Adi Shamir, and Len Adleman.  The RSA scheme relies on the fact that it is easy to multiply two prime numbers, yet hard to factor their product -- especially if the prime numbers are large.  Consequently, knowledge of large prime numbers can lead to coding schemes that are difficult to break.</p></div></blockquote></div>
	</htmltext>
<tokenext>http : //www.jcu.edu/math/vignettes/mersenne.htm [ jcu.edu ] Why So Much Interest in Primes ? You might wonder whether the search for large primes is of any value .
Apart from the adventurous spirit of exploration , there actually are uses for large prime numbers .
One of the most important applications is to the field of cryptography -- the encoding and decoding of messages .
National security often relies on having a secure method of encoding and deciphering messages ; yet the existence of high-speed computers have rendered all but the most sophisticated coding schemes insecure .
One commonly used method of message coding is the RSA scheme , named for its creators , Ron Rivest , Adi Shamir , and Len Adleman .
The RSA scheme relies on the fact that it is easy to multiply two prime numbers , yet hard to factor their product -- especially if the prime numbers are large .
Consequently , knowledge of large prime numbers can lead to coding schemes that are difficult to break .</tokentext>
<sentencetext>http://www.jcu.edu/math/vignettes/mersenne.htm [jcu.edu] Why So Much Interest in Primes?You might wonder whether the search for large primes is of any value.
Apart from the adventurous spirit of exploration, there actually are uses for large prime numbers.
One of the most important applications is to the field of cryptography -- the encoding and decoding of messages.
National security often relies on having a secure method of encoding and deciphering messages; yet the existence of high-speed computers have rendered all but the most sophisticated coding schemes insecure.
One commonly used method of message coding is the RSA scheme, named for its creators, Ron Rivest, Adi Shamir, and Len Adleman.
The RSA scheme relies on the fact that it is easy to multiply two prime numbers, yet hard to factor their product -- especially if the prime numbers are large.
Consequently, knowledge of large prime numbers can lead to coding schemes that are difficult to break.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758417</id>
	<title>Re:Sounds cool, but...</title>
	<author>ArhcAngel</author>
	<datestamp>1255626000000</datestamp>
	<modclass>Funny</modclass>
	<modscore>5</modscore>
	<htmltext><p>n00b</p></htmltext>
<tokenext>n00b</tokentext>
<sentencetext>n00b</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29766867</id>
	<title>Useless</title>
	<author>Anonymous</author>
	<datestamp>1255690620000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Absolutely useless research.</p></htmltext>
<tokenext>Absolutely useless research .</tokentext>
<sentencetext>Absolutely useless research.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758329</id>
	<title>woo</title>
	<author>nomadic</author>
	<datestamp>1255625640000</datestamp>
	<modclass>Troll</modclass>
	<modscore>0</modscore>
	<htmltext>Glad to hear they're putting all those donations to use.  There's no telling the impact on civil liberties that having access to a really large prime number will have...</htmltext>
<tokenext>Glad to hear they 're putting all those donations to use .
There 's no telling the impact on civil liberties that having access to a really large prime number will have.. .</tokentext>
<sentencetext>Glad to hear they're putting all those donations to use.
There's no telling the impact on civil liberties that having access to a really large prime number will have...</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29765609</id>
	<title>uni-brows</title>
	<author>Anonymous</author>
	<datestamp>1255624920000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>That's a big group uf uni-brows who will never get laid.</p></htmltext>
<tokenext>That 's a big group uf uni-brows who will never get laid .</tokentext>
<sentencetext>That's a big group uf uni-brows who will never get laid.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29762751</id>
	<title>You mean...</title>
	<author>Schnoogs</author>
	<datestamp>1255602120000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext>I could have been paid when I discovered this number last year?</htmltext>
<tokenext>I could have been paid when I discovered this number last year ?</tokentext>
<sentencetext>I could have been paid when I discovered this number last year?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758269</id>
	<title>Woah.</title>
	<author>Anonymous</author>
	<datestamp>1255625340000</datestamp>
	<modclass>Troll</modclass>
	<modscore>-1</modscore>
	<htmltext><p>That's like OVER 9000!!!</p></htmltext>
<tokenext>That 's like OVER 9000 ! !
!</tokentext>
<sentencetext>That's like OVER 9000!!
!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759881</id>
	<title>outrageous name</title>
	<author>Anonymous</author>
	<datestamp>1255632420000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Discovered by "the computing project called the Great Internet Mersenne Prime Search (GIMPS)".</p><p>I am surprised that nobody yet has protested against such an outrageous name. It happens any time with GIMP...</p></htmltext>
<tokenext>Discovered by " the computing project called the Great Internet Mersenne Prime Search ( GIMPS ) " .I am surprised that nobody yet has protested against such an outrageous name .
It happens any time with GIMP.. .</tokentext>
<sentencetext>Discovered by "the computing project called the Great Internet Mersenne Prime Search (GIMPS)".I am surprised that nobody yet has protested against such an outrageous name.
It happens any time with GIMP...</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759439</id>
	<title>Re:so?</title>
	<author>JoshuaZ</author>
	<datestamp>1255630500000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>3</modscore>
	<htmltext><p>
Strictly speaking, large primes are useful but not specific large primes. Indeed, this Mersenne prime is much too large to be useful for practical cryptography.
</p><p>
The main reason that primes are useful for cryptography is that there are functions associated with primes where the functions are easy to calculate but have inverses that are  very difficult to calculate unless one has extra information. The classic example of this is the discrete log problem. Essentially, if one is doing modular arithmetic with a given prime (that is arithmetic where you only look at the remainders when divided by that prime. This is essentially like a clock with p numbers on it. On a normal clock is arithmetic mod 12) then it turns out that for any prime p, there is a number k such that k^1, k^2, k^3... k^(p-1) taken mod pruns through all the possible remainders 1,2,3... p-1 (obviously not in order). Such a k is called a primitive root (or a generator) Now, it is very easy given a k and an n to calculate k^n (mod p). However, given the equation k^x=m (mod p) it is very hard to find the right value of x without doing a lot of work (essentially, you have to more or less list out k^1,k^2,k^3... until you get to m). The difficulty in this process is used in a number of public key crypto systems and other systems. For example, the Diffie-Hellman algorithm which was the first modern crypto algorithm discovered uses the difficulty of this process to make it so that two people can without ever having talked to each other before have a conversation and at the end of it have a secret code that no one else can figure out without impractical levels of computation. This is true even if one has access to all the communication that goes on between the two parties. The RSA algorithm which is more practical than DH for a variety of reasons also works off of a similar procedure.
</p><p>
The above is assuming that the discrete log is actually a difficult problem which everyone believes but is not proven. Proving this would imply that P != NP which is one of the Clay Millennium Problems (so million dollar prize and all that fun stuff). Mersenne primes are very interesting but not for any crypto related reason.</p></htmltext>
<tokenext>Strictly speaking , large primes are useful but not specific large primes .
Indeed , this Mersenne prime is much too large to be useful for practical cryptography .
The main reason that primes are useful for cryptography is that there are functions associated with primes where the functions are easy to calculate but have inverses that are very difficult to calculate unless one has extra information .
The classic example of this is the discrete log problem .
Essentially , if one is doing modular arithmetic with a given prime ( that is arithmetic where you only look at the remainders when divided by that prime .
This is essentially like a clock with p numbers on it .
On a normal clock is arithmetic mod 12 ) then it turns out that for any prime p , there is a number k such that k ^ 1 , k ^ 2 , k ^ 3... k ^ ( p-1 ) taken mod pruns through all the possible remainders 1,2,3... p-1 ( obviously not in order ) .
Such a k is called a primitive root ( or a generator ) Now , it is very easy given a k and an n to calculate k ^ n ( mod p ) .
However , given the equation k ^ x = m ( mod p ) it is very hard to find the right value of x without doing a lot of work ( essentially , you have to more or less list out k ^ 1,k ^ 2,k ^ 3... until you get to m ) .
The difficulty in this process is used in a number of public key crypto systems and other systems .
For example , the Diffie-Hellman algorithm which was the first modern crypto algorithm discovered uses the difficulty of this process to make it so that two people can without ever having talked to each other before have a conversation and at the end of it have a secret code that no one else can figure out without impractical levels of computation .
This is true even if one has access to all the communication that goes on between the two parties .
The RSA algorithm which is more practical than DH for a variety of reasons also works off of a similar procedure .
The above is assuming that the discrete log is actually a difficult problem which everyone believes but is not proven .
Proving this would imply that P ! = NP which is one of the Clay Millennium Problems ( so million dollar prize and all that fun stuff ) .
Mersenne primes are very interesting but not for any crypto related reason .</tokentext>
<sentencetext>
Strictly speaking, large primes are useful but not specific large primes.
Indeed, this Mersenne prime is much too large to be useful for practical cryptography.
The main reason that primes are useful for cryptography is that there are functions associated with primes where the functions are easy to calculate but have inverses that are  very difficult to calculate unless one has extra information.
The classic example of this is the discrete log problem.
Essentially, if one is doing modular arithmetic with a given prime (that is arithmetic where you only look at the remainders when divided by that prime.
This is essentially like a clock with p numbers on it.
On a normal clock is arithmetic mod 12) then it turns out that for any prime p, there is a number k such that k^1, k^2, k^3... k^(p-1) taken mod pruns through all the possible remainders 1,2,3... p-1 (obviously not in order).
Such a k is called a primitive root (or a generator) Now, it is very easy given a k and an n to calculate k^n (mod p).
However, given the equation k^x=m (mod p) it is very hard to find the right value of x without doing a lot of work (essentially, you have to more or less list out k^1,k^2,k^3... until you get to m).
The difficulty in this process is used in a number of public key crypto systems and other systems.
For example, the Diffie-Hellman algorithm which was the first modern crypto algorithm discovered uses the difficulty of this process to make it so that two people can without ever having talked to each other before have a conversation and at the end of it have a secret code that no one else can figure out without impractical levels of computation.
This is true even if one has access to all the communication that goes on between the two parties.
The RSA algorithm which is more practical than DH for a variety of reasons also works off of a similar procedure.
The above is assuming that the discrete log is actually a difficult problem which everyone believes but is not proven.
Proving this would imply that P != NP which is one of the Clay Millennium Problems (so million dollar prize and all that fun stuff).
Mersenne primes are very interesting but not for any crypto related reason.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759147</id>
	<title>Re:woo</title>
	<author>Anonymous</author>
	<datestamp>1255629240000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Thanks, I was a bit miffed at this use of funds too.</p></htmltext>
<tokenext>Thanks , I was a bit miffed at this use of funds too .</tokentext>
<sentencetext>Thanks, I was a bit miffed at this use of funds too.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758599</parent>
</comment>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_37</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759379
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758661
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_14</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758771
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_16</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760583
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759887
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_21</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29764255
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_3</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29766215
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758941
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758661
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_20</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759147
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758599
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758329
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_2</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761221
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760447
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_11</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759021
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_35</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759195
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758557
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758355
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_12</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760167
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758329
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_40</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758745
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_8</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758787
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_26</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758889
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_28</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758417
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_1</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29765585
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759887
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_32</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760181
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_25</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761719
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_7</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759439
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_6</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761591
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_24</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759317
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_15</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759211
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758557
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758355
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_39</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761005
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759689
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759253
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_30</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759577
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_23</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758853
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_5</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758555
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_13</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759117
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_36</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759599
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759253
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_0</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759977
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_38</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758503
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_29</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29768171
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759033
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_33</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760263
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_19</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758517
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758329
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_10</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758825
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_34</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758883
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758355
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_9</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29765815
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759513
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_27</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759625
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_18</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760685
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_31</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759553
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_17</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758837
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758557
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758355
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_22</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29764937
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758663
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_10_15_154227_4</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758827
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
</commentlist>
</thread>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.0</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760031
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.12</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758267
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761719
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758827
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759317
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759553
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760263
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758417
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761591
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758503
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758889
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.13</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759687
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.5</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758243
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.11</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758283
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758825
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759577
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759625
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759117
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758663
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29764937
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.10</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759513
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29765815
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.3</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759253
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759689
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761005
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759599
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.9</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758193
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759033
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29768171
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758771
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760685
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759021
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760447
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29761221
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.7</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759023
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.4</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758595
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760181
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758787
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758745
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29764255
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758853
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.1</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758329
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758599
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759147
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758517
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760167
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.2</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758661
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759379
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758941
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29766215
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.8</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758225
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759439
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759977
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758555
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758355
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758883
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758557
---http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759211
---http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759195
---http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29758837
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_10_15_154227.6</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29759887
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29765585
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_10_15_154227.29760583
</commentlist>
</conversation>
