Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Stage
    • Author
    • Cover Page
    • License
    • Show Page TOC
    • Transcluded
    • PrintOptions
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
    • Screen CSS
    • Number of Print Columns
  • Include attachments
Searching in
About 2 results
  • https://math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathematics/Discrete_Mathematics_for_Computer_Science_(Fitch)/01%3A_Basics/1.05%3A_Combinatorics-_First_Counts
    This page introduces combinatorics, focusing on counting and key terms like "alphabet," "string," and "permutation." It defines "string" as an ordered set of characters and explains "permutation" as a...This page introduces combinatorics, focusing on counting and key terms like "alphabet," "string," and "permutation." It defines "string" as an ordered set of characters and explains "permutation" as any arrangement of those characters. The text provides examples and includes practice checkpoints for generating strings and permutations of varying lengths and characters.
  • https://math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathematics/Discrete_Mathematics_for_Computer_Science_(Fitch)/01%3A_Basics/1.06%3A_Sorting-_Part_0
    This page discusses lexicographic ordering, which arranges strings alphabetically. It includes exercises using the string "mat" to list permutations in this order, determines the total permutations fo...This page discusses lexicographic ordering, which arranges strings alphabetically. It includes exercises using the string "mat" to list permutations in this order, determines the total permutations for "mat" and "math," and analyzes how the number of arrangements increases with string length.

Support Center

How can we help?