16. Playing Cards Number System
16. Playing Cards Number System
What if we counted using playing cards?Consider the standard deck of playing cards with A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K in each of four suits. If we let a joker be zero and treat the ace as one we have a 14 "digit" number system. Create a 14 by 14 grid for adding numbers in this system and write down the sums along the main diagonal. That is, what is joker+joker in this system? How about 4+4? 8+8? Etc. Fill in the entire diagonal of the table.
11 Jul 2018 01:47
Course tags: | Computational Thinking | Human Centered Design | 'Required' Purchase | Recommended Purchase | Request for Library |
In class for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
homework for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
See extra for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Not in class for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Not homework for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Not extra for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Go to Course: Computational Thinking | Human Centered Design