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 average of five consecutive odd numbers is 25, what is the largest number?
View QuestionIf a:b = 3:4 and b:c = 5:6, what is a:c?
View QuestionIf a:b = 7:9 and b:c = 5:6, what is a:c?
View QuestionThe LCM of two numbers is 60, and their HCF is 5. If one of the numbers is 20, what is the other number?
View QuestionIf the length of a rectangle is doubled and the width is halved, what is the change in area?
View QuestionIf a:b = 2:3 and b:c = 4:5, what is a:c?
View QuestionThe sides of a triangle are 5 cm, 12 cm, and 13 cm. What type of triangle is it?
View QuestionIf x = 3 and y = 4, what is the value of x^2 + y^2?
View QuestionA sum triples in 20 years at simple interest. What is the rate of interest per annum?
View QuestionIf a square has a perimeter of 64 cm, what is its area?
View Question