![]() The problem itself requires trial and error: You have to look at a list of primes and try to find pairs that add to 100 (perhaps by subtracting each prime from 100 and seeing if the result is on the list). ![]() Well some are obvious but if I'm going from 1-100 I need an easy way. I want to know a simpler way than trying to multiply a bunch of numbers together. What is an easy way to determine if a number is prime?Įxample: Write the number 100 as the sum of two prime numbers.įor me it is difficult to determine whether or not a number is prime. We’ll start with this question from 2008: Checking if a Number from 1-100 is Prime ![]() The next question many students have is, how can I make a list of prime numbers (or write a computer program to do so)? We’ll learn about the Sieve of Eratosthenes, and list all the prime numbers up to 1000. ![]() We’ve looked at what prime numbers are, and how the concept extends (or doesn’t) to 0, 1, and negative integers. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |