mirror of
https://github.com/avinal/avinal.github.io.git
synced 2026-07-04 07:40:09 +05:30
16 lines
5.3 KiB
XML
16 lines
5.3 KiB
XML
<?xml version="1.0" encoding="utf-8"?>
|
|
<feed xmlns="http://www.w3.org/2005/Atom"><title>Be My SpaceTime - prime</title><link href="https://avinal.space/" rel="alternate"></link><link href="https://avinal.space/feeds/prime.atom.xml" rel="self"></link><id>https://avinal.space/</id><updated>2021-01-09T22:29:00+05:30</updated><subtitle>눈치</subtitle><entry><title>Introduction to Prime Numbers</title><link href="https://avinal.space/posts/prime/prime1.html" rel="alternate"></link><published>2021-01-09T22:29:00+05:30</published><updated>2021-01-09T22:29:00+05:30</updated><author><name>Avinal</name></author><id>tag:avinal.space,2021-01-09:/posts/prime/prime1.html</id><summary type="html"><p class="first last">A prime is a positive integer <em>p</em> having exactly two positive divisors, namely <em>1</em> and <em>p</em>. An integer <em>n</em> is composite if <em>n</em> &gt; <em>1</em> and <em>n</em> is not prime. (The number 1 is considered neither prime nor composite.)</p>
|
|
</summary><content type="html"><blockquote class="epigraph">
|
|
A prime is a positive integer <em>p</em> having exactly two positive divisors, namely <em>1</em> and <em>p</em>. An integer <em>n</em> is composite if <em>n</em> &gt; <em>1</em> and <em>n</em> is not prime. (The number 1 is considered neither prime nor composite.)</blockquote>
|
|
<p>We can frame a brute force algorithm for checking primality of numbers using the above statement.</p>
|
|
<div class="highlight"><pre><span></span><span class="kt">bool</span><span class="w"> </span><span class="nf">is_prime</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">number</span><span class="p">)</span><span class="w"> </span><span class="p">{</span><span class="w"></span>
|
|
<span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">factor</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"></span>
|
|
<span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">number</span><span class="p">;</span><span class="w"> </span><span class="o">++</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="p">{</span><span class="w"></span>
|
|
<span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">number</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="p">{</span><span class="w"></span>
|
|
<span class="w"> </span><span class="n">factor</span><span class="o">++</span><span class="p">;</span><span class="w"></span>
|
|
<span class="w"> </span><span class="p">}</span><span class="w"></span>
|
|
<span class="w"> </span><span class="p">}</span><span class="w"></span>
|
|
<span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="p">(</span><span class="n">factor</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="o">?</span><span class="w"> </span><span class="nb">true</span><span class="w"> </span><span class="o">:</span><span class="w"> </span><span class="nb">false</span><span class="p">;</span><span class="w"></span>
|
|
<span class="p">}</span><span class="w"></span>
|
|
</pre></div>
|
|
</content><category term="prime"></category><category term="prime"></category><category term="primenumbers"></category></entry></feed> |