Is Goblins free for teachers?

Yes. Goblins offers a generous free tier that includes 1 live feedback assignment per week, insights on student mastery and replays, and the ability to upload your own content. The Max plan adds unlimited assignments, superadaptive mode, grade exports, standards growth reports, and SSO/LMS integration, with per-student pricing for schools and districts.

How does Goblins work?

Three simple steps: (1) Share an assignment from thousands of standards-aligned topics using a share code. (2) Students speak and draw their thinking naturally, and Goblins responds with Socratic questioning that sounds just like their teacher. (3) Teachers get real-time formative insights showing what students struggle with and suggestions to inform instruction.

Does Goblins prevent cheating?

Yes. Goblins uses a purpose-trained AI model that evaluates cheating signals in real time. It can detect when students are copying answers, using external tools inappropriately, or not genuinely working through problems. Copy-pasting answers is also blocked.

Can I use my own voice with Goblins?

Yes. Teachers can record their voice and take a selfie to create a custom 3D avatar in about 30 seconds. Students then hear help in their own teacher's voice and see a familiar face, making the experience more personal and effective.

What math levels does Goblins cover?

Goblins covers math from Grade 5 through AP Calculus, including thousands of standards-aligned topics. Teachers can also upload their own content for custom assignments at any level.

Is Goblins FERPA compliant?

Yes. Goblins is FERPA and state compliant. Student data privacy and security are a top priority.

Does Goblins support English Language Learners?

Yes. Goblins supports 30+ languages so teachers don't have to translate every worksheet. It is especially helpful for ELL students who need accessible math instruction in their native language.

North Carolina: Discrete Mathematics for Computer Science Math Standards

33 standards · 5 domains

FUNCTIONS

DCS.F.1.1 Implement procedures to find the nth term in an arithmetic or geometric sequence using spreadsheets.
DCS.F.1.2 Represent the sum of a sequence using sigma notation.
DCS.F.1.3 Implement procedures to find the sum of a finite sequence.
DCS.F.1.4 Implement procedures to find the sum of an infinite sequence and determine if the series converges or diverges.
DCS.F.1.5 Interpret the solutions to arithmetic and geometric sequences and series problems, in context.

GRAPH THEORY

DCS.GT.1.1 Represent real world situations with a vertex-edge graph, adjacency matrix, and vertex-edge table.
DCS.GT.1.2 Test graphs and digraphs for Euler paths, Euler circuits, Hamiltonian paths, or Hamiltonian circuits.
DCS.GT.1.3 Interpret a complete digraph to determine rank.
DCS.GT.2.1 Implement critical path analysis algorithms to determine the minimum project time.
DCS.GT.2.2 Implement the brute force method, the nearest-neighbor algorithm, and the cheapest-link algorithm to find solutions to a Traveling Salesperson Problem.
DCS.GT.2.3 Implement vertex-coloring techniques to solve problems.
DCS.GT.2.4 Implement Kruskal and Prim’s algorithms to determine the weight of the minimum spanning tree of a connected graph.

LOGIC

DCS.L.1.1 Construct truth tables that encode the truth and falsity of two or more statements.
DCS.L.1.2 Critique logic arguments (e.g., determine if a statement is valid or whether an argument is a tautology or contradiction).
DCS.L.1.3 Check 1s and 0s to determine whether a statement is true or false using Boolean logic circuits.
DCS.L.1.4 Judge whether two statements are logically equivalent using truth tables.

NUMBER AND QUANTITY

DCS.N.1.1 Implement procedures of addition, subtraction, multiplication, and scalar multiplication on matrices.
DCS.N.1.2 Implement procedures of addition, subtraction, and scalar multiplication on vectors.
DCS.N.1.3 Implement procedures to find the inverse of a matrix.
DCS.N.2.1 Organize data into matrices to solve problems.
DCS.N.2.2 Interpret solutions found using matrix operations including Leslie Models and Markov Chains, in context.
DCS.N.2.3 Represent a system of equations as a matrix equation.
DCS.N.2.4 Use inverse matrices to solve a system of equations with technology.
DCS.N.3.1 Recognize sets, subsets, and proper subsets.
DCS.N.3.2 Implement set operations to find unions, intersections, complements and set differences with multiple sets.
DCS.N.3.3 Represent properties and relationships among sets using Venn diagrams.
DCS.N.3.4 Interpret Venn diagrams to solve problems.
DCS.N.4.1 Use the Euclidean Algorithm to determine greatest common factor and least common multiple.
DCS.N.4.2 Use the Fundamental Theorem of Arithmetic to solve problems.
DCS.N.4.3 Conclude that sets are equal using the properties of set operations.
DCS.N.4.4 Explain theorems related to greatest common factor, least common multiple, even numbers, odd numbers, prime numbers, and composite numbers.

STATISTICS AND PROBABILITY

DCS.SP.1.1 Implement the Fundamental Counting Principle to solve problems.
DCS.SP.1.2 Implement procedures to calculate a permutation or combination.