OMG THIS ONE IS WAY HARDER (i think) Which number supports the given conjecture? If the sum of the digits of a number is divisible by 9, then the number is also divisible by 9. A. 19 B. 54 C. 87 D. 109
@Demonx341 i kinda new the last one but this one is killing me
add up the digits of last option, what do u get ?
its not conjecture :O its already proven *tears* T_T
ill let them help you :P
im in k12
hey gane, r u good at adverb sith grade questions? im really confused
math theorems start out their lives as conjectures
it is a lol???
so did you add the digits of each number? and then divide by 9
but it said divide by nine twice
a) 1 + 9 = 10 , and 10 is not divisible by 9
but its the same for d
a and d have the same answer
are they divisible by 9 ?
no
the question is kind of ambiguous, indirectly all 4 statements support the conjecture
since the conjecture is true
that must be a stupid question to ask right after you saying they have same answer :O
right..
see what i mean
but i think they want the positive conjecture (not the contrapositive)
which of these is evidence of the positive conjecture .
whutt :O
strike off options a and d focus on options b and c
i didn't learn that i don't think
ok
addup digits for number in option b, wat do u get ?
12
which of these numbers is evidence for the claim : "if the sum of the digits of a number are divisible by 9, then the number is divisible by 9"
c?
so first you need to satisfy the hypothesis of that claim.
how on earth 5 and 4 add up to 12 ?
nope,
oops i thought it said 5 and 7
8 + 7 is not divisible by 9
9
is 9 divisible by 9 ?
so b
you should be confident its b)
i feel dumb + stupid = idiot = me
no, its just 'different' way of reading
hehe yeah its only a conjecture dont need to think of the opposite :)
or dumb + stupid + idiot = me XD that was easy and i did everthing wrong
how did u get dumb + stupid = idiot
everythng*
@MCLover1477 same here :3
a) and d) are evidence of the contrapositive version of the conjecture
the idiot must be stupid and dumb, i see you're from all those. keep up the good work :)
there is no contrapositive in conjecturs :D
a) c) d) are evidence of the contrapositive form of the conjecture. b) is evidence of the conjecture
sure, you can make a contrapositive form of a conjecture
lol @ganeshie8
i can make , but u dont need to consider it xD
if you prove the contrapositive form of the conjecture, that is equivalent to proving the original conjecture
but this is where you have to guess what the teacher had in mind :)
who is from k12 btw?
nvm...
Me
since there is only one answer to the question, that kind of narrows it down
what?
@ikram002p
what?
contrapositive follows the truth value of the given conditional, so yeah we can use examples that satisfy contrapositive
here is the contrapositive : If a number is not divisible by 9, then the sum of the digits of the number is not divisible by 9.
as long as you're not introduced to logic, your teacher is safe in giving ambiguous options
in other words, because you're not going to find an instance where the conjecture is false, since your conjecture is a theorem, every number is evidence of your conjecture
this is not the contrapositive xD its if the sum of digits of a number is not divisible by 9 then the number is not divisible by 9
take for example conjecture: every number is a product of primes. evidence 4 = 2 x 2 , and 2 , 2 are primes
that would be called negation ikram
every positive integer, except 1
4=4*1 so what xD
also called inverse
statement : if a, then b inverse : if NOT a, then NOT b converse : if b, then a contrapositive : if NOT b, then NOT a
anyways, i agree that given the context of the question (level, etc) , it should be b)
what im i wrong :O how
my point was that a), b) , c) and d) all support the conjecture, some indirectly
you're right in saying that below is not contrapositive its if the sum of digits of a number is not divisible by 9 then the number is not divisible by 9
here is the contrapositive : If a number is not divisible by 9, then the sum of the digits of the number is not divisible by 9.
your point is valid
so there is nothing more to say about that?
when a conjecture is a theorem, you won't be able to find any counter examples
lol nvm i have some reading problems xD
so the question itself should not exist
right, that was my point
so every number is evidence of a conjecture (a general conjecture about all numbers)
if its a theorem
yes i was kindof torn between being strictly correct versus helping the OP
hehe that makes a problem to me , like which is more important
but i think when you do math, you find conjectures usually in a direct way
most people search for positive theorems, not negations of conjectures
thats debatable
one more of conjecture in this post xD
yes that might be a conjecture about conjectures
`most people search for positive theorems, not negations of conjectures ` is a statistics survey question, not a conjecture ikram ;p
at least maybe at the basic level, when we start out doing math. we find positive patterns, patterns that numbers do have, rather than what they do not. but yes its debateable
we notice things like numbers are even , and are prime (not as quickly what they are not )
positive qualities
Join our real-time social learning platform and learn together with your friends!