How Do You Decode the Cryptarithm (THIS)/(CLOSE) = 5/12?

  • Thread starter Thread starter K Sengupta
  • Start date Start date
AI Thread Summary
The discussion revolves around solving a cryptarithm where each letter represents a unique decimal digit, with the condition that neither T nor C can be zero. The equation presented is (THIS)/(CLOSE) = 5/12. A participant points out that a previous answer was invalid due to the requirement for different digits. The conversation includes a request for clarification on how a specific answer was derived, indicating an interest in the problem-solving process.
K Sengupta
Messages
113
Reaction score
0
Solve this cryptarithm, where each of the letters represents a different decimal digit from 0 to 9. None of T and C is zero.

(THIS)/(CLOSE) = 5/12
 
Physics news on Phys.org
Edit: oops, forgot digits are supposed to be different... :blushing:

fixed:
8960/21504
 
Last edited:
yyat said:
4170/10008

That answer is invalid due to the original problem constraints.

Edit: Haha. Do you mind if I ask how you got that answer?
 
Last edited:
t=8 h=9 i=6 s=0 c=2 l=1 o=5 e=4
this=8960 close=21504
this*12=107520 close*5=107520
 

Similar threads

What Digits Solve the Cryptarithm (THINE)/(EVENLY) = 2/15?
Replies
5
Views
3K
Long division with zero to nine substitution
Replies
1
Views
4K
Very tricky problem from Spivak's Calculus, Ch. 4 & 5: Graphs/Limits
Replies
32
Views
3K
Summed exponents for a 8- digit positive decimal integer
Replies
2
Views
3K
Multiplying six by two gets twelve
Replies
1
Views
3K
Photo Contest - I'm Ready For My Close-Up (7/25-7/31)
Replies
23
Views
2K
(4-digit number)*(6-digit number) equals a factorial
Replies
1
Views
4K
How does one convert a decimal float to binary using the multiply by 2 method?
Replies
4
Views
2K
Photo Contest - The Dirty Dozen (11/9-11/15)
Replies
14
Views
3K
Why are Mod-10 & Mod-5 decade counters while Mod-6 & Mod-8 not?
Replies
10
Views
4K

Hot Threads

Recent Insights

Back
Top