In the new Winter Bulletin they discussed having a series of two or more letters having to be transcribed in Nemeth when transcribing a technical document. This brought up a question I have about a Precalculus book that I am currently transcribing. The section I am working on is talking about Distinguishable Permutations.
In how many ways can the letters in BANANA be written?
After some math involved in the solution, they show:
The 60 different distinguishable permutations are as follows.
AAABNN AAANBN AAANNB AABANN
AABNAN AABNNA etc.
So do the letter permutations need to be in nemeth code, and does the original word BANANA also then need to be in nemeth code?