
- Javascript Basics Tutorial
- Javascript - Home
- Javascript - Overview
- Javascript - Syntax
- Javascript - Enabling
- Javascript - Placement
- Javascript - Variables
- Javascript - Operators
- Javascript - If...Else
- Javascript - Switch Case
- Javascript - While Loop
- Javascript - For Loop
- Javascript - For...in
- Javascript - Loop Control
- Javascript - Functions
- Javascript - Events
- Javascript - Cookies
- Javascript - Page Redirect
- Javascript - Dialog Boxes
- Javascript - Void Keyword
- Javascript - Page Printing
- JavaScript Objects
- Javascript - Objects
- Javascript - Number
- Javascript - Boolean
- Javascript - Strings
- Javascript - Arrays
- Javascript - Date
- Javascript - Math
- Javascript - RegExp
- Javascript - HTML DOM
- JavaScript Advanced
- Javascript - Error Handling
- Javascript - Validations
- Javascript - Animation
- Javascript - Multimedia
- Javascript - Debugging
- Javascript - Image Map
- Javascript - Browsers
- JavaScript Useful Resources
- Javascript - Questions And Answers
- Javascript - Quick Guide
- Javascript - Functions
- Javascript - Resources
Finding all possible prime pairs that sum upto input number using JavaScript
Problem
We are required to write a JavaScript function that takes in a number n. Our function should return an array of all such number pairs that when summed are n and both of them are prime.
Example
Following is the code −
const num = 26; const isPrime = (n) => { if (n % 2 === 0) return false; let sqrtn = Math.sqrt(n)+1; for (let i=3; i < sqrtn; i+=2) { if (n % i === 0) return false; } return true; } const primeList = (a) => { if (isPrime(a)) return a; else return false; }; const generateNumbers = (n) => { let num = (n % 2 === 0) ? (n -1) : n; let list = [] for (let i = num; i > 3; i-=2) list.push(i); list.push(3,1); return list; } const calculate = (num, list, results) => { if (list.length === 0) return results; let item = list.shift(); let itemPairIndex = list.indexOf(num - item); if (itemPairIndex !== -1) { let itemPair = list.splice(itemPairIndex,1) results.push(item+"+"+itemPair); } return calculate(num, list, results); } const findprimeSum = (num) => { const pairs = []; const list = generateNumbers(num).filter(primeList); return calculate(num, list, []); } console.log(findprimeSum(num));
Output
[ '23+3', '19+7' ]
- Related Articles
- Finding sum of sequence upto a specified accuracy using JavaScript
- Listing all the prime numbers upto a specific number in JavaScript
- Sum all perfect cube values upto n using JavaScript
- Finding next prime number to a given number using JavaScript
- JavaScript: Finding nearest prime number greater or equal to sum of digits - JavaScript
- Find all combinations that add upto given number using C++
- Prime numbers upto n - JavaScript
- Finding the largest 5 digit number within the input number using JavaScript
- Finding the nth prime number in JavaScript
- Counting prime numbers from 2 upto the number n JavaScript
- Find all pairs that sum to a target value in JavaScript
- All possible co-prime distinct element pairs within a range [L, R]?
- Finding a number, when multiplied with input number yields input number in JavaScript
- Finding the sum of all common elements within arrays using JavaScript
- Finding all possible subsets of an array in JavaScript

Advertisements