Re^13: [Answered; thanks.] Can this be explained in layman's terms?

[jdporter]

Because that is not your purpose, and never was.

It certainly was, but I figured (wrongly?) that it would better to defer to you, the OP, a seasoned perlmonks veteran, to improve the title yourself.

Since you've elected instead to dig in your heels under the flag of a feigned artlessness, I may do it. Or I may decide that it wouldn't be worth the time.

your entire intervention serves no good purpose

I put a consideration on my initial reply, to have it yoinked over into its own PMD thread, but, alas, the consensus is unanimously against me (so far).

What a mess.

Imagine how much less of a mess we'd have if you had simply taken my original suggestion and improved the title, rather than getting all bent about it.

[BrowserUk]

Imagine how much less of a mess we'd have if you had simply taken my original suggestion and improved the title, rather than getting all bent about it.

I'm not "bent about it". I explained in my first reply to you that I do not know how to improve the title such that is doesn't change the purpose of my post; and that I think that there is no reason to change it.

If it is so important to you to change it, and you think you are so clever that you see a better title, be my guest. Make up some irrelevant title and use your executive power to change it.

Don't put the blame on me for your persistent and pointless attempts to denigrate me for no good reason.

[jdporter]

Paraphrase a complex mathematical recurrence relation -- e.g. Stirling Numbers of the Second Kind

For example.

Wow, that was hard.

[1nickt]

I do not know how to improve the title such that is does change the purpose of my post

If you really get stuck, you might like to use Lingua::EN::Keywords ... it seems to produce somewhat cleverer titles:

$perl buk_title2.pl

[Answered; Thanks. ] Kind stirling numbers numbers n second kind set?

[Answered; Thanks. ] Set n numbers second kind size k recursion?

[Answered; Thanks. ] Kind stirling numbers set second kind numbers n?

[Answered; Thanks. ] Stirling numbers kind elements stirling n element
+s partitions?

[Answered; Thanks. ] Stirling partitions n elements elements second ki
+nd n?

use strict; use warnings;
use Lingua::EN::Keywords;

my $data = do { local $/; <DATA> };
for ( 0 .. 4 ) {
    my @words = keywords( $data );
    $words[0] = ucfirst( $words[0] );
    print "[Answered; Thanks. ] @words?\n\n";
}

__DATA__
The number of partitions of size k of a set of n elements are known as
+ Stirling numbers of the second kind, and satisfy the recursion:

Hope this helps!