/* ______________________________________ Goldbach's Conjecture ______________________________________ Goldbach's conjecture is a rule in math that states the following: every even number greater than 2 can be expressed as the sum of two prime numbers. ______________________________________ Aim:- Write a program that finds every possible pair of prime numbers, whose sum equals the given number or a set of numbers within a range. ______________________________________ INPUT SYNTAX: 1. For range => Value blank_space Value 2. For a particular number => Value ______________________________________ For example: Input: 16 Output: 3 + 13 5 + 11 Input: 32 Output: 3 + 29 = 32 13 + 19 = 32 Input: 4 8 Output: 2 + 2 = 4 3 + 3 = 6 3 + 5 = 8 ______________________________________ */ #include #include using namespace std; int main() { //declaring a variables; int range1,range2=0; vector prime; // taking input; cin>>range1>>range2; //if only one number is entered than this is make both the intervals of range equal so that it will show the output for that particular number only; if(range1%2==0 && !range2){range2=range1;} else if (range1%2!=0 && !range2) { cout<<"You Entered : "<

Goldbach's Conjecture﻿(﻿3) range+value

Goldbach's Conjecture(3) range+value