Lemoine’s Conjecture
Last Updated :
20 Sep, 2022
Any odd integer greater than 5 can be expressed as a sum of an odd prime (all primes other than 2 are odd) and an even semiprime. A semiprime number is a product of two prime numbers. This is called Lemoine’s conjecture.
Examples :
7 = 3 + (2 × 2),
where 3 is a prime number (other than 2) and 4 (= 2 × 2) is a semiprime number.
11 = 5 + (2 × 3)
where 5 is a prime number and 6(= 2 × 3) is a semiprime number.
9 = 3 + (2 × 3) or 9 = 5 + (2 × 2)
47 = 13 + 2 × 17 = 37 + 2 × 5 = 41 + 2 × 3 = 43 + 2 × 2
Below is the implementation of Lemoine’s Conjecture:
C++
#include<bits/stdc++.h>
using namespace std;
bool isPrime( int n)
{
if (n < 2)
return false ;
for ( int i = 2; i <= sqrt (n); i++) {
if (n % i == 0)
return false ;
}
return true ;
}
void lemoine( int n)
{
map< int , int > pr;
map< int , int >::iterator it;
it = pr.begin();
for ( int q = 1; q <= n / 2; q++)
{
int p = n - 2 * q;
if (isPrime(p) && isPrime(q))
pr.insert(it, pair< int , int >(p, q));
}
for (it = pr.begin(); it != pr.end(); ++it)
cout << n << " = " << it->first
<< " + (2 * " << it->second << ")\n" ;
}
int main()
{
int n = 39;
cout << n << " can be expressed as " << endl;
lemoine(n);
return 0;
}
|
Java
import java.util.*;
class GFG {
static class pair {
int first, second;
public pair( int first, int second) {
this .first = first;
this .second = second;
}
}
static boolean isPrime( int n) {
if (n < 2 )
return false ;
for ( int i = 2 ; i <= Math.sqrt(n); i++) {
if (n % i == 0 )
return false ;
}
return true ;
}
static void lemoine( int n) {
HashMap<Integer, pair> pr = new HashMap<>();
int i = 0 ;
for ( int q = 1 ; q <= n / 2 ; q++) {
int p = n - 2 * q;
if (isPrime(p) && isPrime(q))
pr.put(i, new pair(p, q));
i++;
}
for (Map.Entry<Integer, pair> it : pr.entrySet())
System.out.print(n + " = " + it.getValue().first + " + (2 * " + it.getValue().second + ")\n" );
}
public static void main(String[] args) {
int n = 39 ;
System.out.print(n + " can be expressed as " + "\n" );
lemoine(n);
}
}
|
Python3
from math import sqrt
def isPrime(n: int ) - > bool :
if n < 2 :
return False
for i in range ( 2 , int (sqrt(n)) + 1 ):
if n % i = = 0 :
return False
return True
def lemoine(n: int ) - > None :
pr = dict ()
for q in range ( 1 , n / / 2 + 1 ):
p = n - 2 * q
if isPrime(p) and isPrime(q):
if p not in pr:
pr[p] = q
for it in pr:
print ( "%d = %d + (2 * %d)" % (n, it, pr[it]))
if __name__ = = "__main__" :
n = 39
print (n, "can be expressed as " )
lemoine(n)
|
C#
using System;
using System.Collections.Generic;
class GFG
{
public
class pair
{
public
int first, second;
public pair( int first, int second)
{
this .first = first;
this .second = second;
}
}
static bool isPrime( int n)
{
if (n < 2)
return false ;
for ( int i = 2; i <= Math.Sqrt(n); i++)
{
if (n % i == 0)
return false ;
}
return true ;
}
static void lemoine( int n)
{
Dictionary< int , pair> pr = new Dictionary< int , pair>();
int i = 0;
for ( int q = 1; q <= n / 2; q++)
{
int p = n - 2 * q;
if (isPrime(p) && isPrime(q))
pr.Add(i, new pair(p, q));
i++;
}
foreach (KeyValuePair< int , pair> it in pr)
Console.Write(n + " = " + it.Value.first +
" + (2 * " + it.Value.second + ")\n" );
}
public static void Main(String[] args)
{
int n = 39;
Console.Write(n + " can be expressed as " + "\n" );
lemoine(n);
}
}
|
Javascript
<script>
function isPrime(n)
{
if (n < 2)
return false ;
for (let i = 2; i <= Math.sqrt(n); i++) {
if (n % i == 0)
return false ;
}
return true ;
}
function lemoine(n)
{
let pr = new Map();
for (let q = 1; q <= Math.floor(n / 2); q++)
{
let p = n - 2 * q;
if (isPrime(p) && isPrime(q))
if (!pr.has(p)){
pr.set(p, q);
}
}
for (const [key, value] of pr)
console.log(n, "=" , key, " + (2 *" , value, ")" );
}
let n = 39;
console.log(n, "can be expressed as " );
lemoine(n);
</script>
|
Output :
39 can be expressed as :
39 = 5 + (2 * 17)
39 = 13 + (2 * 13)
39 = 17 + (2 * 11)
39 = 29 + (2 * 5)
Time Complexity: O(n*(sqrt(n)+log(n)))
Auxiliary Space: O(n)
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...