Subject: Sequencing integers
Date: Sun, 18 Jan 1998 00:29:32 -0500
From: Tom Riddle

My name is Alexis and I was given a ditto in my Algebra I Honors class. There is one question that I understand but was wondering if there is an easy way to work the problem. The only way I know how to work it would take extremly too long. Here it is: In a string of numbers, two adjacent digits are considered as a two-digit number. For instance, the string 11012 contains the numbers 10, 11, and 12. What is the number of digits in the smallest string that contains all of the two-digit numbers from 10-99? Please help and thank you for any assistance you can give me. (I would also appreciate it if you would include an explanation on how the problem was solved)

|Reply| |Previous| |Next| |Down| |Exchange index| |Contents| |Store|

Copyright © 1996-2018 Alexander Bogomolny [an error occurred while processing this directive]
[an error occurred while processing this directive]