haas:fall2020:unix:projects:pctx
Differences
This shows you the differences between two versions of the page.
haas:fall2020:unix:projects:pctx [2020/03/16 10:12] – external edit 127.0.0.1 | haas:fall2020:unix:projects:pctx [2020/08/09 14:21] (current) – wedge | ||
---|---|---|---|
Line 4: | Line 4: | ||
</ | </ | ||
- | ======Project: | + | {{page>haas:fall2020:common:projects:pctx# |
- | + | ||
- | =====Errata===== | + | |
- | + | ||
- | * revision #: < | + | |
- | + | ||
- | =====Note===== | + | |
- | This is a generic project page that may be used for many different pct# projects, as a result, you will see mention of ' | + | |
- | + | ||
- | For example, if you are working on pct1, when you see an a project reference of " | + | |
- | + | ||
- | =====Objective===== | + | |
- | To continue to cultivate your problem solving, critical thinking, analytical, and observation skills. | + | |
- | + | ||
- | The aim here is on observation, | + | |
- | =====Background===== | + | |
- | The true nature of problem solving frequently involves critical thinking, analytical, and observation skills. Where problems are not solved by memorizing some pre-defined set of answers and regurgitating them mindlessly, but in crafting an elaborate solution from subtle cues and tested, experimental realizations. | + | |
- | + | ||
- | This project puts you in contact with such endeavours. | + | |
- | + | ||
- | ====Long Division==== | + | |
- | Letter division is a category of logic problem where you would take an ordinary math equation (in long form), and substitute all the numbers for letters, thereby in a direct sense masking the numeric values present that correctly enable the problem to work from start to completion. It is your task, through exploring, experimenting, | + | |
- | + | ||
- | We will be focusing on long division, something you learned (and perhaps last experienced, | + | |
- | + | ||
- | There is also a logical/ | + | |
- | + | ||
- | Division is unique in that it produces two ' | + | |
- | + | ||
- | Here is an example (using numbers): | + | |
- | + | ||
- | First up, we're going to divide 87654321 (the dividend) by 1224 (the divisor). Commonly, especially if punching into a calculator, we might express that equation as: | + | |
- | + | ||
- | < | + | |
- | 87654321/ | + | |
- | </ | + | |
- | + | ||
- | Or in a language like C, assigning the quotient to the variable **x** (an **int**eger): | + | |
- | + | ||
- | <code c> | + | |
- | x = 87654321 / 1224; | + | |
- | </ | + | |
- | + | ||
- | But, we're not actually interested in the ' | + | |
- | + | ||
- | < | + | |
- | 71613 | + | |
- | | + | |
- | 1224 | 87654321 | + | |
- | -8568 | + | |
- | | + | |
- | 1974 | + | |
- | | + | |
- | ==== | + | |
- | | + | |
- | -7344 | + | |
- | | + | |
- | 1592 | + | |
- | | + | |
- | ==== | + | |
- | | + | |
- | -3672 | + | |
- | | + | |
- | 9 | + | |
- | </ | + | |
- | + | ||
- | Here we obtain the results (focusing on the quotient up top; as the remainder quite literally is what remains once we're done- we're specifically NOT delving into decimal points, but instead doing integer division, which as previously stated has MANY important applications in computing) through a step by step process of seeing how many times our divisor (1224) best and in the smallest fashion fits into some current value of the dividend (or intermediate result thereof). | + | |
- | + | ||
- | For instance, seeking the smallest "best fit" of 1224 into 87654321, we find that 1224 fits best SEVEN times (1224 * 7 = 8568, which is the CLOSEST we can get to 8765... 1224 * 8 = 9792, which would be too big (and way too small for 87654). Clearly, we are seeking those values that best fit within a multiple of 0-9, staying away from double digits of multiplication (although, we COULD do it that way and still arrive at the same end result). | + | |
- | + | ||
- | So: 8765-8568 = 197. | + | |
- | + | ||
- | We have our first result, yet: there' | + | |
- | + | ||
- | The next available, unprocessed digit in 4321 is ' | + | |
- | + | ||
- | We now see how many times (via single digit multiplication), | + | |
- | + | ||
- | So: 1974-1224 = 750. | + | |
- | + | ||
- | And we keep repeating the process until there are no more digits from the dividend to drop down; at which point, we are left with a remainder (in the above problem, the lone ' | + | |
- | + | ||
- | Clearly it is important to have a handle on and understanding of the basic long division process before attempting a letter division problem. So, be sure to try your hand at a few practice problems before proceeding. | + | |
- | + | ||
- | ====Letter Division: an example==== | + | |
- | Following will be a sample letter division problem, and a documented work through of it, much as you will be doing for this project (and to be sure: the aim here is not merely to solve it, but to DOCUMENT HOW YOU SOLVED IT. You might want to keep notes as you go along to save you time and sanity). | + | |
- | + | ||
- | Here goes: | + | |
- | + | ||
- | < | + | |
- | GLJK | + | |
- | +--------- | + | |
- | KJKK | GLMBRVLR | + | |
- | | + | |
- | ===== | + | |
- | | + | |
- | -OKVKG | + | |
- | | + | |
- | JJGKL | + | |
- | | + | |
- | ===== | + | |
- | | + | |
- | -JKRKB | + | |
- | | + | |
- | VKMK | + | |
- | + | ||
- | letters: BGJKLMOPRV | + | |
- | </ | + | |
- | + | ||
- | First off, note how this is NO DIFFERENT from the numeric problem above: just instead of numbers, which we've associated some concepts with, here we have letters (each letter maps to a unique number, 0-9). The trick will be to figure out which letter maps to which number. | + | |
- | + | ||
- | So, let us begin. | + | |
- | + | ||
- | One aim is to obtain the key to the puzzle, the mapping of the letters to numbers, so I will typically set up an answer key as follows: | + | |
- | + | ||
- | | 0 | | | + | |
- | | 1 | | | + | |
- | | 2 | | | + | |
- | | 3 | | | + | |
- | | 4 | | | + | |
- | | 5 | | | + | |
- | | 6 | | | + | |
- | | 7 | | | + | |
- | | 8 | | | + | |
- | | 9 | | | + | |
- | + | ||
- | Another thing I like to do is set up a more visual representation of what each letter COULD be. I do so in the following form: | + | |
- | + | ||
- | < | + | |
- | B = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | G = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | J = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | K = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | L = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | M = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | O = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | P = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | R = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | V = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | </code> | + | |
- | + | ||
- | Then, as I figure things out (either what certain are, but mostly, which ones they are NOT), I can mark it up accordingly. | + | |
- | + | ||
- | Right from the start, we can already make some important connections; | + | |
- | + | ||
- | Now, since EACH letter is its own unique numeric value, subtracting one letter from another on its own won't result in a value of 0, but being borrowed from will. | + | |
- | + | ||
- | That is: 7-6=1, but (7-1)-6=0. THAT is what is going on here. | + | |
- | + | ||
- | So what we can infer from this, is some very important connections: | + | |
- | + | ||
- | * V is one less than G (I'll write it as: V < G) | + | |
- | * O is one less than L (O < L) | + | |
- | * L is one less than J (L < J) | + | |
- | * J is one less than K (J < K) | + | |
- | + | ||
- | Does that make sense? From looking at the puzzle, those four relations can be made. | + | |
- | + | ||
- | Now, FURTHERMORE, | + | |
- | + | ||
- | * O < L, but also: L < J | + | |
- | * L < J, but also: J < K | + | |
- | + | ||
- | That implies a further connection, so we can chain them together: | + | |
- | + | ||
- | * O < L < J < K | + | |
- | + | ||
- | So from that initial observation and connection, we now have two disconnected relationships: | + | |
- | + | ||
- | * V < G | + | |
- | * O < L < J < K | + | |
- | + | ||
- | From what we've done so far, we do not know where V,G fall in respect to O,L,J,K. They might be less than, OR greater than. We won't know without further information. | + | |
- | + | ||
- | Yet, even WITH this information, | + | |
- | + | ||
- | * since V is less than G, we know V can NOT be 9. | + | |
- | * similarly, G can NOT be 0. | + | |
- | * O cannot be 9, 8, 7, because we know O is 3 less than K. So even though we don't know what K actually is, because K COULD be 9, we know what O, L, and J can NOT be. | + | |
- | * L cannot be 9 or 8 | + | |
- | * J cannot be 9 | + | |
- | * on the other side, K cannot be 0, 1, or 2 | + | |
- | * J cannot be 0 or 1 | + | |
- | * L cannot be 0. | + | |
- | + | ||
- | So, if we update our range chart accordingly: | + | |
- | + | ||
- | < | + | |
- | B = { 0, 1, 2, 3, 4, 5, 6, 7, 8 | + | |
- | G = { 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | J = { 2, 3, 4, 5, 6, 7, 8, } | + | |
- | K = { 3, 4, 5, 6, 7, 8, 9 } | + | |
- | L = { 1, 2, 3, 4, 5, 6, 7, } | + | |
- | M = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | O = { 0, 1, 2, 3, 4, 5, 6, } | + | |
- | P = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | R = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | V = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | </ | + | |
- | + | ||
- | Moving on, dealing with details of discovering those one-off relations, that tells us something about the NEXT subtractions: | + | |
- | + | ||
- | * L is less than K (which we actually know to be 2 less than K), so L - K needs to BORROW | + | |
- | * J is less than K (which we know is 1 less than K), so J - K needs to BORROW | + | |
- | * V is apparently also less than K (which we didn't previously know), so V - K needs to BORROW | + | |
- | * now knowing than V << K, we can connect our other relational fragment in (I use the double '<<' | + | |
- | + | ||
- | So: V < G << O < L < J < K | + | |
- | + | ||
- | This allows us some further whittling of our ranges: | + | |
- | + | ||
- | * V cannot be 9, 8, 7, 6, or 5 | + | |
- | * G cannot be 9, 8, 7, or 6 | + | |
- | * O cannot be 0, or 1 | + | |
- | * L cannot be 0, 1, or 2 | + | |
- | * J cannot be 0, 1, 2, or 3 | + | |
- | * K cannot be 0, 1, 2, 3, or 4 | + | |
- | + | ||
- | < | + | |
- | B = { 0, 1, 2, 3, 4, 5, 6, 7, 8 } | + | |
- | G = { 1, 2, 3, 4, 5, } | + | |
- | J = { 4, 5, 6, 7, 8, } | + | |
- | K = { 5, 6, 7, 8, 9 } | + | |
- | L = { 3, 4, 5, 6, 7, } | + | |
- | M = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | O = { 2, 3, 4, 5, 6, } | + | |
- | P = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | R = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } | + | |
- | V = { 0, 1, 2, 3, 4, } | + | |
- | </ | + | |
- | + | ||
- | Already we can see that V and G are likely lower numbers, and O, L, J, and K are likely higher numbers. | + | |
- | + | ||
- | What else do we have? Let's keep going: | + | |
- | + | ||
- | We cannot instantly proceed to the next subtraction in as obvious a progression, | + | |
- | + | ||
- | ===Finding K (and J and L and O as well)=== | + | |
- | However, looking at the puzzle, I'm interested in seeing if we can find any obvious examples of 0. You know, letter minus same letter sort of things. Because they will typically end up equalling 0 (or 9). | + | |
- | + | ||
- | Why 9? Because of a borrow! | + | |
- | + | ||
- | ((5-1)+10)-5 = (4+10)-5 = 14 - 5 = 9 | + | |
- | + | ||
- | ... that can be quite revealing too! | + | |
- | + | ||
- | And it would appear we have one wonderful candidate in the bottom-most subtraction: | + | |
- | + | ||
- | < | + | |
- | | + | |
- | -JKRKB | + | |
- | | + | |
- | VKMK | + | |
- | </ | + | |
- | + | ||
- | Lookie there: R-R = K. | + | |
- | + | ||
- | Usually, that would result in a 0. BUT, we also know that K can NOT be 0 (looking at our range table above). | + | |
- | + | ||
- | So, that means it is being borrowed from, and it itself has to borrow, so we now also know that M is less than K (M << K). | + | |
- | + | ||
- | And, as indicated above: | + | |
- | + | ||
- | ((R-1)+10)-R = 9! | + | |
- | + | ||
- | We now know that K = 9! | + | |
- | + | ||
- | That suddenly reveals a whole lot to us, due to our relational chains we've built. Let's update: | + | |
- | + | ||
- | | 0 | | | + | |
- | | 1 | | | + | |
- | | 2 | | | + | |
- | | 3 | | | + | |
- | | 4 | | | + | |
- | | 5 | | | + | |
- | | 6 | O | | + | |
- | | 7 | L | | + | |
- | | 8 | J | | + | |
- | | 9 | K | | + | |
- | + | ||
- | Also, with the new introduction of M being less than K: | + | |
- | + | ||
- | < | + | |
- | B = { 0, 1, 2, 3, 4, 5, } | + | |
- | G = { 1, 2, 3, 4, 5, } | + | |
- | J = { | + | |
- | K = { 9 } | + | |
- | L = { 7 } | + | |
- | M = { 0, 1, 2, 3, 4, 5, } | + | |
- | O = { | + | |
- | P = { 0, 1, 2, 3, 4, 5, } | + | |
- | R = { 0, 1, 2, 3, 4, 5, } | + | |
- | V = { 0, 1, 2, 3, 4, } | + | |
- | </ | + | |
- | + | ||
- | And, our relational chains: | + | |
- | + | ||
- | * V < G << O < L < J < K | + | |
- | * M << O < L < J < K | + | |
- | + | ||
- | Because we don't yet know any relation of M compared to V or G, we have to keep them separate for now. | + | |
- | + | ||
- | We also have a second disqualifier for K being 0... the ones place subtraction in that bottom-most subtraction: | + | |
- | + | ||
- | R - B = K. | + | |
- | + | ||
- | There' | + | |
- | + | ||
- | * R is greater than B | + | |
- | * R is less than B | + | |
- | + | ||
- | Since we know that K is 9, there' | + | |
- | + | ||
- | * R is less than B (R << B) | + | |
- | + | ||
- | Currently both R and B can be 0-5 (although now, B is 1-5, and R is 0-4). We'd need to find a combination where (R+10)-B is 9: | + | |
- | ^ R: 0 ^ R: 1 ^ R: 2 ^ R: 3 ^ R: 4 | | + | |
- | | (0+10) | + | |
- | | 10 | 11 | 12 | 13 | 14 | | + | |
- | + | ||
- | And from that, we're subtracting B, which is 1, 2, 3, 4, or 5. The answer has to be 9. | + | |
- | + | ||
- | So: | + | |
- | + | ||
- | 10-1=9, 11-2=9, 12-3=9, 13-4=9, and 14-5=9 | + | |
- | + | ||
- | Hey, look at that... B is one greater than R (not just R << B, BUT: R < B) | + | |
- | + | ||
- | Our relational chains: | + | |
- | + | ||
- | * V < G << O < L < J < K | + | |
- | * M << O < L < J < K | + | |
- | * R < B << O < L < J < K | + | |
- | + | ||
- | And our chart, of sorts: | + | |
- | + | ||
- | < | + | |
- | B = { 1, 2, 3, 4, 5, } | + | |
- | G = { 1, 2, 3, 4, 5, } | + | |
- | J = { | + | |
- | K = { 9 } | + | |
- | L = { 7 } | + | |
- | M = { 0, 1, 2, 3, 4, 5, } | + | |
- | O = { | + | |
- | P = { 0, 1, 2, 3, 4, 5, } | + | |
- | R = { 0, 1, 2, 3, 4, } | + | |
- | V = { 0, 1, 2, 3, 4, } | + | |
- | </ | + | |
- | + | ||
- | If you look, the only letter we've not yet directly interacted with yet is ' | + | |
- | + | ||
- | Let's continue on: | + | |
- | + | ||
- | M-K=M, BECAUSE we know M << K, AND BECAUSE we know the subtraction to the right is borrowing from it (because R < B), we have something like this: (M-1+10)-K=M | + | |
- | + | ||
- | Can't really do much more with it at this point, but it is important to know to help us identify the borrows needing to happen. | + | |
- | + | ||
- | ===Finding our zero value (R and B)=== | + | |
- | Why don't we go ahead and find 0? If you look in the subtraction above the bottom one, we have another " | + | |
- | + | ||
- | < | + | |
- | JJGKL | + | |
- | | + | |
- | ===== | + | |
- | | + | |
- | </ | + | |
- | + | ||
- | We KNOW that V << L, so no borrow is happening there. | + | |
- | + | ||
- | Therefore, K-K, or 9-9, equals 0. So R is 0! | + | |
- | + | ||
- | ... and B is 1! Because of our identified relationship. | + | |
- | + | ||
- | Updating things! | + | |
- | + | ||
- | | 0 | R | | + | |
- | | 1 | B | | + | |
- | | 2 | | | + | |
- | | 3 | | | + | |
- | | 4 | | | + | |
- | | 5 | | | + | |
- | | 6 | O | | + | |
- | | 7 | L | | + | |
- | | 8 | J | | + | |
- | | 9 | K | | + | |
- | + | ||
- | Also, with the new introduction of M being less than K: | + | |
- | + | ||
- | < | + | |
- | B = { 1 } | + | |
- | G = { 3, 4, 5, } | + | |
- | J = { | + | |
- | K = { 9 } | + | |
- | L = { 7 } | + | |
- | M = { 2, 3, 4, 5, } | + | |
- | O = { | + | |
- | P = { 2, 3, 4, 5, } | + | |
- | R = { 0 } | + | |
- | V = { 2, 3, 4, } | + | |
- | </ | + | |
- | + | ||
- | *NOTE: G is NOT 2, because G is greater than V (one greater, in fact), so we can similarly whittle that off. | + | |
- | + | ||
- | Relational chains can look as follows now: | + | |
- | + | ||
- | * R < B << V < G << O < L < J < K | + | |
- | * R < B << M << O < L < J < K | + | |
- | * R < B << P << O < L < J < K | + | |
- | + | ||
- | Basically just down to V, G, P, and M. | + | |
- | + | ||
- | ===Finding V and G=== | + | |
- | And I think we have the means to find V: notice the second to last subtraction, | + | |
- | + | ||
- | We KNOW the numeric values of K and J, in fact we know the values of L, K, and B. The only thing we don't know is ' | + | |
- | + | ||
- | KJKK = 9899 | + | |
- | J = 8 | + | |
- | + | ||
- | So: 9899 x 8 = 79192 = LKBKV! | + | |
- | + | ||
- | V is 2! | + | |
- | + | ||
- | Which means, because V < G, that G is 3! | + | |
- | + | ||
- | Updating our records: | + | |
- | + | ||
- | | 0 | R | | + | |
- | | 1 | B | | + | |
- | | 2 | V | | + | |
- | | 3 | G | | + | |
- | | 4 | | | + | |
- | | 5 | | | + | |
- | | 6 | O | | + | |
- | | 7 | L | | + | |
- | | 8 | J | | + | |
- | | 9 | K | | + | |
- | + | ||
- | Also, with the new introduction of M being less than K: | + | |
- | + | ||
- | < | + | |
- | B = { 1 } | + | |
- | G = { 3 } | + | |
- | J = { | + | |
- | K = { 9 } | + | |
- | L = { 7 } | + | |
- | M = { 4, 5, } | + | |
- | O = { | + | |
- | P = { 4, 5, } | + | |
- | R = { 0 } | + | |
- | V = { | + | |
- | </ | + | |
- | + | ||
- | Relational chains can look as follows now: | + | |
- | + | ||
- | * R < B < V < G << M << O < L < J < K | + | |
- | * R < B < V < G << P << O < L < J < K | + | |
- | + | ||
- | ===Finding M and discovering P=== | + | |
- | And then there were 2. We really just need to find M, or P, and we're done. And since there are no ' | + | |
- | + | ||
- | Hey, how about this: | + | |
- | + | ||
- | < | + | |
- | JJGKL | + | |
- | | + | |
- | ===== | + | |
- | | + | |
- | </ | + | |
- | + | ||
- | One's place subtraction: | + | |
- | + | ||
- | We KNOW L (7) is greater than V (2), so no borrow is happening. | + | |
- | + | ||
- | L-V=M | + | |
- | 7-2=5 | + | |
- | + | ||
- | M is 5. That means P is 4 by process of elimination. | + | |
- | + | ||
- | Puzzle completed: | + | |
- | + | ||
- | | 0 | R | | + | |
- | | 1 | B | | + | |
- | | 2 | V | | + | |
- | | 3 | G | | + | |
- | | 4 | P | | + | |
- | | 5 | M | | + | |
- | | 6 | O | | + | |
- | | 7 | L | | + | |
- | | 8 | J | | + | |
- | | 9 | K | | + | |
- | + | ||
- | Also, with the new introduction of M being less than K: | + | |
- | + | ||
- | < | + | |
- | B = { 1 } | + | |
- | G = { 3 } | + | |
- | J = { | + | |
- | K = { 9 } | + | |
- | L = { 7 } | + | |
- | M = { 5 } | + | |
- | O = { | + | |
- | P = { | + | |
- | R = { 0 } | + | |
- | V = { | + | |
- | </ | + | |
- | + | ||
- | Relational chains can look as follows now: | + | |
- | + | ||
- | * R < B < V < G < P < M < O < L < J < K | + | |
- | + | ||
- | I wasn't able to show it as well in text on the wiki, but I also made a point to mark up each subtraction to show whether a borrow occurred or not: | + | |
- | + | ||
- | {{ : | + | |
- | + | ||
- | To be sure, there are likely MANY, MANY ways to arrive at these conclusions. What is important is being observant, performing little experiments, | + | |
- | + | ||
- | Your performance on this project will be directly tied to being able to document your process through the puzzle; I have provided this writeup in order to show you an example of what that process may look like. | + | |
- | + | ||
- | =====Getting started===== | + | |
- | In the **pctX/** sub-directory of the UNIX Public Directory, under a directory by the name of your username, you will find the following file: | + | |
- | + | ||
- | * **puzzle** | + | |
- | + | ||
- | Copy this file into your local project directory. | + | |
- | + | ||
- | There is also a **MANIFEST** file in the parent directory (the **pctX/** sub-directory), | + | |
- | + | ||
- | For this project, you have to solve, DOCUMENT, AND VERIFY the provided puzzle in order to be eligible for full credit will be the one contained in the **puzzle** file. | + | |
- | + | ||
- | =====Process===== | + | |
- | Solve, document, and verify the puzzle. | + | |
- | + | ||
- | On your own. | + | |
- | + | ||
- | Seek to discover and explore and understand, NOT to just come up with an answer. | + | |
- | + | ||
- | =====Your Submission===== | + | |
- | As this project focuses more on the critical thinking process than being heavy in unravelling a problem, your submission will be in 3 parts: | + | |
- | + | ||
- | * your puzzle key, in a textfile called ' | + | |
- | * your documentation of your solving and exploration of the puzzle. If you did this on paper, will need to transcribe it out into clearly readable, organized, and followable text directions. The file, in text form, should be called ' | + | |
- | + | ||
- | ====puzzle key==== | + | |
- | As indicated, you are to place the determined key to your puzzle in a regular text file called ' | + | |
- | + | ||
- | For example, using the example puzzle above: | + | |
- | + | ||
- | | 0 | R | | + | |
- | | 1 | B | | + | |
- | | 2 | V | | + | |
- | | 3 | G | | + | |
- | | 4 | P | | + | |
- | | 5 | M | | + | |
- | | 6 | O | | + | |
- | | 7 | L | | + | |
- | | 8 | J | | + | |
- | | 9 | K | | + | |
- | + | ||
- | We'll want to put them, in order, in our key file: | + | |
- | + | ||
- | < | + | |
- | lab46: | + | |
- | lab46: | + | |
- | </ | + | |
- | + | ||
- | Want to know what a proper ' | + | |
- | + | ||
- | < | + | |
- | lab46: | + | |
- | RBVGPMOLJK | + | |
- | lab46: | + | |
- | </ | + | |
- | + | ||
- | JUST the letters (and a trailing newline). | + | |
- | + | ||
- | ====solution documentation==== | + | |
- | As stated, a very large part of this project' | + | |
- | + | ||
- | Just providing the ' | + | |
- | + | ||
- | Your documentation should, while there may be supporting information, | + | |
- | + | ||
- | You are free to write out your solution with pen on paper (that is how I usually do these puzzles); but if you do so, you MUST transcribe it to text and submit it in that format. Images will NOT be accepted. | + | |
- | + | ||
- | The aim here is not to dump a bunch of data on me, but instead present me with connected and pertinent information that documents your process of progression through the puzzle from start to finish. This is in the same vein as programming in a language on a computer. A computer program is a detailed description of a process to solving some problem in a format the receiver can understand. | + | |
- | + | ||
- | =====Walkthrough Videos===== | + | |
- | To further aid your letter division efforts, I have recorded some videos showing my walkthrough of various letter division puzzles: | + | |
- | + | ||
- | * another take on the puzzle presented on this page: https:// | + | |
- | * a base 8 letter division puzzle: https:// | + | |
- | * a base 9 letter division puzzle: https:// | + | |
- | * a base 10 letter division puzzle: https:// | + | |
- | * a base 11 letter division puzzle: https:// | + | |
- | + | ||
- | =====Verification===== | + | |
- | In addition to documenting the process of solving the puzzle, and coming up with a solution, you are to manually verify your solution by taking the numeric identities of each letter, plugging them back into the original puzzle, solving it, and converting the obtained quotient and remainder back into letter form to compare with those in the puzzle provided to you. If they match, you have successfully solved the puzzle. If they do not match, some error exists that should be addressed and corrected. | + | |
- | + | ||
- | The verification can go at the bottom of your solution file, after you've documented your puzzle from start to completion. | + | |
- | + | ||
- | An example of a verification text is as follows: | + | |
- | + | ||
- | ====Verifying our key==== | + | |
- | The best way to verify the puzzle with our key is to convert the dividend and divisor | + | |
- | + | ||
- | * divisor: | + | |
- | * dividend: GLMBRVLR --> 37510270 | + | |
- | + | ||
- | And let's do some long division! | + | |
- | + | ||
- | < | + | |
- | | + | |
- | 9899 | 37510270 | + | |
- | </ | + | |
- | + | ||
- | 9899 goes into 37510 three times: | + | |
- | + | ||
- | < | + | |
- | 3 | + | |
- | | + | |
- | 9899 | 37510270 | + | |
- | -29697 | + | |
- | | + | |
- | 78132 | + | |
- | </ | + | |
- | + | ||
- | It might be convenient to have a quick factor reference for 9899 handy: | + | |
- | + | ||
- | * 9899 * 0 = 0 | + | |
- | * 9899 * 1 = 9899 | + | |
- | * 9899 * 2 = 19798 | + | |
- | * 9899 * 3 = 29697 | + | |
- | * 9899 * 4 = 39596 | + | |
- | * 9899 * 5 = 49495 | + | |
- | * 9899 * 6 = 59394 | + | |
- | * 9899 * 7 = 69293 | + | |
- | * 9899 * 8 = 79192 | + | |
- | * 9899 * 9 = 89091 | + | |
- | + | ||
- | 9899 fits into 78132 seven times (69293): | + | |
- | + | ||
- | < | + | |
- | 37 | + | |
- | | + | |
- | 9899 | 37510270 | + | |
- | -29697 | + | |
- | | + | |
- | 78132 | + | |
- | | + | |
- | ===== | + | |
- | | + | |
- | </ | + | |
- | + | ||
- | Once again, looking at the list of factors, we see that the best fit for 9899 into 88397 is 79192 (a factor of 8): | + | |
- | + | ||
- | < | + | |
- | 378 | + | |
- | | + | |
- | 9899 | 37510270 | + | |
- | -29697 | + | |
- | | + | |
- | 78132 | + | |
- | | + | |
- | ===== | + | |
- | | + | |
- | -79192 | + | |
- | | + | |
- | 92050 | + | |
- | </ | + | |
- | + | ||
- | Finally, a factor of 9 (89091) fits in best: | + | |
- | + | ||
- | < | + | |
- | 3789 <-- quotient | + | |
- | | + | |
- | 9899 | 37510270 | + | |
- | -29697 | + | |
- | | + | |
- | 78132 | + | |
- | | + | |
- | ===== | + | |
- | | + | |
- | -79192 | + | |
- | | + | |
- | 92050 | + | |
- | | + | |
- | ===== | + | |
- | 2959 <-- remainder | + | |
- | </ | + | |
- | + | ||
- | Converting our quotient and remainder back to letters: | + | |
- | + | ||
- | * quotient: | + | |
- | * remainder: 2959 --> VKMK | + | |
- | + | ||
- | And comparing against the problem we were given: | + | |
- | + | ||
- | * quotient: | + | |
- | * remainder: VKMK <-> VKMK | + | |
- | + | ||
- | Success! | + | |
- | + | ||
- | =====Submission===== | + | |
- | By successfully performing this project, you should be submitting files that satisfy the following requirements: | + | |
- | + | ||
- | * a ' | + | |
- | * a ' | + | |
- | + | ||
- | NOTE: Please substitute the actual project number in place of the ' | + | |
- | + | ||
- | To submit this project to me using the **submit** tool, run the following command at your lab46 prompt: | + | |
- | + | ||
- | < | + | |
- | lab46: | + | |
- | Submitting unix project " | + | |
- | -> pctX.puzzle.key(OK) | + | |
- | -> pctX.puzzle.solution(OK) | + | |
- | + | ||
- | SUCCESSFULLY SUBMITTED | + | |
- | </ | + | |
- | + | ||
- | You should get some sort of confirmation indicating successful submission if all went according to plan. If not, check for typos and or locational mismatches. | + | |
- | + | ||
- | I'll be looking for the following: | + | |
- | + | ||
- | < | + | |
- | XX: | + | |
- | *: | + | |
- | *: | + | |
- | *: | + | |
- | </ | + | |
- | + | ||
- | Additional points of consideration: | + | |
- | + | ||
- | * if any restrictions are in force and they are ignored in the solving of the problem, up to 50% of credit can be deducted. | + | |
- | * if solution is messy and disorganized, | + | |
- | + | ||
- | Point values for the various iterations of pctX projects: | + | |
- | + | ||
- | ^ pct1 | 13 pts | | + | |
- | ^ pct2 | 13 pts | | + | |
- | ^ pct3 | 26 pts | | + | |
- | ^ pct4 | 26 pts | | + | |
- | ^ pct5 | 39 pts | | + | |
- | ^ pct6 | 39 pts | | + | |
- | ^ pct7 | 52 pts | | + | |
- | ^ pct8 | 52 pts | | + | |
- | ^ pct9 | 65 pts | | + | |
- | ^ pctA | 65 pts | | + | |
- | ^ pctB | 78 pts | | + | |
- | ^ pctC | 78 pts | | + |
haas/fall2020/unix/projects/pctx.1584367945.txt.gz · Last modified: 2020/03/16 10:12 by 127.0.0.1