<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-5344365828629261299</id><updated>2011-04-21T13:06:52.670-07:00</updated><title type='text'>PrimeFantasy</title><subtitle type='html'></subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://kadiprimality.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5344365828629261299/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://kadiprimality.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>Kadhirvel+919380916539</name><uri>http://www.blogger.com/profile/09558021274736211643</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>3</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-5344365828629261299.post-6464384331173741021</id><published>2008-07-29T09:09:00.000-07:00</published><updated>2008-07-29T20:43:33.743-07:00</updated><title type='text'>Example For Pseudo Prime Generation</title><content type='html'>Choose x = 7, N = 103, then PP&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = 11 and PP&lt;/span&gt;&lt;span style="font-size:78%;"&gt;2&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = 13&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;then 7K&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; (mod 103) = 11 which implies K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = 31 and 7K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;2&lt;/span&gt;&lt;span style="font-size:100%;"&gt; (mod 103) = 13 which implies K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;2&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = 46&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;then dK&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;2&lt;/span&gt;&lt;span style="font-size:100%;"&gt; - K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; as K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;2&lt;/span&gt;&lt;span style="font-size:100%;"&gt; &gt; K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; then dK&lt;/span&gt;&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = 46 - 31 = 15&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;choose n = 11 then 11&lt;span style="font-size:78%;"&gt;th&lt;/span&gt;&lt;span style="font-size:100%;"&gt; pseudo prime PP&lt;span style="font-size:78%;"&gt;11&lt;/span&gt; is generated as follows&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;j = (n - 1)/3 = (11 - 1)/3 = 10/3 = 3&lt;br /&gt;&lt;br /&gt;i = n(mod 3) = 11(mod 3) = 2&lt;br /&gt;&lt;br /&gt;r = j(mod 2) = 3( mod 2 ) = 1&lt;br /&gt;&lt;br /&gt;then f(n) = 6j as i = 2, r = 1 and n &gt; 3 therefore f(11) = 6*3 = 18&lt;br /&gt;&lt;br /&gt;then K&lt;span style="font-size:78%;"&gt;11&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = ( K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;2&lt;/span&gt;&lt;span style="font-size:100%;"&gt; - ( dK&lt;/span&gt;&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; * ( N + 1 - f(11) ) ) ) (mod 103) = (46 - ( 15 * (103 + 1 - 18 ) ) ) (mod 103)&lt;/span&gt;&lt;br /&gt;= (46 - (15 * 86 ) ) (mod 103) = -1244 (mod 103) = 95&lt;br /&gt;&lt;br /&gt;thus K&lt;span style="font-size:78%;"&gt;11&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = 95 then PP&lt;/span&gt;&lt;span style="font-size:78%;"&gt;11&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = (7 * 95 ) (mod 103 ) = 47 which is prime&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;like that choosing x = 7 and N = 103 will produce a sequence as follows 11, 13, 17, 19, 23, ... w.r.t. choosing n = 1, 2, 3, 4,....&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5344365828629261299-6464384331173741021?l=kadiprimality.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://kadiprimality.blogspot.com/feeds/6464384331173741021/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=5344365828629261299&amp;postID=6464384331173741021' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5344365828629261299/posts/default/6464384331173741021'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5344365828629261299/posts/default/6464384331173741021'/><link rel='alternate' type='text/html' href='http://kadiprimality.blogspot.com/2008/07/example-for-pseudo-prime-generation.html' title='Example For Pseudo Prime Generation'/><author><name>Kadhirvel+919380916539</name><uri>http://www.blogger.com/profile/09558021274736211643</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5344365828629261299.post-6774953184208976960</id><published>2008-07-27T23:59:00.000-07:00</published><updated>2009-04-11T20:39:15.371-07:00</updated><title type='text'>Kadi Primality Test</title><content type='html'>&lt;div align="left"&gt;Please consider the following results i worked on Prime Number. Following will provide base for primality tests.&lt;br /&gt;&lt;br /&gt;Choose lower limit x and upper limit N where x, N belongs to Natural numbers.&lt;br /&gt;&lt;br /&gt;Then the following method will generate pseudoprimes between x and N.&lt;br /&gt;&lt;br /&gt;Choose PP&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; and PP&lt;/span&gt;&lt;span style="font-size:78%;"&gt;2 &lt;/span&gt;&lt;span style="font-size:100%;"&gt;which are two contiguous prime numbers greater than x such that PP2 &gt; PP1 for eg., if we choose x = 7 or 8 or 9 or 10 then PP1 = 11 and PP2 = 13&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;Then exists K&lt;span style="font-size:78%;"&gt;1&lt;/span&gt;&lt;span style="font-size:100%;"&gt; and K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;2&lt;/span&gt;&lt;span style="font-size:100%;"&gt; such that&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;K1.x = PP1(mod N)&lt;br /&gt;K2 .x = PP2(mod N) where K1 and K2 can be found by Eucledean algorithm.&lt;br /&gt;&lt;br /&gt;For eg., if x = 7 , N = 103 then PP1 = 11 and PP2 = 13&lt;br /&gt;&lt;br /&gt;7K1 = 11(mod 103) which impies K1 = 31&lt;br /&gt;7K2 = 13(mod 103) which implies K2 = 46&lt;br /&gt;&lt;br /&gt;Then the n&lt;span style="font-size:78%;"&gt;th&lt;/span&gt;&lt;span style="font-size:100%;"&gt; pseudoprime PP&lt;span style="font-size:78%;"&gt;n&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size:100%;"&gt; is generated by following equation&lt;/span&gt;(Pseudo prime is prime otherwise composite if it proved to be composite)&lt;br /&gt;&lt;br /&gt;PP&lt;span style="font-size:78%;"&gt;n&lt;/span&gt;&lt;span style="font-size:100%;"&gt; = K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;n&lt;/span&gt;&lt;span style="font-size:100%;"&gt;.x(mod N) where K&lt;/span&gt;&lt;span style="font-size:78%;"&gt;n&lt;/span&gt;&lt;span style="font-size:100%;"&gt; is calculated as follows&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;If k1 &lt; k2, d = k2 - k1 then&lt;br /&gt;&lt;br /&gt;Kn = (K&lt;span style="font-size:78%;"&gt;2&lt;/span&gt;&lt;span style="font-size:100%;"&gt; - (d &lt;/span&gt;&lt;span style="font-size:100%;"&gt;* ( N + 1 - f(n) ))) (mod N) where f(n) is calculated as below&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;elseif K1 &gt; K2, d = K1 - K2 then&lt;br /&gt;&lt;br /&gt;Kn = (K2 + (d * ( N + 1 - f(n) ))) (mod N) where f(n) is calculated as below&lt;br /&gt;&lt;br /&gt;where f(n) = 0, if n = 1&lt;br /&gt;= 1, if n = 2&lt;br /&gt;= 3, if n = 3&lt;br /&gt;= 6j + 3, if i = 0, n &gt; 3&lt;br /&gt;= 6j - 2, if i = 1, n &gt; 3&lt;br /&gt;= 6j + 1, if i = 2, r = 0, n&gt; 3&lt;br /&gt;= 6j, if i = 2, r = 1, n &gt; 3&lt;br /&gt;&lt;br /&gt;where j = (n -1) / 3, where j belongs to Natural number. for eg., if n = 14 then j = (14 - 1) / 3 = 13/3 = 4;&lt;br /&gt;&lt;br /&gt;i = n(mod 3)&lt;br /&gt;&lt;br /&gt;r = j(mod2).&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;&lt;p class="MsoNormal"&gt;&lt;b&gt;&lt;span style=";font-family:Arial;font-size:14;"  &gt;&lt;span style="font-size:100%;"&gt;&lt;/span&gt;&lt;o:p&gt;&lt;/o:p&gt;&lt;/span&gt;&lt;/b&gt;&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5344365828629261299-6774953184208976960?l=kadiprimality.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://kadiprimality.blogspot.com/feeds/6774953184208976960/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=5344365828629261299&amp;postID=6774953184208976960' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5344365828629261299/posts/default/6774953184208976960'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5344365828629261299/posts/default/6774953184208976960'/><link rel='alternate' type='text/html' href='http://kadiprimality.blogspot.com/2008/07/kadi-primality-test.html' title='Kadi Primality Test'/><author><name>Kadhirvel+919380916539</name><uri>http://www.blogger.com/profile/09558021274736211643</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5344365828629261299.post-3905752388560429473</id><published>2008-07-27T23:41:00.000-07:00</published><updated>2008-07-27T23:42:45.769-07:00</updated><title type='text'>Hi Everyone</title><content type='html'>Welcome to the Fansy of Numbers&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5344365828629261299-3905752388560429473?l=kadiprimality.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://kadiprimality.blogspot.com/feeds/3905752388560429473/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=5344365828629261299&amp;postID=3905752388560429473' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5344365828629261299/posts/default/3905752388560429473'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5344365828629261299/posts/default/3905752388560429473'/><link rel='alternate' type='text/html' href='http://kadiprimality.blogspot.com/2008/07/hi-everyone.html' title='Hi Everyone'/><author><name>Kadhirvel+919380916539</name><uri>http://www.blogger.com/profile/09558021274736211643</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry></feed>
