Partitioning number systems into sets

  • Thread starter Thread starter MathDude
  • Start date Start date
  • Tags Tags
    Sets Systems
MathDude
Messages
8
Reaction score
0
I've been having trouble partitioning number systems into sets. The complex and rational number systems blow me away, so I'll stick with all reals, integers, and naturals for now.

Homework Statement



1a) With five sets of infinitely many positive integers, partition the set of all real numbers.
1b) With five infinite sets, partition the set of all real numbers.

2a) With infinitely many infinite sets, partition the set of all real numbers/
2b) With infinitely many infinite sets, partition the set of integers.

Homework Equations



(see above)

The Attempt at a Solution




1a)

A1 = { k \in R>0 : k \equiv 0(mod 5) }
A2 = { k \in R>0 : k \equiv 1(mod 5) }
A3 = { k \in R>0 : k \equiv 2(mod 5) }
A4 = { k \in R>0 : k \equiv 3(mod 5) }
A5 = { k \in R>0 : k \equiv 4(mod 5) }


1b) Same as above except k \in R.



2a) Using Fundamental Thm of Arithmetic,

Sp = {pn : n \in N, p is prime)

Let L, Sp, ... partition R.

where L = R - \bigcupSp



2b) Same as above except instead of L = R -..., R is instead Z (set of integers).
 
Physics news on Phys.org
Am I better off splitting these up into separate threads?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top