Brilliant
Today
Courses
Practice
Algebra
Geometry
Number Theory
Calculus
Discrete Mathematics
Counting
Sets and Partitions
Data
Probability
Random Variables
Binomial Theorem
Recurrence Relations
Advanced Discrete
Basic Mathematics
Logic
Classical Mechanics
Electricity and Magnetism
Computer Science
Quantitative Finance
Chemistry
Sign up
Log in
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, interactive explorations.
Used and loved by over 7 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Log in with Facebook
Log in with Google
or
Log in with email
Join using Facebook
Join using Google
or
Join using email
New user?
Sign up
Existing user?
Log in
Excel in math and science
Master concepts by solving fun, challenging problems.
It's hard to learn from lectures and videos
Learn more effectively through short, interactive explorations.
Used and loved by over 7 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Your answer
seems reasonable.
Find out if you're right!
Sign up to access problem solutions.
That seems reasonable.
Find out if you're right!
Log in with Facebook
Log in with Google
or
Log in with email
Join using Facebook
Join using Google
or
Join using email
New user?
Sign up
Existing user?
Log in
Discrete Mathematics
Graph Theory
Concept Quizzes
Tracing Paths
Complete Graphs
Eulerian Paths
Hamiltonian Paths
Trees
Bipartite Graphs
Planar Graphs
Directed Graphs
Challenge Quizzes
Level 1
Level 2
Level 3
Level 5
Tracing Paths
In the graph above, is it possible to trace a path from node 4 to node 6?
Yes
No
Submit
In the graph above, is is possible to trace a path from node 5 to node 4 that uses 3 or fewer edges?
Yes
No
Submit
How many paths that do not repeat a node of length at most 4 (having at most four edges) are there between node number 4 and node number 8?
None
1
2
3
Submit
How many distinct paths of length 4 (paths using 4 edges) that do not visit the same node more than once are there between node 0 and node 1?
6
12
24
120
720
Submit
How many paths are there between node number 9 and node number 7?
0
1
2
3
Submit
×
Problem Loading...
Note Loading...
Set Loading...