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 5x - 2 = 13, what is the value of x?
View QuestionIf sin(A) = 1/2 and A is acute, what is the value of A?
View QuestionThe sides of a triangle are 7, 24, and 25. Is this a right triangle?
View QuestionIf the angles of a triangle are in the ratio 2:3:4, what is the measure of the largest angle?
View QuestionWhat is the cube root of 729?
View QuestionA cube has a side length of 4 cm. What is its volume?
View QuestionWhat is the slope of a line passing through the points (2, 3) and (4, 7)?
View QuestionA number is increased by 20% and then decreased by 20%. What is the net change?
View QuestionIf the radius of a circle is doubled, what happens to its area?
View QuestionThe area of an equilateral triangle with side length 6 cm is:
View Question