Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0084acf commit b07529fCopy full SHA for b07529f
1 file changed
Project-Euler/test/Problem003.test.js
@@ -0,0 +1,12 @@
1
+import { largestPrime } from '../Problem003.js'
2
+
3
+describe('Largest prime factor', () => {
4
+ test('if the number is 13195', () => {
5
+ expect(largestPrime(13195)).toBe(29)
6
+ })
7
+ // Project Euler Condition Check
8
+ test('if the number is 600851475143', () => {
9
+ // Default value is same as the tested value
10
+ expect(largestPrime()).toBe(6857)
11
12
+})
0 commit comments