# discrete math

posted by .

1)prove that if x is rational and x not equal to 0, then 1/x is rational.

2) prove that there is a positive integers that equals the sum of the positive integers not exceeding it. Is your proof constructive or nonconstructive?

For 1) use the definition of a non-zero rational number.
Defn: A non-zero rational is any number that can be expressed as p/q where p and q are non-zero integers.
If p/q is rational, then how about q/p?

For 2) you should be able to supply both a constructive and non-consructive proof.
Since the sum of any finite set of integers is an integer, there exists an integer for the sum of the first +n integers.
There is a formula for this, but I'll let you work on this.

## Similar Questions

1. ### Math

I just wanted to check my answers with anyone willing to take the time. Identify all sets that -3/4 belongs to: a.whole #s, integers, rational #s b.rational #s c.integers, rational #s d.odd #s, whole #s, integers, rational #s Ithought …
2. ### discrete math

If a and b are positive integers, prove that; ab = gcd(a,b)*lcm(a,b).
3. ### discrete math

Let A= {for all m that's an element of the integers | m=3k+7 for some k that's an element of positive integers}. Prove that A is countably infiite. Note: you must define a function from Z+ to A, and then prove that the function you …
4. ### math

Find the sum of all positive integers m such that 2^m can be expressed as sums of four factorials (of positive integers). Details and assumptions The number n!, read as n factorial, is equal to the product of all positive integers …
5. ### discrete math

Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?
6. ### math

Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?