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.
The probability of rolling a sum of 7 with two dice is:
View QuestionWhat is the probability of drawing a king from a standard deck of 52 playing cards?
View QuestionIf two complementary angles differ by 30°, what are the angles?
View QuestionIf a+b = 10 and ab = 21, what is the value of a^3 + b^3?
View QuestionWhat is the length of the diagonal of a square with a side length of 7 cm?
View QuestionThe area of an equilateral triangle with side length 6 cm is:
View QuestionWhat is the sum of all even numbers between 1 and 100?
View QuestionIf x + 1/x = 5, what is the value of x^2 + 1/x^2?
View QuestionA triangle has angles 60°, 60°, and 60°. What type of triangle is it?
View QuestionIf the ratio of two numbers is 3:5 and their HCF is 4, what are the numbers?
View Question