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 getting an even number when rolling a die is:
View QuestionIf a cylinder has a radius of 7 cm and height of 10 cm, what is its volume?
View QuestionThe perimeter of a rectangle is 50 cm, and its length is 15 cm. What is its width?
View QuestionIf x = 3 and y = 4, what is the value of x^2 + y^2?
View QuestionA number is increased by 20% and then decreased by 20%. What is the net change?
View QuestionThe LCM of two numbers is 60, and their HCF is 5. If one of the numbers is 20, what is the other number?
View QuestionWhat is the length of the diagonal of a square with a side length of 7 cm?
View QuestionWhat is the 7th term of the arithmetic progression 3, 6, 9, 12,...?
View QuestionIf log(100) = 2 and log(10) = 1, what is log(1000)?
View QuestionA number is increased by 20% and then decreased by 10%. What is the net change?
View Question