A prime number is a positive integer greater than 1 that has no positive divisors other than 1 and itself. In simpler terms, it's a number that cannot be evenly divided by any other numbers except for 1 and itself.
Composite number: A composite number is an integer greater than 1 that can be evenly divided by numbers other than 1 and itself. In contrast to prime numbers, composite numbers have multiple factors.
Sieve of Eratosthenes: The Sieve of Eratosthenes is an algorithm used to find all prime numbers up to a given limit. It works by iteratively marking the multiples of each prime number, gradually eliminating non-prime numbers from a list.
Prime factorization: Prime factorization is the process of expressing a composite number as a product of its prime factors. It involves finding the prime numbers that can divide the given number without leaving any remainder.
AP Computer Science Principles
AP Computer Science A - 4.4 Nested Iteration
Study guides for the entire semester
200k practice questions
Glossary of 50k key terms - memorize important vocab
About Fiveable
Blog
Careers
Code of Conduct
Terms of Use
Privacy Policy
CCPA Privacy Policy
Cram Mode
AP Score Calculators
Study Guides
Practice Quizzes
Glossary
Cram Events
Merch Shop
Crisis Text Line
Help Center
About Fiveable
Blog
Careers
Code of Conduct
Terms of Use
Privacy Policy
CCPA Privacy Policy
Cram Mode
AP Score Calculators
Study Guides
Practice Quizzes
Glossary
Cram Events
Merch Shop
Crisis Text Line
Help Center
© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.