A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 4 years ago

i'm a bit rusty with my statistics/combinatorics. Can somebody show me the math behind this problem: suppose you have 4 letters: A, B ,C, and D. each letter can be uppercase or lowercase. How many different ways can you write the four letters if they must stay in the same order (ie, order doesn't matter) for example, some possibilities would be: ABCD, abcd, aBcD, ABCd, etc.

  • This Question is Closed
  1. ggrree
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    another example of what I mean. Imagine you have letters A, B, a, b. how many ways could you arrange them? in this example it's easy to count them out: AB, Ab, and ab. we only have 3 ways to write them. am I clear?

  2. ggrree
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    sorry, think I figured it out. the answer is 2^n, where n is the number of letters you have, since you've only got two choices (upper or lowercase) for each letter.

  3. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...


  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.