Question: Write a Haskell program for the following: Write a function badFermat :: Integer 1 that shows Fermat's conjecture (all numbers of the form 22 +1
Write a Haskell program for the following:

Write a function badFermat :: Integer 1 that shows Fermat's conjecture (all numbers of the form 22" +1 are prime) is false by finding a number for which it is not true. What happens if the conjecture is true? Write a function badFermat :: Integer 1 that shows Fermat's conjecture (all numbers of the form 22" +1 are prime) is false by finding a number for which it is not true. What happens if the conjecture is true
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
