Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (anonymous):

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

OpenStudy (anonymous):

@Demonx341 i kinda new the last one but this one is killing me

ganeshie8 (ganeshie8):

add up the digits of last option, what do u get ?

OpenStudy (ikram002p):

its not conjecture :O its already proven *tears* T_T

OpenStudy (anonymous):

ill let them help you :P

OpenStudy (anonymous):

im in k12

OpenStudy (anonymous):

hey gane, r u good at adverb sith grade questions? im really confused

OpenStudy (perl):

math theorems start out their lives as conjectures

OpenStudy (anonymous):

it is a lol???

OpenStudy (perl):

so did you add the digits of each number? and then divide by 9

OpenStudy (anonymous):

but it said divide by nine twice

OpenStudy (perl):

a) 1 + 9 = 10 , and 10 is not divisible by 9

OpenStudy (anonymous):

but its the same for d

OpenStudy (anonymous):

a and d have the same answer

ganeshie8 (ganeshie8):

are they divisible by 9 ?

OpenStudy (anonymous):

no

OpenStudy (perl):

the question is kind of ambiguous, indirectly all 4 statements support the conjecture

OpenStudy (perl):

since the conjecture is true

ganeshie8 (ganeshie8):

that must be a stupid question to ask right after you saying they have same answer :O

OpenStudy (anonymous):

right..

OpenStudy (anonymous):

see what i mean

OpenStudy (perl):

but i think they want the positive conjecture (not the contrapositive)

OpenStudy (perl):

which of these is evidence of the positive conjecture .

OpenStudy (ikram002p):

whutt :O

ganeshie8 (ganeshie8):

strike off options a and d focus on options b and c

OpenStudy (anonymous):

i didn't learn that i don't think

OpenStudy (anonymous):

ok

ganeshie8 (ganeshie8):

addup digits for number in option b, wat do u get ?

OpenStudy (anonymous):

12

OpenStudy (perl):

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"

OpenStudy (anonymous):

c?

OpenStudy (perl):

so first you need to satisfy the hypothesis of that claim.

ganeshie8 (ganeshie8):

how on earth 5 and 4 add up to 12 ?

OpenStudy (perl):

nope,

OpenStudy (anonymous):

oops i thought it said 5 and 7

OpenStudy (perl):

8 + 7 is not divisible by 9

OpenStudy (anonymous):

9

ganeshie8 (ganeshie8):

is 9 divisible by 9 ?

OpenStudy (anonymous):

so b

OpenStudy (perl):

you should be confident its b)

OpenStudy (anonymous):

i feel dumb + stupid = idiot = me

OpenStudy (perl):

no, its just 'different' way of reading

OpenStudy (ikram002p):

hehe yeah its only a conjecture dont need to think of the opposite :)

OpenStudy (anonymous):

or dumb + stupid + idiot = me XD that was easy and i did everthing wrong

ganeshie8 (ganeshie8):

how did u get dumb + stupid = idiot

OpenStudy (anonymous):

everythng*

OpenStudy (ikram002p):

@MCLover1477 same here :3

OpenStudy (perl):

a) and d) are evidence of the contrapositive version of the conjecture

ganeshie8 (ganeshie8):

the idiot must be stupid and dumb, i see you're from all those. keep up the good work :)

OpenStudy (ikram002p):

there is no contrapositive in conjecturs :D

OpenStudy (perl):

a) c) d) are evidence of the contrapositive form of the conjecture. b) is evidence of the conjecture

OpenStudy (perl):

sure, you can make a contrapositive form of a conjecture

OpenStudy (anonymous):

lol @ganeshie8

OpenStudy (ikram002p):

i can make , but u dont need to consider it xD

OpenStudy (perl):

if you prove the contrapositive form of the conjecture, that is equivalent to proving the original conjecture

OpenStudy (perl):

but this is where you have to guess what the teacher had in mind :)

OpenStudy (anonymous):

who is from k12 btw?

OpenStudy (ikram002p):

nvm...

OpenStudy (anonymous):

Me

OpenStudy (perl):

since there is only one answer to the question, that kind of narrows it down

OpenStudy (anonymous):

what?

OpenStudy (anonymous):

@ikram002p

OpenStudy (anonymous):

what?

ganeshie8 (ganeshie8):

contrapositive follows the truth value of the given conditional, so yeah we can use examples that satisfy contrapositive

OpenStudy (perl):

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.

ganeshie8 (ganeshie8):

as long as you're not introduced to logic, your teacher is safe in giving ambiguous options

OpenStudy (perl):

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

OpenStudy (ikram002p):

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

OpenStudy (perl):

take for example conjecture: every number is a product of primes. evidence 4 = 2 x 2 , and 2 , 2 are primes

ganeshie8 (ganeshie8):

that would be called negation ikram

OpenStudy (perl):

every positive integer, except 1

OpenStudy (ikram002p):

4=4*1 so what xD

OpenStudy (perl):

also called inverse

ganeshie8 (ganeshie8):

statement : if a, then b inverse : if NOT a, then NOT b converse : if b, then a contrapositive : if NOT b, then NOT a

OpenStudy (perl):

anyways, i agree that given the context of the question (level, etc) , it should be b)

OpenStudy (ikram002p):

what im i wrong :O how

OpenStudy (perl):

my point was that a), b) , c) and d) all support the conjecture, some indirectly

ganeshie8 (ganeshie8):

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

OpenStudy (perl):

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.

ganeshie8 (ganeshie8):

your point is valid

OpenStudy (perl):

so there is nothing more to say about that?

ganeshie8 (ganeshie8):

when a conjecture is a theorem, you won't be able to find any counter examples

OpenStudy (ikram002p):

lol nvm i have some reading problems xD

ganeshie8 (ganeshie8):

so the question itself should not exist

OpenStudy (perl):

right, that was my point

OpenStudy (perl):

so every number is evidence of a conjecture (a general conjecture about all numbers)

OpenStudy (perl):

if its a theorem

ganeshie8 (ganeshie8):

yes i was kindof torn between being strictly correct versus helping the OP

OpenStudy (ikram002p):

hehe that makes a problem to me , like which is more important

OpenStudy (perl):

but i think when you do math, you find conjectures usually in a direct way

OpenStudy (perl):

most people search for positive theorems, not negations of conjectures

ganeshie8 (ganeshie8):

thats debatable

OpenStudy (ikram002p):

one more of conjecture in this post xD

OpenStudy (perl):

yes that might be a conjecture about conjectures

ganeshie8 (ganeshie8):

`most people search for positive theorems, not negations of conjectures ` is a statistics survey question, not a conjecture ikram ;p

OpenStudy (perl):

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

OpenStudy (perl):

we notice things like numbers are even , and are prime (not as quickly what they are not )

OpenStudy (perl):

positive qualities

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!