When you have finished, click Generate Report. When you add the children of each couple to your report, it may be significantly longer so be aware of that. I typically prefer to include as many generations as I can and I like to include the children. A pop-up window will appear asking you to choose whether your report will include all the children or just spouses, how many generations to include, and some other format options. Highlight yourself and then click Reports at the top.Ĭhoose Narrative Reports from the pull-down menu.
Take a look at what I mean. Open your RootsMagic database and look at your family pedigree. The good news is that while you are popping in names, dates, and places in your RootsMagic database, behind-the-scenes, your book is actually being written.
The purpose of a genealogy software program is to organize and analyze all of your genealogical data. Write Your Family History Book with RootsMagic Using the Narrative Report The software offers many types of printable reports like pedigree charts and family group sheets, but my favorite is the narrative report. RootsMagic is a genealogy software program that allows you to organize all your family history in one place. It might seem counter-intuitive that #0! = 1# however, this is indeed the case.I love the many reports that can be generated from RootsMagic. Thus, using our formula with the original problem, where we have 7 students taken 7 at a time (e.g. With #n# the number of objects, #r# the number of positions to be filled, and #!# the symbol for the factorial, an operation which acts on a non-negative integer #a# such that #a!# = #atimes(a-1)times(a-2)times(a-3)times.times(1)# Thus, multiplying our numbers of options together, we get #7*6*5*4*3*2*1 = 5040#.įor a more general formula to find the number of permutations of #n# objects taken #r# at a time, without replacement (i.e., the student in position 1 doesn't return to the waiting area and become an option for position 2), we tend to use the formula: With positions 1 and 2 filled, 5 can be placed in position 3, et cetera, up until only one student may be placed in the last position. Once position 1 is filled, 6 students can be placed in position 2. Looking back at the initial problem, there are 7 students who can be placed in position 1 (again, assuming that we fill positions 1 through 7 in order). Thus we multiply our numbers of options together: #7*6 = 42# Thus, if B were in position 1, we would have as possibilities BA, BC, BD, BE, BF, and BG. However.this does not account for all of the possible orders here, as there are 7 options for the first position.
A in position 1 and B in position 2), AC, AD, AE, AF, AG. Then our possible orders for our two positions are AB (i.e.
However, once that position is filled, we have only six options for the second, because one of the students has already been positioned.Īs an example, suppose A is in position 1. Now, if we are filling these positions one at a time, we have seven options to fill the first position: A, B, C, D, E, F, and G. In order to differentiate between our students, because order matters, we will assign each a letter from A to G. Imagine for the moment that we were filling only two positions, position 1 and position 2. how many different orders), this is a permutation. Given that the question asks how many ways the students can line up for recess (i.e. Recall, the difference between permutations and combinations is that, with permutations, order matters. This particular problem is a permutation.