Proving a Division Algorithm for Real Numbers?

  • Thread starter Thread starter Doom of Doom
  • Start date Start date
  • Tags Tags
    Algorithm Division
Click For Summary
To prove a Division Algorithm for real numbers, one must demonstrate that for any real numbers x and α, there exist unique integers k and real numbers δ such that x = kα + δ, with 0 ≤ δ < α. The uniqueness can be shown by assuming two different representations and deriving a contradiction. To establish existence, it is suggested to consider the sequence na for n = 1, 2, ..., which is unbounded, ensuring that for some n, na exceeds x. By determining the largest integer k such that kα ≤ x, one can express x in the required form. The proof can be simplified by letting k equal the floor of x/α.
Doom of Doom
Messages
85
Reaction score
0
How might I prove a Division Algorithm for the Real numbers?

That is to say, if x, \alpha \in \mathbb{R}, then x=k \alpha + \delta for some k \in \mathbb{Z}, \delta \in \mathbb{R} with 0 \leq \delta &lt; \alpha where k, \delta are unique.
 
Physics news on Phys.org
Assume that it is not unique, subtract one representation from the other. The resultant equation is obviously false.
 
Yeah, but how can I show existence?
 
Doom of Doom said:
Yeah, but how can I show existence?

The sequence na for n=1,2,... is unbounded. Therefore for some n, na>x. Find lowest bound, subtract 1 and you will have k. ka<=x, (k+1)a>x, so x-ka(remainder)<a
 
or even more straightforward, let k = floor(x/a)
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K