A prime number is a positive integer whose only factors are itself and 1. For example, 7 is a prime number because it is greater than 1 and only has factors 7 and 1.
Given a function called SQRT which returns the square root of any non negative integer input as well as an integer called NUMBER, write efficient pseudocode to output true if NUMBER is a prime and output false otherwise.
Short Answer7 MarksPremium
9 Uses18 Views1 Like
Login or Create an Account to view the mark scheme, comment, and add to a test