\r\nA number is divisible by<\/strong><\/td>\r\n| <\/td>\r\n<\/tr>\r\n | \r\n[latex]2[\/latex]<\/strong><\/td>\r\n| if the last digit is [latex]0, 2, 4, 6,[\/latex] or [latex]8[\/latex]<\/td>\r\n<\/tr>\r\n | \r\n[latex]3[\/latex]<\/strong><\/td>\r\n| if the sum of the digits is divisible by [latex]3[\/latex]<\/td>\r\n<\/tr>\r\n | \r\n[latex]5[\/latex]<\/strong><\/td>\r\n| if the last digit is [latex]5[\/latex] or [latex]0[\/latex]<\/td>\r\n<\/tr>\r\n | \r\n[latex]6[\/latex]<\/strong><\/td>\r\n| if divisible by both [latex]2[\/latex] and [latex]3[\/latex]<\/td>\r\n<\/tr>\r\n | \r\n[latex]10[\/latex]<\/strong><\/td>\r\nif the last digit is [latex]0[\/latex]<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n\r\n \t- Factors<\/strong> If [latex]a\\cdot b=m[\/latex] , then [latex]a[\/latex] and [latex]b[\/latex] are factors of [latex]m[\/latex] , and [latex]m[\/latex] is the product of [latex]a[\/latex] and [latex]b[\/latex] .<\/li>\r\n \t
- Find all the factors of a counting number.<\/strong>\r\n
\r\n \t- Divide the number by each of the counting numbers, in order, until the quotient is smaller than the divisor.\r\n
\r\n \t- If the quotient is a counting number, the divisor and quotient are a pair of factors.<\/li>\r\n \t
- If the quotient is not a counting number, the divisor is not a factor.<\/li>\r\n<\/ol>\r\n<\/li>\r\n \t
- List all the factor pairs.<\/li>\r\n \t
- Write all the factors in order from smallest to largest.<\/li>\r\n<\/ol>\r\n<\/li>\r\n \t
- Determine if a number is prime.<\/strong>\r\n
\r\n \t- Test each of the primes, in order, to see if it is a factor of the number.<\/li>\r\n \t
- Start with [latex]2[\/latex] and stop when the quotient is smaller than the divisor or when a prime factor is found.<\/li>\r\n \t
- If the number has a prime factor, then it is a composite number. If it has no prime factors, then the number is prime.<\/li>\r\n<\/ol>\r\n<\/li>\r\n<\/ul>","rendered":"
Key Concepts<\/h2>\n\n\n\n| Divisibility Tests<\/th>\n<\/tr>\n<\/thead>\n | \n\nA number is divisible by<\/strong><\/td>\n| <\/td>\n<\/tr>\n | \n[latex]2[\/latex]<\/strong><\/td>\n| if the last digit is [latex]0, 2, 4, 6,[\/latex] or [latex]8[\/latex]<\/td>\n<\/tr>\n | \n[latex]3[\/latex]<\/strong><\/td>\n| if the sum of the digits is divisible by [latex]3[\/latex]<\/td>\n<\/tr>\n | \n[latex]5[\/latex]<\/strong><\/td>\n| if the last digit is [latex]5[\/latex] or [latex]0[\/latex]<\/td>\n<\/tr>\n | \n[latex]6[\/latex]<\/strong><\/td>\n| if divisible by both [latex]2[\/latex] and [latex]3[\/latex]<\/td>\n<\/tr>\n | \n[latex]10[\/latex]<\/strong><\/td>\nif the last digit is [latex]0[\/latex]<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n- Factors<\/strong> If [latex]a\\cdot b=m[\/latex] , then [latex]a[\/latex] and [latex]b[\/latex] are factors of [latex]m[\/latex] , and [latex]m[\/latex] is the product of [latex]a[\/latex] and [latex]b[\/latex] .<\/li>\n
- Find all the factors of a counting number.<\/strong>\n
\n- Divide the number by each of the counting numbers, in order, until the quotient is smaller than the divisor.\n
\n- If the quotient is a counting number, the divisor and quotient are a pair of factors.<\/li>\n
- If the quotient is not a counting number, the divisor is not a factor.<\/li>\n<\/ol>\n<\/li>\n
- List all the factor pairs.<\/li>\n
- Write all the factors in order from smallest to largest.<\/li>\n<\/ol>\n<\/li>\n
- Determine if a number is prime.<\/strong>\n
\n- Test each of the primes, in order, to see if it is a factor of the number.<\/li>\n
- Start with [latex]2[\/latex] and stop when the quotient is smaller than the divisor or when a prime factor is found.<\/li>\n
- If the number has a prime factor, then it is a composite number. If it has no prime factors, then the number is prime.<\/li>\n<\/ol>\n<\/li>\n<\/ul>\n\n\t\t\t
| | | | | | | | | | | | | |