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 sides of a triangle are 6 cm, 8 cm, and 10 cm, what is the area of the triangle?
View QuestionIf a rectangle has a length of 10 cm and a width of 6 cm, what is its perimeter?
View QuestionIf the length of a rectangle is doubled and the width is halved, what is the change in area?
View QuestionA car travels 240 km in 4 hours. What is its average speed?
View QuestionThe simple interest on Rs. 4000 at 5% per annum for 2 years is:
View QuestionIf the sum of the squares of two consecutive positive integers is 365, what are the integers?
View QuestionIf a cylinder has a radius of 7 cm and height of 10 cm, what is its volume?
View QuestionIf x + 1/x = 5, what is the value of x^2 + 1/x^2?
View QuestionWhat is the value of log₃(27)?
View QuestionA rectangle has a length of 10 cm and a width of 5 cm. What is the diagonal of the rectangle?
View Question