Processing math: 100%
Google
 
Web unafbapune.blogspot.com

Thursday, November 29, 2012

 

Ex 1.7 a=bq+r

Division with remainder property:

Let a,bZ with b>0. Then there exist unique q,rZ such that a=bq+r and 0r<b.

Generalized division with remainder property:

Let a,bZ with b>0, and let xR. Then there exist unique q,rZ such that a=bq+r and r[x, x+b).

Show that the generalized division with remainder property also holds for the interval (x, x+b]. Does it hold in general for the intervals [x, x+b] or (x, x+b) ?





== Attempt ==

Consider the interval (x, x+b], which contains exactly b integers, namely x+1, ...,x+b. Applying the division with remainder property with a(x+1) in place of a:
  a(x+1)=bq+ra=bq+r+x+1
Let r=r+x+1. Given r[0, b),
  r{0, ..., b1}r{x+1, ...,x+1+b1}={x+1, ...,x+b}r(x, x+b]
In other words, the generalized division with remainder property holds for the interval (x, x+b].

Consider the interval [x, x+b], which contains integers:
  {x, ...,x+b1,x+b}
In particular, when x is an integer, this set will contain exactly b+1 integers, and therefore the interval [x, x+b] does not hold in general. (It would hold, however, in the special case when x is not an integer, since then the set would contain exactly b integers. Do you see why ?)

Similarly, consider the interval (x, x+b), which contains integers:
  {x+1, ...,x+b1,x+b1}
In particular, when x is an integer, this set will contain exactly b1 integers, and therefore the interval (x, x+b) does not hold in general. (It would hold, however, in the special case when x is not an integer, since then the set would contain exactly b integers. Do you see why ?)


Comments: Post a Comment

<< Home

This page is powered by Blogger. Isn't yours?