Partitioning number systems into sets

  • Thread starter Thread starter MathDude
  • Start date Start date
  • Tags Tags
    Sets Systems
Click For Summary
SUMMARY

This discussion focuses on partitioning number systems into sets, specifically the real numbers and integers. The user proposes various partitions using modular arithmetic, defining five sets of positive integers based on their equivalence classes modulo 5. The Fundamental Theorem of Arithmetic is referenced for partitioning real numbers into sets of prime numbers. The user contemplates whether to separate these topics into distinct threads for clarity.

PREREQUISITES
  • Understanding of modular arithmetic and equivalence classes
  • Familiarity with the Fundamental Theorem of Arithmetic
  • Knowledge of real numbers, integers, and their properties
  • Basic set theory concepts
NEXT STEPS
  • Research advanced partitioning techniques in set theory
  • Explore the implications of the Fundamental Theorem of Arithmetic in number theory
  • Learn about different number systems and their properties
  • Investigate modular arithmetic applications in computer science
USEFUL FOR

Mathematicians, educators, students studying number theory, and anyone interested in advanced set theory and partitioning methods.

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?
 

Similar threads

Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 45 ·
2
Replies
45
Views
4K
Replies
4
Views
3K