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.
What is the value of x if log(x) + log(4) = log(32)?
View QuestionIf a+b = 10 and ab = 21, what is the value of a^3 + b^3?
View QuestionA sphere has a radius of 7 cm. What is its volume?
View QuestionWhat is the remainder when 5^100 is divided by 3?
View QuestionA square is inscribed in a circle with a radius of 5 cm. What is the area of the square?
View QuestionA number is increased by 20% and then decreased by 10%. What is the net change?
View QuestionIf two complementary angles differ by 30°, what are the angles?
View QuestionIf a cone has a radius of 5 cm and a height of 12 cm, what is its slant height?
View QuestionA number is increased by 20% and then decreased by 20%. What is the net change?
View QuestionIf x:y = 4:5 and y:z = 2:3, what is x:z?
View Question