Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

solution: Project Euler 35 #1201

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
raklaptudirm merged 10 commits into TheAlgorithms:master from ddaniel27:master
Oct 24, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
34 changes: 34 additions & 0 deletions Project-Euler/Problem035.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
/**
* Problem 35 - Circular primes
*
* @see {@link https://projecteuler.net/problem=35}
*
* The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
* There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
* How many circular primes are there below one million?
*
* @author ddaniel27
*/
import { sieveOfEratosthenes } from '../Maths/SieveOfEratosthenesIntArray'

function problem35 (n) {
if (n < 2) {
throw new Error('Invalid input')
}
const list = sieveOfEratosthenes(n).filter(prime => !prime.toString().match(/[024568]/)) // Get a list of primes without 0, 2, 4, 5, 6, 8

const result = list.filter((number, _idx, arr) => {
const str = String(number)
for (let i = 0; i < str.length; i++) { // Get all rotations of the number
const rotation = str.slice(i) + str.slice(0, i)
if (!arr.includes(Number(rotation))) { // Check if the rotation is prime
return false
}
}
return true // If all rotations are prime, then the number is circular prime
})

return result.length + 1 // Add 2 to the result because 2 is a circular prime
}

export { problem35 }
18 changes: 18 additions & 0 deletions Project-Euler/test/Problem035.test.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
import { problem35 } from '../Problem035.js'

describe('checking circular primes', () => {
it('should be invalid input if number is negative', () => {
expect(() => problem35(-3)).toThrowError('Invalid input')
})
it('should be invalid input if number is 0', () => {
expect(() => problem35(0)).toThrowError('Invalid input')
})
// Project Euler Condition Check
test('if the number is equal to 100 result should be 13', () => {
expect(problem35(100)).toBe(13)
})
// Project Euler Challenge Check
test('if the number is equal to one million result should be 55', () => {
expect(problem35(1000000)).toBe(55)
})
})

AltStyle によって変換されたページ (->オリジナル) /