Please prove by contradiction. Suppose a and b are positive integers. If a
Did you mean b=1? Because, as it is, you can't prove it because it's not true. If a=1, then b couldn't be anything.
Or did you mean a<b?
sorrrrryyyyyyyy my mistake
Ok...so to use proof by contradiction, you have to assume that the opposite is true and show that there's no way that could happen. So if a isn't 1, it has to be 2 or more. Why doesn't that make sense?
it does like i know how to prove it but then when i write it down it doesnt come out nicely. Like it doesnt flow
Show me what you have and I'll tell you how to improve it.
ummmm lets say a=0 is that possible or its only all numbers
all natural numbers*
It says a and b are positive integers. So a and b can only be 1,2,3,4,5,etc.
okkkkk
a and b are positive integers so a>0 and b>0 a>b>0 if a is not equal to 1 i.e. a>1, ab<3 a<3/b 1<a<3/b 1<3/b b<3 a>1 and b<3 when a>3, a >b which contrdicts b>a So, a=1
Let a and b be positive integers. Suppose a<b and ab<3 and a>1 and a<1 or a>1. Since a is a positive number a cant be less than 1 so a>1
b<3 and b>0 and it is +ve integer so b can only be 2,1 a>1 so a can only be 1,2,3,4,5...... for a>2 a=3,4,5,6,.... b <a so it is contradiction
umm like i didnt follow his proof kinda
Join our real-time social learning platform and learn together with your friends!