Question

3. Identify the hypothesis and conclusion in the following statements. Then, find a counter example showing...

3. Identify the hypothesis and conclusion in the following statements. Then, find a counter example showing that the statement is false. Here n, m, and p are originally assumed to be integers.
Statement 1. If m and n are integers, then m/n is an integer.


Statement 2. If m and n are positive integers, then m - n is a positive integer.


Statement 3. If p is an odd prime number, then p^2 + 2 is a prime number.


Statement 4. If n - m is an even integer, then n and m are even integers.

Homework Answers

Answer #1

Statement 1: This is true if n is a multiple of m then m/n is always an integer. Otherwise not possible. As for example let m=2 and n=3, then 2/3 is not a integer.

Statement 2:this is true only when m> n. Otherwise not possible. As for example, consider m=1,n=2 then m-n= - 1, which is a negative integer.

Statement 3: this is always false. Now we consider p=5, then 5^2+2=27, which is not a prime number because it's divisors are 1,3,9,27. But we know that a prime number has only two divisors namely 1,p(prime). So this statement is false.

Statement 4: this is false always. Now we consider n=5, m=3 then 5-3=2, a even number but 5,3 are not even. Hence it is false.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Statement 3. If m is an even integer, then 3m + 5 is an odd integer....
Statement 3. If m is an even integer, then 3m + 5 is an odd integer. a. Play with the statement - i.e., Look at/test a few examples. (See if there are any counter-examples.) b. Write a proof of this statement. (Hint: 5 = 4 + 1 = 2(2) + 1) Remark 1. Let's recap some important properties about odd and even that we have seen (in notes and this activity): i. If a and b are even, then ab...
1. Give a direct proof that the product of two odd integers is odd. 2. Give...
1. Give a direct proof that the product of two odd integers is odd. 2. Give an indirect proof that if 2n 3 + 3n + 4 is odd, then n is odd. 3. Give a proof by contradiction that if 2n 3 + 3n + 4 is odd, then n is odd. Hint: Your proofs for problems 2 and 3 should be different even though your proving the same theorem. 4. Give a counter example to the proposition: Every...
1. Identify and correct the errors in each of the following statements: a) for (a =...
1. Identify and correct the errors in each of the following statements: a) for (a = 25, a <= 1, a--); {printf("%d\n", a);} b) The following code should print whether a given integer is odd or even: switch (value) {case (value % 2 == 0):puts("Even integer");case (value % 2 != 0):puts("Odd integer");} c) The following code should calculate incremented salary after 10 years: for (int year = 1; year <= 10; ++year) {double salary += salary * 0.05;}printf("%4u%21.2f\n", year, salary);...
Prove or disprove the following statements. Remember to disprove a statement you have to show that...
Prove or disprove the following statements. Remember to disprove a statement you have to show that the statement is false. Equivalently, you can prove that the negation of the statement is true. Clearly state it, if a statement is True or False. In your proof, you can use ”obvious facts” and simple theorems that we have proved previously in lecture. (a) For all real numbers x and y, “if x and y are irrational, then x+y is irrational”. (b) For...
write the following sentences as quantified logical statements, using the universal and existential quantifiers, and defining...
write the following sentences as quantified logical statements, using the universal and existential quantifiers, and defining predicates as needed. Second, write the negations of each of these statements in the same way. Finally, choose one of these statements to prove. If it is true, prove it, and if it is false, prove its negation. Your proof need not use symbols, but can be a simple explanation in plain English. 1. If m and n are positive integers and mn is...
How to measure the time complexity of an algorithm? Identify an important operation in the algorithm...
How to measure the time complexity of an algorithm? Identify an important operation in the algorithm that is executed most frequently. Express the number of times it is executed as a function of N. Convert this expression into the Big-O notation. A. For each of the three fragments of code, what is its worst-case time complexity, in the form "O(…)". (Use the given solution to the first problem as a model)                 //----------------- This is a sample problem – solved ------...
Prove the following statements: 1- If m and n are relatively prime, then for any x...
Prove the following statements: 1- If m and n are relatively prime, then for any x belongs, Z there are integers a; b such that x = am + bn 2- For every n belongs N, the number (n^3 + 2) is not divisible by 4.
a. Find an algorithm for solving the following problem: Given a positive integer n, find the...
a. Find an algorithm for solving the following problem: Given a positive integer n, find the list of positive integers whose product is the largest among all the lists of positive integers whose sum is n. For example, if n is 4, the desired list is 2, 2 because 2 × 2 is larger than 1 × 1 × 1 × 1, 2 × 1 × 1, and 3 × 1. If n is 5, the desired list is 2,...
For each of the following statements decide whether they are True or False and give a...
For each of the following statements decide whether they are True or False and give a short argument if True, or counter example if False. (1) ∀n ∈ Z, ∃m ∈ Z, n + m ≡ 1 mod 2. (2) ∀n ∈ Z, ∃m ∈ Z, (2n + 1)^2 = 2m − 1. (3) ∃n ∈ Z, ∀m > n, m^2 > 100m.
4. 3323 A prime number can be divided, without a remainder, only by itself and by...
4. 3323 A prime number can be divided, without a remainder, only by itself and by 1. Write a code segment to determine if a defined positive integer N is prime. Create a list of integers from 2 to N-1. Use a loop to determine the remainder of N when dividing by each integer in the list. Set the variable result to the number of instances the remainder equals zero. If there are none, set result=0 (the number is prime)....
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT