The 1 ← 2 machine:
Put 13 dots into the right most box of a 1 ← 2 machine. In the final display, what is the number of dots in these boxes?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 dot → 0 0 0 1
2 dots → 0 0 1 0
3 dots → 0 0 1 1
4 dots → 0 1 0 0
5 dots → 0 1 0 1
6 dots → 0 1 1 0
7 dots → 0 1 1 1
8 dots → 1 0 0 0
9 dots → 1 0 0 1
10 dots → 1 0 1 0
11 dots → 1 0 1 1
12 dots → 1 1 0 0
13 dots → 1 1 0 1
Given that you are trying to convey the idea of there being 4 boxes, I feel that your solution should contain 4 boxes for each number of dots.
Log in to reply
I will edit my solution like you showed with the way you formatted your L a T e X . Thank you for your example and feedback! Long way to go on improving the quality of these questions... I am aware.
the only way to do this is hard core visualization :octocat:
Problem Loading...
Note Loading...
Set Loading...
This "machine" just converts base 10 to binary. The binary representation of 13 is 1101 .