Counting Positive Integers in a Set of Numbers

[Trepidation]

I have a set of numbers, n_{1} through n_{z}. Some of these n values are positive integers and some are positive rational non-integers.

How can I determine how many are positive integers?

In other words, I have a set of numbers. There are z numbers in this set. I don't need to know which are zeros, which are positive integers, and which are neither... But I need to know HOW MANY positive integers there are.

Perhaps some function that would make the value of any positive integer 1, and the value of any other real number 0? Has that been done?

Thank you ^^.


Note: I don't know anything about formal set theory, so don't take my use of the word "set" to imply that my problem involves that at all. Thanks.

 

[AKG]

This seems essentially impossible. What are you allowed to do with these numbers? I can't imagine being allowed to do anything with these numbers that would allow you to determine what kind of number it is that is any different from knowing what the number is in the first place. For example, you could take the sum of all the number, then take the sum of all the numbers except n₁. Is the difference of those two sums zero, and integer, or a non-integer? Answering this question will tell you what n₁ is, but this is no different than cheating and knowing what n₁ is in the first place. But if you are totally in the dark as to what these numbers are, then you shouldn't be able to determine what the sum of all the number is. In fact, you shouldn't be able to do anything with these numbers that will give you information about what kind of number they are.

 

[CRGreathouse]

Perhaps some function that would make the value of any positive integer 1, and the value of any other real number 0? Has that been done?

You can define any function you want; this would be a fine way to solve your problem.

As far as terminology goes, it's only a set if duplicates don't count. As sets, {0, 0} = {0}; if not, then you're working with sequences, ordered tuples, or something else.

 

[Trepidation]

This seems essentially impossible. What are you allowed to do with these numbers? I can't imagine being allowed to do anything with these numbers that would allow you to determine what kind of number it is that is any different from knowing what the number is in the first place. For example, you could take the sum of all the number, then take the sum of all the numbers except n₁. Is the difference of those two sums zero, and integer, or a non-integer? Answering this question will tell you what n₁ is, but this is no different than cheating and knowing what n₁ is in the first place. But if you are totally in the dark as to what these numbers are, then you shouldn't be able to determine what the sum of all the number is. In fact, you shouldn't be able to do anything with these numbers that will give you information about what kind of number they are.

I do know what n₁ is in the first place; I know the identities of all of these numbers in any given instance.

What I mean is that the numbers are given by an equation: \frac{x}{a} = n_{a}, where a is equal to every positive integer such that 2 \leq a \leq x. So:

\frac{x}{1} = n_{1} = \frac{x}{1}

\frac{x}{2} = n_{2} = \frac{x}{2}

\frac{x}{3} = n_{3} = \frac{x}{3}

\frac{x}{4} = n_{4} = \frac{x}{4}

...

\frac{x}{x} = n_{x} = \frac{x}{x}

As you can see, this is related to factoring... For any a for which f is evenly divisible by a, n_a is equal to an integer. For any a for which f is not evenly divisible by a, n_a is equal to a non-integer. (I apologize, but I was wrong when I said some of the numbers were equal to zero. I had mixed up this problem and the larger problem of which it was a part when explaining... I'm very sorry for making such an idiotic mistake.)

So, to find how many factors (not PRIME factors, just factors in general) any given integer x has, I just need to run it through this algorithm and I'll get a set of integers and non-integers... If I can somehow take that set of numbers and count how many integers there are, I will then have the number of factors of x.

You can define any function you want; this would be a fine way to solve your problem.

As far as terminology goes, it's only a set if duplicates don't count. As sets, {0, 0} = {0}; if not, then you're working with sequences, ordered tuples, or something else.

I'd like to find an explicit function for this, not simply define it to do what I want it to. Thank you though ^^.

And thanks for the clarification on the terminology!

 

[AKG]

I do know what n₁ is in the first place; I know the identities of all of these numbers in any given instance.

So why didn't you say so?! How did you expect anyone to help you with this problem without telling us what the numbers are?

So, to find how many factors (not PRIME factors, just factors in general) any given integer x has, I just need to run it through this algorithm and I'll get a set of integers and non-integers... If I can somehow take that set of numbers and count how many integers there are, I will then have the number of factors of x.

Let p_i be the i^th prime number, so p₁ = 2, p₂ = 3, p₃ = 5, etc. Any natural number has a unique prime factorization, and we can write any natural number x in the following form:

x = \prod _{i=1} ^{\infty} p_i^{a_i}

Then x has the following number of factors:

\prod _{i = 1} ^{\infty} (a_i + 1)

 

[Trepidation]

Thanks for your help ^^.

I solved my problem, btw...