GoblinsCreate Account
Standards/Math/Indiana/FM.N

FM.N

FM Finite Mathematics
FM.MA
FM.N
FM.N.1FM.N.2FM.N.3FM.N.4FM.N.5FM.N.6
FM.O
FM.P
FM.S

Networks

FM.N.1Use networks, traceable paths, tree diagrams, Venn diagrams, and other pictorial representations to find the number of outcomes in a problem situation.FM.N.2Optimize networks in different ways and in different contexts by finding minimal spanning trees, shortest paths, and Hamiltonian paths including real-world problems.FM.N.3Use critical-path analysis in the context of scheduling problems and interpret the results.FM.N.4Construct and interpret directed and undirected graphs, decision trees, networks, and flow charts that model real-world contexts and problems.FM.N.5Use graph-coloring techniques to solve problems.FM.N.6Construct vertex-edge graph models involving relationships among a finite number of elements. Describe a vertex-edge graph using an adjacency matrix. Use vertex-edge graph models to solve problems in a variety of real-world settings.
Goblins

1-on-1 AI tutoring aligned to FM.N. Instant help for students, real-time insights for teachers.

Used in classrooms by 100,000+ students at Baltimore County, Plano ISD, Deer Valley USD, KIPP, and districts nationwide.

Free for teachers, forever →

Resources

Privacy PolicyTerms of ServiceCareersTeacher LoginStudent Login

Communities

Access 4 Learning Community, Student Data Privacy Consortium
Goblins

© 2023-2026 Aha Moments, Inc.