A calculus problem by mridul jain
There are two distinguishable flagpoles, and there are 19 flags, of which 10 are identical blue flags, and 9 are identical green flags. Let N be the number of distinguishable arrangements using all of the flags in which each flagpole has at least one flag and no two green flags on either pole are adjacent. Find the remainder when N is divided by 1000.
The answer is 310.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!