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 perimeter of a rectangle is 40 cm, and its length is 12 cm. What is its width?
View QuestionA square is inscribed in a circle with a radius of 5 cm. What is the area of the square?
View QuestionWhat is the HCF of 72 and 120?
View QuestionA train 120 meters long is moving at a speed of 54 km/h. How long will it take to pass a pole?
View QuestionA man rows downstream at 6 km/h and upstream at 4 km/h. What is the speed of the stream?
View QuestionWhat is the sum of all angles in a hexagon?
View QuestionIf x² - 9x + 18 = 0, what are the roots of the equation?
View QuestionIf sin(θ) = 0.6 and θ is acute, what is cos(θ)?
View QuestionIf the radius of a circle is 7 cm, what is its circumference?
View QuestionIf a cylinder has a radius of 7 cm and height of 10 cm, what is its volume?
View Question