Alabama: Applications of Finite Mathematics Math Standards

REPRESENT LOGIC STATEMENTS IN WORDS, WITH SYMBOLS, AND IN TRUTH TABLES, INCLUDING CONDITIONAL, BICONDITIONAL, CONVERSE, INVERSE, CONTRAPOSITIVE, AND QUANTIFIED STATEMENTS.

USE THE PIGEONHOLE PRINCIPLE TO SOLVE COUNTING PROBLEMS.

FIND PATTERNS IN APPLICATION PROBLEMS INVOLVING SERIES AND SEQUENCES, AND DEVELOP RECURSIVE AND EXPLICIT FORMULAS AS MODELS TO UNDERSTAND AND DESCRIBE SEQUENTIAL CHANGE.

DETERMINE CHARACTERISTICS OF SEQUENCES, INCLUDING THE FIBONACCI SEQUENCE, THE TRIANGULAR NUMBERS, AND PENTAGONAL NUMBERS.

USE THE RECURSIVE PROCESS AND DIFFERENCE EQUATIONS TO CREATE FRACTALS, POPULATION GROWTH MODELS, SEQUENCES, AND SERIES.

USE MATHEMATICAL INDUCTION TO PROVE STATEMENTS INVOLVING THE POSITIVE INTEGERS.

DEVELOP AND APPLY CONNECTIONS BETWEEN PASCAL’S TRIANGLE AND COMBINATIONS.

USE VERTEX AND EDGE GRAPHS TO MODEL MATHEMATICAL SITUATIONS INVOLVING NETWORKS.

• AFM.16.a Identify properties of simple graphs, complete graphs, bipartite graphs, complete bipartite graphs, and trees.

SOLVE PROBLEMS INVOLVING NETWORKS THROUGH INVESTIGATION AND APPLICATION OF EXISTENCE AND NONEXISTENCE OF EULER PATHS, EULER CIRCUITS, HAMILTON PATHS, AND HAMILTON CIRCUITS. NOTE: REAL-WORLD CONTEXTS MODELED BY GRAPHS MAY INCLUDE ROADS OR COMMUNICATION NETWORKS.

• AFM.17.a Develop optimal solutions of application-based problems using existing and student-created algorithms.
• AFM.17.b Give an argument for graph properties.

APPLY ALGORITHMS RELATING TO MINIMUM WEIGHT SPANNING TREES, NETWORKS, FLOWS, AND STEINER TREES.

• AFM.18.a Use shortest path techniques to find optimal shipping routes.
• AFM.18.b Show that every connected graph has a minimal spanning tree.
• AFM.18.c Use Kruskal’s Algorithm and Prim’s Algorithm to determine the minimal spanning tree of a weighted graph.

USE VERTEX-COLORING, EDGE-COLORING, AND MATCHING TECHNIQUES TO SOLVE APPLICATION-BASED PROBLEMS INVOLVING CONFLICT.

REPRESENT LOGIC OPERATIONS SUCH AS AND, OR, NOT, NOR, AND X OR (EXCLUSIVE OR) IN WORDS, WITH SYMBOLS, AND IN TRUTH TABLES.

DETERMINE THE MINIMUM TIME TO COMPLETE A PROJECT USING ALGORITHMS TO SCHEDULE TASKS IN ORDER, INCLUDING CRITICAL PATH ANALYSIS, THE LIST-PROCESSING ALGORITHM, AND STUDENT-CREATED ALGORITHMS.

USE THE ADJACENCY MATRIX OF A GRAPH TO DETERMINE THE NUMBER OF WALKS OF LENGTH N IN A GRAPH.

ANALYZE ADVANTAGES AND DISADVANTAGES OF DIFFERENT TYPES OF BALLOT VOTING SYSTEMS.

• AFM.22.a Identify impacts of using a preferential ballot voting system and compare it to single candidate voting and other voting systems.
• AFM.22.b Analyze the impact of legal and cultural features of political systems on the mathematical aspects of elections.

APPLY A VARIETY OF METHODS FOR DETERMINING A WINNER USING A PREFERENTIAL BALLOT VOTING SYSTEM, INCLUDING PLURALITY, MAJORITY, RUN-OFF WITH MAJORITY, SEQUENTIAL RUN-OFF WITH MAJORITY, BORDA COUNT, PAIRWISE COMPARISON, CONDORCET, AND APPROVAL VOTING.

IDENTIFY ISSUES OF FAIRNESS FOR DIFFERENT METHODS OF DETERMINING A WINNER USING A PREFERENTIAL VOTING BALLOT AND OTHER VOTING SYSTEMS AND IDENTIFY PARADOXES THAT CAN RESULT.

USE METHODS OF WEIGHTED VOTING AND IDENTIFY ISSUES OF FAIRNESS RELATED TO WEIGHTED VOTING.

• AFM.25.a Distinguish between weight and power in voting.

EXPLAIN AND APPLY MATHEMATICAL ASPECTS OF FAIR DIVISION, WITH RESPECT TO CLASSIC PROBLEMS OF APPORTIONMENT, CAKE CUTTING, AND ESTATE DIVISION. INCLUDE APPLICATIONS IN OTHER CONTEXTS AND MODERN SITUATIONS.

IDENTIFY AND APPLY HISTORIC METHODS OF APPORTIONMENT FOR VOTING DISTRICTS INCLUDING HAMILTON, JEFFERSON, ADAMS, WEBSTER, AND HUNTINGTON-HILL. IDENTIFY ISSUES OF FAIRNESS AND PARADOXES THAT MAY RESULT FROM METHODS.

USE SPREADSHEETS TO EXAMINE APPORTIONMENT METHODS IN LARGE PROBLEMS.

CRITICALLY ANALYZE ISSUES RELATED TO INFORMATION PROCESSING INCLUDING ACCURACY, EFFICIENCY, AND SECURITY.

USE TRUTH TABLES TO SOLVE APPLICATION-BASED LOGIC PROBLEMS AND DETERMINE THE TRUTH VALUE OF SIMPLE AND COMPOUND STATEMENTS INCLUDING NEGATIONS AND IMPLICATIONS.

• AFM.3.a Determine whether statements are equivalent and construct equivalent statements.

APPLY CIPHERS (ENCRYPTION AND DECRYPTION ALGORITHMS) AND CRYPTOSYSTEMS FOR ENCRYPTING AND DECRYPTING INCLUDING SYMMETRIC-KEY OR PUBLIC-KEY SYSTEMS.

• AFM.30.a Use modular arithmetic to apply RSA (Rivest-Shamir-Adleman) public-key cryptosystems.
• AFM.30.b Use matrices and their inverses to encode and decode messages.

APPLY ERROR-DETECTING CODES AND ERROR-CORRECTING CODES TO DETERMINE ACCURACY OF INFORMATION PROCESSING.

APPLY METHODS OF DATA COMPRESSION.

DETERMINE WHETHER A LOGICAL ARGUMENT IS VALID OR INVALID, USING LAWS OF LOGIC SUCH AS THE LAW OF SYLLOGISM AND THE LAW OF DETACHMENT.

• AFM.4.a Determine whether a logical argument is a tautology or a contradiction.

PROVE A STATEMENT INDIRECTLY BY PROVING THE CONTRAPOSITIVE OF THE STATEMENT.

USE MULTIPLE REPRESENTATIONS AND METHODS FOR COUNTING OBJECTS AND DEVELOPING MORE EFFICIENT COUNTING TECHNIQUES. NOTE: REPRESENTATIONS AND METHODS MAY INCLUDE TREE DIAGRAMS, LISTS, MANIPULATIVES, OVERCOUNTING METHODS, RECURSIVE PATTERNS, AND EXPLICIT FORMULAS.

DEVELOP AND USE THE FUNDAMENTAL COUNTING PRINCIPLE FOR COUNTING INDEPENDENT AND DEPENDENT EVENTS.

• AFM.7.a Use various counting models (including tree diagrams and lists) to identify the distinguishing factors of a context in which the Fundamental Counting Principle can be applied.

USING APPLICATION-BASED PROBLEMS, DEVELOP FORMULAS FOR PERMUTATIONS, COMBINATIONS, AND COMBINATIONS WITH REPETITION AND COMPARE STUDENT-DERIVED FORMULAS TO STANDARD REPRESENTATIONS OF THE FORMULAS.

• AFM.8.a Identify differences between applications of combinations and permutations.
• AFM.8.b Using application-based problems, calculate the number of permutations of a set with n elements. Calculate the number of permutations of r elements taken from a set of n elements.
• AFM.8.c Using application-based problems, calculate the number of subsets of size r that can be chosen from a set of n elements, explaining this number as the number of combinations “n choose r.”
• AFM.8.d Using application-based problems, calculate the number of combinations with repetitions of r elements from a set of n elements as “(n + r – 1) choose r.”

USE VARIOUS COUNTING TECHNIQUES TO DETERMINE PROBABILITIES OF EVENTS.