The video tutorial introduces two numeric algorithms added in C-17: the greatest common divisor (GCD) and the least common multiple (LCM). It explains their function signatures, how they work, and how they can be used as binary predicates in other algorithms. The tutorial includes code examples demonstrating the use of GCD and LCM with different integer values and shows how to apply them in vector operations. The video concludes with a brief overview of what to expect in the next tutorial.

Describe how the GCD can be used as a binary predicate in algorithms.

What were the GCD and LCM values for the pairs 35 and 13, and 8 and 12?