Question

In: Computer Science

1. Give a direct proof that if n is an odd integers, then n3 is also...

1. Give a direct proof that if n is an odd integers, then n3 is also an odd integer.

2. Give a proof by contradiction that the square of any positive single digit decimal integer cannot have more than two decimal digits.

Solutions

Expert Solution

Ans 1: For N to be an odd integer, N will be of the form 2n+1.

(2n+1)3= (2n)3+ (1)3 + 3*2n*1*(2n+1)

(2n)3 ---> even term

3*2n*1*(2n+1) -----> multiplication of even and odd is always even.

therefore, 3*2n*1(2n+1)+(2n)3 is an even term and adding 1 to this even term gives odd an odd number.

Hence, if n is odd integer, then its cube i.e. n3 is always an odd integer.

Ans 2: Assuming the square of the single digit number is of the form, 100*x +10*y +z, where x is not equal to 0.

For the above term to be minimum let x=1, y=0, z=0, then the resultant number is 1*100+0*10+0= 100

The square root of smallest 3 digit number 100, is 10 which is a smallest 2 digit number.

Since Square function is an increasing function, therefore the value for numbers less than 10 in a function of square will be less than 100.

Therefore, the above assumption does not hold true.

Hence, the square of any positive single digit decimal integer cannot have more than two decimal digits.


Related Solutions

3. To begin a proof by contradiction for “If n is even then n+1 is odd,”...
3. To begin a proof by contradiction for “If n is even then n+1 is odd,” what would you “assume true? 4. Prove that the following is not true by finding a counterexample. “The sum of any 3 consecutive integers is even" 5. Show a Proof by exhaustion for the following: For n = 2, 4, 6, n²-1 is odd 6.  Show an informal Direct Proof for “The sum of 2 even integers is even.” Recursive Definitions 7.  The Fibonacci Sequence is...
(a) Use a direct proof to show that the product of two odd numbers is odd....
(a) Use a direct proof to show that the product of two odd numbers is odd. (b) Prove that there are no solutions in integers x and y to the equation 2x2 + 5y2 = 14. (c) Prove that the square of an even number is an even number using (a) direct proof, (b) an indirect proof, and (c) a proof by contradiction. Q. 2. Maximum score = 25 (parts (a) 9 points, part (b-i) and (b-ii) 8 points) (a)...
Let P(n) := ” If n^3 is odd then n is also odd.” I.e., if ∃k...
Let P(n) := ” If n^3 is odd then n is also odd.” I.e., if ∃k ∈ Z, n3 = 2k + 1, ∃b ∈ Z, n = 2b + 1 a) Prove P(n) by contraposition b) Prove P(n) contradiction c) Prove P(n) using induction
Prove that the following is true for all positive integers n: n is odd if and...
Prove that the following is true for all positive integers n: n is odd if and only if n2 is odd.
Jojo is given N integers, A1, A2, ..., AN by his teacher. His teacher also give...
Jojo is given N integers, A1, A2, ..., AN by his teacher. His teacher also give him 2M integers, L1,L2,...,LM and R1,R2,...,RM. For each i from 1 to M, his teacher asked him to calculate the sum of odd index numbers from index Li to Ri. For example if Li = 3 and Ri = 7, then he has to calculate the value of (A3 + A5 + A7). Help him by making the program to calculate it quickly! Format...
Use a direct proof to prove that 6 divides (n^3)-n whenever n is a non-negative integer.
Use a direct proof to prove that 6 divides (n^3)-n whenever n is a non-negative integer.
Write a combinatorial proof for 1 n + 2 ( n − 1 ) + 3...
Write a combinatorial proof for 1 n + 2 ( n − 1 ) + 3 ( n − 2 ) + ⋯ + ( n − 1 ) 2 + n 1 = ( n + 2 choose 3 ) .
write code to count the number of odd integers in an array of 100 random integers...
write code to count the number of odd integers in an array of 100 random integers in the range [0,99].
Give a direct proof for the 2nd Isormorphism Theorem of bi-modules over rings.
Give a direct proof for the 2nd Isormorphism Theorem of bi-modules over rings.
give a constructive proof of fn = Q^n + P^n/ Q - P , where Q...
give a constructive proof of fn = Q^n + P^n/ Q - P , where Q is the positive root and P is negative root of x^2 - x - 1= 0 fn is nth term of fibonacci sequence, f1 = 1 f2, f3 = f2 +f1, ... fn= fn_1 +fn_2 , n>2
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT