Subject: Mathematics
Book: Maths Mastery
Determining whether a number is prime involves checking divisibility only up to its square root. For example, to test if 29 is prime, verify divisibility by primes less than √29 (~5.4), i.e., 2, 3, 5. Since none evenly divide 29, it is prime. Efficient prime checking algorithms play a significant role in encryption (RSA), random number generation, and coding challenges. Having a solid routine for prime checks sharpens your sense of number theory and fosters computational thinking—even if you rely on advanced methods for very large numbers.
If the sum of three consecutive integers is 72, what are the integers?
View QuestionIf x² - 9x + 18 = 0, what are the roots of the equation?
View QuestionIf a:b = 2:3 and b:c = 4:5, what is a:c?
View QuestionIf a cone has a radius of 5 cm and a height of 12 cm, what is its slant height?
View QuestionIf the average of five consecutive odd numbers is 25, what is the largest number?
View QuestionWhat is the HCF of 72 and 120?
View QuestionThe sides of a triangle are 5 cm, 12 cm, and 13 cm. What type of triangle is it?
View QuestionA triangle has angles 60°, 60°, and 60°. What type of triangle is it?
View QuestionIf the ratio of two numbers is 3:5 and their HCF is 4, what are the numbers?
View QuestionIf 2x - 3 = 7, what is the value of x?
View Question