You are not logged in.
He is cpnnected to science, but as John Daly would say, I have to give you a qualified yes, his work is somewhat connected to science, but it is not his career's focus.
No, he hasn't been dead yet (assuming you do not believe in reincarnations).
Not likely, but it is possible.
I watched a few episodes of the original show and I was amazed when I saw Dali! His responses were so funny.
Also, your statement in the OP is incorrect, that show is not the longest running one.
Hi Mayflow
Welcome to the forum! ![]()
As far as I know he has not anything to do with snails, has not been committed to a hospital for mental illnesses, is not a Kabbobly Doist (whatever that might be) and does not have a personal connection to me.
And, bobbym, shame on you for trying!
That's no a Latex problem, it's me not checking. It should go from i=1 and is the answer for the incorrect problem.
Yes, I know.
Is this a Brilliant problem?
Yes, he does, many.
What's wrong with my LaTeX?
What's my line?
Ah, yes, that is correct. I was thinking of the x term.
Have you seen the thread that emerged? ![]()
Yes, it is, I have edited it accordingly.
If I am not mistaken, the x^99 term should be
Hi Bob
It's M syntax. I'll try to run it, he basically wants the x^99 term of
Hi ganesh
No, he is not a criminal, nor has he, I believe, ever been designated as one.
No, but I bet he loves watching those!
Hello everyone
What's my line?

(I hope there won't be any image Googling this time.)
Yes, those are correct as well!
Hi cyerra
Welcome to the forum! ![]()
Yes, those answers all correct. Nice work!
No problem.
Okay, so, we think, how can we group the n snails into k groups, given a smaller grouping with n-1 snails. The first case is if we group the n-1 snails. If we do that, the last snail goes into a group of its own, and that group can be put in between any two other in k ways, so that would be k*a(n-1,k-1).
The other case is when the n-1 snails are already grouped into k groups. There we just have to put the last snails into one of those groups, which we can also do in k ways, so the total number of ways for this case is k*a(n-1,k). Just add the two, and there you have it.
n is the number of snails, k the number of people.
You look at what happens when you bring in another snail. You can either put it in a group with other snails or put it in a group of its own.
Either way, I do not see a reason to use that command here.
Won't it just take longer?
Hi
a[1, 1] = 1;
a[1, k_] := 0;
a[n_, 1] := 1;
a[n_, k_] := k (a[n - 1, k - 1] + a[n - 1, k]);
a[15, 4]