FINDING NUMBER OF PRIME PAIRS WHOSE DIFFERENCE IS 6 USING PYTHON
Akula Arjun
Aug 30, 2021
In this python project, we will find the number of prime pairs that are present between the given inclusive range with the difference of 6.
Prime number :
A prime number is a number having exactly two factors. If p is a prime, then its only factors are necessarily 1 and p itself. In this program, we will find the number of prime pairs with a difference of 6 is present in the given inclusive range using python.For example, the given range is 4,30 then all possible pairs are (5,11),(7,13),(11,17),(13,19),(17,23),(23,29) i.e 6 pairs with a difference of 6.
Example :
Input :4 30
Output :6
Input :101 500
Output :30
Input :1000 2000
Output :54
Project Files
| .. | ||
| This directory is empty. | ||
Comments (1)
<p>I want answers</p> <p> </p>
<p><span style="background-color: #2b2b2b; color: #a9b7c6; font-family: 'JetBrains Mono', monospace; font-size: 9.8pt;">n = </span><span style="font-family: 'JetBrains Mono', monospace; font-size: 9.8pt; color: #8888c6;">int</span><span style="background-color: #2b2b2b; color: #a9b7c6; font-family: 'JetBrains Mono', monospace; font-size: 9.8pt;">(</span><span style="font-family: 'JetBrains Mono', monospace; font-size: 9.8pt; color: #8888c6;">input</span><span style="background-color: #2b2b2b; color: #a9b7c6; font-family: 'JetBrains Mono', monospace; font-size: 9.8pt;">(</span><span style="font-family: 'JetBrains Mono', monospace; font-size: 9.8pt; color: #6a8759;">"enter the lower range</span><span style="font-family: 'JetBrains Mono', monospace; font-size: 9.8pt; color: #cc7832;">\n</span><span style="font-family: 'JetBrains Mono', monospace; font-size: 9.8pt; color: #6a8759;">"</span><span style="background-color: #2b2b2b; color: #a9b7c6; font-family: 'JetBrains Mono', monospace; font-size: 9.8pt;">))</span></p> <pre style="background-color: #2b2b2b; color: #a9b7c6; font-family: 'JetBrains Mono',monospace; font-size: 9.8pt;">m = <span style="color: #8888c6;">int</span>(<span style="color: #8888c6;">input</span>(<span style="color: #6a8759;">"enter the upper range</span><span style="color: #cc7832;">\n</span><span style="color: #6a8759;">"</span>))<br />prime = []<br />pair = []<br /><span style="color: #cc7832;">for </span>number <span style="color: #cc7832;">in </span><span style="color: #8888c6;">range</span>(n<span style="color: #cc7832;">, </span>m+<span style="color: #6897bb;">1</span>):<br /> <span style="color: #cc7832;">if </span>number > <span style="color: #6897bb;">1</span>:<br /> <span style="color: #cc7832;">for </span>i <span style="color: #cc7832;">in </span><span style="color: #8888c6;">range</span>(<span style="color: #6897bb;">2</span><span style="color: #cc7832;">, </span>number):<br /> <span style="color: #cc7832;">if </span>number % i == <span style="color: #6897bb;">0</span>:<br /> <span style="color: #cc7832;">break<br /></span><span style="color: #cc7832;"> else</span>:<br /> prime += [number]<br /><span style="color: #8888c6;">print</span>(prime)<br /><span style="color: #cc7832;">for </span>j <span style="color: #cc7832;">in </span>prime:<br /> <span style="color: #cc7832;">if </span>j + <span style="color: #6897bb;">6 </span><span style="color: #cc7832;">in </span>prime:<br /> x = j + <span style="color: #6897bb;">6<br /></span><span style="color: #6897bb;"> </span><span style="color: #cc7832;">if </span>j + <span style="color: #6897bb;">6 </span><span style="color: #cc7832;">in </span>prime <span style="color: #cc7832;">and </span>x <span style="color: #cc7832;">in </span>prime:<br /> pair += [(j<span style="color: #cc7832;">, </span>x)]<br /><span style="color: #8888c6;">print</span>(<span style="color: #6a8759;">f"The no of pair if </span><span style="color: #cc7832;">{</span><span style="color: #8888c6;">len</span>(pair)<span style="color: #cc7832;">}</span><span style="color: #6a8759;"> and the prime pairs are </span><span style="color: #cc7832;">{</span>pair<span style="color: #cc7832;">}</span><span style="color: #6a8759;">"</span>)</pre>
