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.
The angles of a quadrilateral are in the ratio 3:4:5:6. What is the largest angle?
View QuestionA triangle has angles 60°, 60°, and 60°. What type of triangle is it?
View QuestionIf a number is divisible by 9, it is also divisible by which of the following?
View QuestionThe perimeter of a rectangle is 40 cm, and its length is 12 cm. What is its width?
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 HCF of 48 and 180?
View QuestionIf a+b = 10 and ab = 21, what is the value of a^3 + b^3?
View QuestionWhat is the area of an equilateral triangle with side length 10 cm?
View QuestionIf a:b = 3:4 and b:c = 5:6, what is a:c?
View QuestionA cone has a base radius of 7 cm and height of 24 cm. What is its volume?
View Question