Consider any finite mantissa of , let it be where each . Let be a factor of , hence for some .
The mantissa can be expressed as a summation
. Substitute
to get
. As this summation only uses powers of
in the denominator upto a finite
, the mantissa is represented in base
finitely as well.
Comment in case of any doubts.
2. Prove that if a and b are positive integers such that a is a factor...
Prove by induction that the sum of any sequence of 3 positive consecutive integers is divisible by 3. Hint, express a sequence of 3 integers as n+(n+1)+(n+2).
3.4. Suppose a and b are positive integers. Prove that, if aſb, then a < b.
Prove or give a counterexample: For any integers b and c and any positive integer m, if b ≡ c (mod m) then b + m ≡ c (mod m).
If a and b are positive integers, then gcd (a,b) = sa + tb. Prove that either s or t is negative.
9. Prove that for any positive integers a, b with a >1, b>1 and (a, b) have log,(a) is irrational. (You may use Euclid's Lemma, but not FTA.) 1, we
correction ---> gcd(a,b) = lcm(a,b) ( Let a and be positive integers. Prove that god(a,b) = lama,b) if and only if a
Prove that there exists infinitely many numbers of the form an = n(n+1)/2 , for some positive integer n, such that every pair an, am (for n != m) are relatively prime. [Hint: Assume there exists a finite sequence an1 < an2 < an3 < . . . < anm, where nj are increasing positive integers. Show that using those numbers we can construct a new number that fulfills the requirements.]
Prove: If n and a are positive integers and n=(a^2+ 1)/2, then n is the sum of the squares of two consecutive integers (that is, n=k^2+ (k+1)^2 for some integer k).
1. Let a, b,cE Z be positive integers. Prove or disprove each of the following (a) If b | c, then gcd(a, b) gcd(a, c). (b) If b c, then ged(a., b) < gcd(a, c)
1. Prove the following statement by mathematical induction. For all positive integers n. 2++ n+1) = 2. Prove the following statement by mathematical induction. For all nonnegative integers n, 3 divides 22n-1. 3. Prove the following statement by mathematical induction. For all integers n 27,3" <n!