Okay, here you go, here's your car Joe here.

>> I've got a question, do you have kids Louie?

>> Yes I do, I have two of them and we do math at home, we don't play games.

>> I feel sorry for your kids [LAUGH].

>> Alright, but seriously, you want to

tell us about the importance of combinatorics.

>> Sure, so in computer science we

deal with these kinds of objects, discrete objects,

not necessarily this one here, but for

example the number of pairs between two cities.

Again you are driving a car and you are interested

in finding the path between two cities, A and B,

and the question of interest is, give me a shortest

path or the, the most economic path between two cities?

And usually if you look at any map or

connecting cities there are multiple paths connecting these two cities.

And the questions is for the algorithm that is

going to be solving that problem, is it going

to be counting it or enumerating each one of

these paths and finding the most economic of them?

Or do we have something more sophisticated than that

so that we can find it much more quicker?

And the answer here is with the Combinatorics, which is

a branch of mathematics, we can do analysis of this kind

of objects and the number of this object, so we can

understand how hard the problem is, and design more efficient algorithms.

>> Alright, sounds good, Scott, you want to show him what you're working on?

>> Well, I have a problem here, because I

think I'm missing some states, I can't put this together.

>> I'm really proud you're learning your states here Scott.

[LAUGH].

I guess at home, my kids, we put together maps, so.

>> We have Texas that's all there, so.

>> Alright, Yeah, the question here is, how

do you actually put together a puzzle like this.

Do you actually know where Colorado goes or am I going to

just sit here and try to place everything everywhere that it goes?

>> That's Lou Eyes algorithm by the way.

>> [LAUGH] Yeah, he doesn't know anything about how masks work, right.

So the question is, you know, can I

enumerate all the possible ways of putting these

pieces together and figure out which one I actually want to use by trying them all.

That's basically the brute force approach to putting together a puzzle.

>> How many ways do those go together, by the way.

What do you think?