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.
A cone has a base radius of 7 cm and height of 24 cm. What is its volume?
View QuestionA car covers a distance of 150 km in 2.5 hours. What is its average speed?
View QuestionIf a + b = 10 and ab = 21, what is the value of a^2 + b^2?
View QuestionThe perimeter of a rectangle is 40 cm, and its length is 12 cm. What is its width?
View QuestionA cube has a side length of 4 cm. What is its volume?
View QuestionIf 2x = 16, what is the value of x?
View QuestionThe sum of the reciprocals of two numbers is 1/4. If one number is 12, what is the other?
View QuestionWhat is the cube root of 729?
View QuestionIf a cylinder has a radius of 7 cm and height of 10 cm, what is its volume?
View QuestionIf the radius of a circle is 7 cm, what is its circumference?
View Question