IMP 2 POW 3: Divisor Counting.
I. Problem statement:
This POW is all about finding information and patterns about the way divisors of certain numbers are found and expressed. In this POW when we talk about divisors we usually are counting the number of divisors that a number has. The divisor is a number that a number can be divided by, of course every number is divisible by every other number but in these problems we are only talking about whole, positive numbers. Every number is divisible evenly by one or itself so every number has at least 2 divisors. Numbers that have only 2 divisors are called prime numbers, only uneven numbers can be prime numbers, all even numbers except two have at least 3 divisors, the number itself, 1 and 2. the task was to find information about different questions about divisors, to find patterns and to make our own question. II. Questions:
What kinds of numbers have exactly 3 divisors?, 4 divisors? and so on. Do bigger numbers necessarily have more divisors?
Is there a way to figure out how many divisors one million has, how many one billion has and so on without actually counting all the different ones? (in other words is there a system for counting divisors) What is the smallest number with 20 divisors?
Choose your own interesting question: Do all the rules for divisors work the same with negative numbers? III. Information gathering
For most of the questions I found the divisors or made generalizations based on other information I gained via other numbers divisors or I used logic to figure out simple rules to apply to the numbers. I gathered many different simple rules and the number of divisors in some numbers, and my brother showed me the equation to find any numbers divisor. (It wasn’t at all useful because I have no idea what most of the stuff in the equation means and I can’t write it into Word.) When I found information that I knew was correct by either finding consistent or obvious patterns or by realizing it could...
Please join StudyMode to read the full document