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 a+b = 10 and ab = 21, what is the value of a^3 + b^3?
View QuestionThe area of an equilateral triangle with side length 6 cm is:
View QuestionA sum of money triples itself in 12 years at simple interest. What is the rate of interest per annum?
View QuestionA car travels 240 km in 4 hours. What is its average speed?
View QuestionWhat is the cube root of 729?
View QuestionIf a = 4 and b = 5, what is the value of (a+b)^2?
View QuestionIf x = 2 and y = 3, what is the value of (x^2 + y^2)?
View QuestionWhat is the slope of a line passing through the points (2, 3) and (4, 7)?
View QuestionWhat is the area of a sector of a circle with radius 14 cm and central angle 90°?
View QuestionIf 2x - 3 = 7, what is the value of x?
View Question