Home
Class 10
MATHS
Use proof by contradiction to prove that...

Use proof by contradiction to prove that if for an integer a, `a^2` is divisible by 3, then a is divisible by 3.

Promotional Banner

Topper's Solved these Questions

  • PROOFS IN MATHEMATICS

    SUBHASH PUBLICATION|Exercise EXERCISE A1.5|11 Videos

  • PROBABILITY

    SUBHASH PUBLICATION|Exercise EXERCISE 14.1|54 Videos

  • QUADRATIC EQUATION

    SUBHASH PUBLICATION|Exercise EXERCISE 10.3|9 Videos

Similar Questions

Explore conceptually related problems

Use proof by contradiction to prove that if for an integer a, a^2 is even, then so is a.

Prove by induction that if n is a positive integer not divisible by 3 , then 3^(2n)+3^(n)+1 is divisible by 13 .

Write the converse and contrapositive of " if a number is divisible by 9 then its is divisible by 3"

If n is a +ve integer, 4^(n)-3 n-1 is divisible by

3^(2n+2)-8n-9 is divisible by 8.

The negation of the statement ' 72 is divisible by 2 and 3' is

For all integers n ge 1 , which of the following is divisible by 9

For any positive integer n, prove that (n^(3) - n) is divisible by 6.

Prove that 3^(2n)+24n-1 is divisible by 32 .

The negation of the statement ''72 is divisible by 2 and 3'' is