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.
What is the square root of 0.25?
View QuestionIf a+b = 10 and ab = 21, what is the value of a^3 + b^3?
View QuestionIf the angles of a triangle are in the ratio 2:3:4, what is the measure of the largest angle?
View QuestionWhat is the sum of all angles in a hexagon?
View QuestionIf a:b = 5:7 and b:c = 6:11, what is a:c?
View QuestionIf the sum of three consecutive integers is 96, what are the integers?
View QuestionIf the sum of the squares of two consecutive positive integers is 365, what are the integers?
View QuestionThe LCM of 12 and 15 is:
View QuestionIf a cone has a base radius of 3 cm and height of 4 cm, what is its slant height?
View QuestionWhat is the slope of a line passing through the points (2, 3) and (4, 7)?
View Question