Prove that if n is an integer and n^2 is even the n is even.

Solutions

Expert Solution

Sol.- Let n is an integer and is even.

To prove:- n is even

We will prove it by using method of contradiction.

Let us assume that n is an integer and is even but n is not even.i.e. n is odd.

Since n is odd

n = 2k + 1 , for some integer k.

[on squaring both sides]

which is not possible since is even.

So, this contradicts that the fact is even.

Hence our assumption that n is not even is wrong.

Thus, if n is an integer and is even then n is also even. Hence Proved.

Colby Messinger answered 1 year ago

Next > < Previous

Related Solutions

prove that if an even integer n is subtracted from an odd integer m. then m...

prove that if an even integer n is subtracted from an odd integer m. then m - n is odd.

Prove that τ(n) < 2 n for any positive integer n. This is a question in...

Prove that τ(n) < 2 n for any positive integer n. This is a question in Number theory

Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod...

Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod 4) or n ≡ 3 (mod 4), then n is not a perfect square.

prove or disprove .if n is a non negative integer, then 5 divides 2 ⋅ 4^n...

prove or disprove .if n is a non negative integer, then 5 divides 2 ⋅ 4^n + 3⋅9^n.

Let n be a positive integer. Prove that if n is composite, then n has a...

Let n be a positive integer. Prove that if n is composite, then n has a prime factor less than or equal to sqrt(n) . (Hint: first show that n has a factor less than or equal to sqrt(n) )

4. Let n ≥ 8 be an even integer and let k be an integer with...

4. Let n ≥ 8 be an even integer and let k be an integer with 2 ≤ k ≤ n/2. Consider k-element subsets of the set S = {1, 2, . . . , n}. How many such subsets contain at least two even numbers?

prove that every integer is either even or odd but never both.

Prove or disprove that 3|(n 3 − n) for every positive integer n.

1. Prove or Disprove: If n is a nonnegative integer, then 5 | (24n + 39n)

1. Prove or Disprove: If n is a nonnegative integer, then 5 | (2*4n + 3*9n)

Use mathematical induction to prove that for every integer n >=2, if a set S has...

Use mathematical induction to prove that for every integer n >=2, if a set S has n elements, then the number of subsets of S with an even number of elements equals the number of subsets of S with an odd number of elements. pleases send all detail solution.

Subjects