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 x:y = 4:5 and y:z = 2:3, what is x:z?
View QuestionIf a:b = 2:3 and b:c = 4:5, what is a:c?
View QuestionIf the radius of a circle is doubled, what happens to its area?
View QuestionIf a rectangle has a length of 10 cm and a width of 6 cm, what is its perimeter?
View QuestionA sum triples in 20 years at simple interest. What is the rate of interest per annum?
View QuestionA car covers a distance of 150 km in 2.5 hours. What is its average speed?
View QuestionIf a right triangle has legs of 9 cm and 12 cm, what is the length of the hypotenuse?
View QuestionIf the probability of an event is 1/4, what is the probability of its complement?
View QuestionA sum of money triples itself in 12 years at simple interest. What is the rate of interest per annum?
View QuestionWhat is the sum of the first 50 positive integers?
View Question