Answered

Westonci.ca offers fast, accurate answers to your questions. Join our community and get the insights you need now. Find reliable answers to your questions from a wide community of knowledgeable experts on our user-friendly Q&A platform. Get detailed and accurate answers to your questions from a dedicated community of experts on our Q&A platform.

In the cryptarithm sum shown, different letters represent different digits, and no leading digit can equal 0. What is the GREATEST possible numeric value represented by FAST?


RUN
+
RUN
______
FAST

Sagot :

sqdancefan

Answer:

  1872

Step-by-step explanation:

Solving cryptarithm sums requires consideration of the properties of numbers, addition facts in particular.

The largest possible value of F is 1. For that value, there are no choices for RUN that allow A to be 9, so its maximum value is 8. In order for A to be 8, R must be 9, so the largest digit available for S is 7, which requires U = 3. In order for S to be odd, N must be 5 or greater. The largest available digit is 6.

This gives RUN = 936; FAST = 1872.

_____

Additional comment

This is confirmed (suggested) by an exhaustive search. The least possible sum is RUN = 523; FAST = 1046.

Thank you for visiting. Our goal is to provide the most accurate answers for all your informational needs. Come back soon. Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. Your questions are important to us at Westonci.ca. Visit again for expert answers and reliable information.