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 = 2 and y = 3, what is the value of (x^2 + y^2)?
View QuestionWhat is the sum of the first 50 positive integers?
View QuestionWhat is the sum of all odd numbers from 1 to 99?
View QuestionThe simple interest on Rs. 4000 at 5% per annum for 2 years is:
View QuestionThe base of a triangle is 10 cm and its height is 6 cm. What is its area?
View QuestionThe sides of a triangle are 5 cm, 12 cm, and 13 cm. What type of triangle is it?
View QuestionIf x + 1/x = 5, what is the value of x^2 + 1/x^2?
View QuestionIf sin(A) = 3/5 and cos(B) = 5/13, where A and B are acute angles, what is sin(A+B)?
View QuestionIf a = 4 and b = 5, what is the value of (a+b)^2?
View QuestionWhat is the square root of 144?
View Question