mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 08:16:50 +08:00
Minor fixes
- Add default number of iterations - Correct "corner cases" to "edge cases" - Make clear which bounds are inclusive and which are exclusive
This commit is contained in:
@ -9,11 +9,11 @@ describe('modularExponentiation', () => {
|
||||
|
||||
describe('fermatPrimeCheck', () => {
|
||||
it('should give the correct output for prime and composite numbers', () => {
|
||||
expect(fermatPrimeCheck(2, 50)).toBe(true)
|
||||
expect(fermatPrimeCheck(10, 50)).toBe(false)
|
||||
expect(fermatPrimeCheck(94286167, 50)).toBe(true)
|
||||
expect(fermatPrimeCheck(83165867, 50)).toBe(true)
|
||||
expect(fermatPrimeCheck(13268774, 50)).toBe(false)
|
||||
expect(fermatPrimeCheck(13233852, 50)).toBe(false)
|
||||
expect(fermatPrimeCheck(2, 35)).toBe(true)
|
||||
expect(fermatPrimeCheck(10, 30)).toBe(false)
|
||||
expect(fermatPrimeCheck(94286167)).toBe(true)
|
||||
expect(fermatPrimeCheck(83165867)).toBe(true)
|
||||
expect(fermatPrimeCheck(13268774)).toBe(false)
|
||||
expect(fermatPrimeCheck(13233852)).toBe(false)
|
||||
})
|
||||
})
|
||||
|
Reference in New Issue
Block a user