Let r be any rational number and define L = { x in Q: x < r }, the set of rational numbers less than r. Show that L is a Dedekind cut by proving the following properties:
A. There exists a rational number x in L and there exists a rational number y not in L. ( This proves L is nonempty and L is not equal to Q)
B. If x in L, then there exists z in L, such thatt x<z. ( Thus L does not contain a largest element)
C. If x in L, and if y is any rational number less than x, then y in L. ( Thus if L contains x, then L contains all the rational numbers less than x)
A. since r is a rational number both 2r and r/2 are rational numbers and r/2 < r (if r >0) and 2r < r (if r<0)
hence, take x = r/2 (if r>0) and take x=2r (if r<0) hence x belongs to L
now, r/2 > r (if r <0) and 2r > r (if r>0)
hence, take y = r/2 (if r<0) and take y = 2r (if r>0) hence y is a rational but does not belongs to L
B. if x is in L , then, x < r. since both x and r are rational so is (x+r) and so is (x+r)/2 and we know, x < (x+r)/2 < r
hence, take, z = (x+r)/2
C. x is in L , i.e. x<r and y<x
then, y<x and x<r and by order property and transitivity of "<" we have, y < r
hence y belongs to L
2. [14 marks] Rational Numbers The rational numbers, usually denoted Q are the set {n E R 3p, q ZAq&0An= Note that we've relaxed the requirement from class that gcd(p, q) = 1. (a) Prove that the sum of two rational numbers is also a rational number (b) Prove that the product of two rational numbers is also a rational number (c) Suppose f R R and f(x)= x2 +x + 1. Show that Vx e R xe Qf(x) Q...
In mathematics, a rational number is any number that can be expressed as the quotient or fraction p/q of two integers, p and q, with the denominator q not equal to zero. Since q may be equal to 1, every integer is a rational number. Define a class that can represent for a rational number. Use the class in a C++ program that can perform all of the following operations with any two valid rational numbers entered at the keyboard...
[9] Given any two real numbers x and y such that x < y, show that there exists a rational number q such that x < a <y.
Use the well-ordering principle of natural numbers to show that for any positive rational number x ∈ Q, there exists a pair of integers a, b ∈ N such that x = a/b and the only common divisor of a and b is 1.
C++ and/or using Xcode... Define a class of rational numbers. A rational number is a number that can be represented as the quotient of two integers. For example, 1/2, 3/4, 64/2, and so forth are all rational numbers. (By 1/2, etc., we mean the everyday meaning of the fraction, not the integer division this expression could produce in a C++ program). Represent rational numbers as two values of type int, one for the numerator and one for the denominator. Call...
Problem 4.4. Let D=Q\{0}, the set of all non-zero rational numbers. For all r, yED, define c*y = 4cy, the ordinary product of 4, 2 and y. (For example, (2)*(3) = 4(2)(3) = 24.) (1) Determine whether (D, *) is a group. (2) Justify your claim in (1) carefully.
Define four sets of integers Let P {0, 1), let Q {-11, 1, 5) , and Let R and S be arbitrary nonempty subsets of Z. Define an even indicator function F F: ZP by F(x) = (x + 1) mod 2 for x e Z That is, F(x) 1 if x is even, and F(x) = 0 if x is odd. or neither? Explain. a) Is F: Q P one-to-one, onto, both, or neither? Explain. b) Is F: (Pn...
Rational Number *In Java* A rational number is one that can be expressed as the ratio of two integers, i.e., a number that can be expressed using a fraction whose numerator and denominator are integers. Examples of rational numbers are 1/2, 3/4 and 2/1. Rational numbers are thus no more than the fractions you've been familiar with since grade school. Rational numbers can be negated, inverted, added, subtracted, multiplied, and divided in the usual manner: The inverse, or reciprocal of...
Please do exercise 129: Exercise 128: Define r:N + N by r(n) = next(next(n)). Let f:N → N be the unique function that satisfies f(0) = 2 and f(next(n)) =r(f(n)) for all n E N. 102 1. Prove that f(3) = 8. 2. Prove that 2 <f(n) for all n E N. Exercise 129: Define r and f as in Exercise 128. Assume that x + y. Define r' = {(x,y),(y,x)}. Let g:N + {x,y} be the unique function that...
(P(x),Q(y), R(z)), where P depends only 2. Let S be any surface with boundary curve C, and let F(x,y, z) on r, where Q depends only on y, and where R depends only on z. Show that F.dr 0 C (P(x),Q(y), R(z)), where P depends only 2. Let S be any surface with boundary curve C, and let F(x,y, z) on r, where Q depends only on y, and where R depends only on z. Show that F.dr 0 C