Hard Math Problem: Who Can Do it?

[GroundOO]

oh crap I don't know what I've been talkin about, I gotta go to college classes now, If this is still around by 9:30pm (Central), I'll help.

Chris

V can't be odd, I don't know how E can be 0 and still find what Y is.

Good luck!!

 

[Nessoldaccount]

T * 6 <= 9

 

[Jazar]

T != 7 that would make N = 42.

Ness is right and the only way that would be satisfactory is if T = 1

 

[Mucman]

I think this is a better way to right the equations to factor in the carry-over:
(The C(x) correspond to to the carrover amount)


Y + 5E = Y
C1 + T + 5V = T
C2 + R + 5L = E
C3 + I + 5E = N
C4 + H + 5W = I
C5 + 6T = N

and be aware that:

C3 + I + 5E = C5 + 6T

 

[chess9]

Mucman: Right idea, but there can be no carryover to column 2, so C1 is not needed, or would be zero.

 

[Mucman]

I too have come to the conclusion that E = 0.

Even with the carry over using the value E= 8 c1 =4

plug that into the second equation c1 + T + 5V = T
which becomes 4 + 5V = number ending with T

take any value for V and the eqation never works. Also, they equation must include carry-overs because of eqation 4 : c3 + I + 5E = N

I think the only way we can find Y is that it will be the only number that we haven't used.

 

[zippy]

T=0

Therefore, if you multiply everything out, they all are 0. Therefore, 0+0+0....=0.

You doofuses, its a trick question! Or at least I think so...

BTW, I only read the first post...

 

[jaydee]

We are missing something here, because if E=0, then that would spell NINETYE, wouldn't it?

 

[chess9]

I think this is a zero sum problem. It can't be a functions problem. Just sheer logic. Otherwise, it would take forever. It seems that each column could easily add up to zero, which would mean that all numbers would be zero.

Edit: Zippy: Yes, I think so, good show.

Further edit: Of course, no number is supposed to be repeated according to our leader!

Further, further edit: On the other hand, Thirty should add up to 30 and ninety to 90, so all zeroes is not possible. My bad.

 

[chess9]

Jaydee: NO.

 

[Mucman]

Can we use the fact that T + N + H + W + I + E + R + L + V + Y = 45

 

[Engineer]

<< association between the letters and the digits in which each letter is associated with a unique digit, and vice-versa >>

would indicate that no TWO letters could have the same digit (in this case...zero) and no digit could have the same letter...Is this not so?

 

[br0wn]

FOUND IT !

T = 1
H = 9
I = 4
R = 2
Y = 5
W = 3
E = 0
L = 7
V = 6
N = 8

194215
130760
130760
130760
130760
130760
------
848015

Check for yourself.

 

[chess9]

Brown: Thirty must equal 30, ninety must equal 90, I believe. If not, then that's the answer.

Engineer: The directions suck.

 

[Jazar]

damn brown... I got all the way past the middle column (the hardest) and it looks like you've done it. Good show!

 

[jaydee]

Oh, I see, the columns don't line up right. My bad.

 

[Mucman]

good job brown! Now can you explain how you did it?

 

[Nessoldaccount]

Brown got it! Well...how he got it? Who knows. But if there are 10 numbers, and 10 letters...and we concluded that T=1 and E=0, that brings it to 8 and 8, or 64 possible combinations. Maybe he hit the jackpot

 

[beat mania]

nice, br0wn!
all I got was e = 0, t = 1, n = 7,8, or 9
I suck
unless you used a computer to do it, then you suck

 

[br0wn]

Ness, actually 8 numbers left would give 8! combinations, which is
40320 combinations if you try them all.

 

[Mucman]

brown... you still haven't said how you did it!

 

[chess9]

Ok, Brown, where'd you get the answer book?

 

[br0wn]

I am suck (or IS SUCK ?) according to beat mania.

Coz I use computer.

Basically I wrote a C program to explore all the possibilities of
10 number permutations, which is around 3.6 mill possibilities.
The program will print out the correct permutation if it matches
the description I gave to it
(took about 5 minutes to write this).

 

[beat mania]

I actually refrained from writing that program because I like to solve these problems. With my head, mind you

 

[Nessoldaccount]

LOL, go brown! I should have tried that!