SuicideFuel Problem

[trying to ascend]

How many anagrams can you form with AETBUEPE where the letters don't appear in their original position?

 

[trying to ascend]

UP

 

[TheProphetMuscle]

idk

 

[TheDarkEnigma]

tube

 

[trying to ascend]

tube

You need to use all the letters, otherwise it isn't an anagram

 

[suicide3011]

Beetle juice

 

[Rhaast]

How many anagrams can you form with AETBUEPE where the letters don't appear in their original position?

A lot

 

[Transcended Trucel]

@Caesercel

 

[Ritalincel]

upbeat
beaut taupe tepee tubae
Abeu Aube abet abut Batu bate beat beau beep beet beta bete epee Peta Pete pate peat tabu tape tapu tepa tuba tube
abe apb ape apt ate aut Bea BTU bap bat bee bet but Eba eat epa eta pat pea pee pet pta pub put tab tap tau tea tee tub tue tup UAE Uta ute
ap at au BA BE BP ba be ET et pa pe pt pu ta tb UA up ut
a

 

[trying to ascend]

UP

 

[Deleted member 28708]

6720

 

[trying to ascend]

6720

Wrong

 

[Deleted member 28708]

Wrong

do you mean letters had so make sense?

 

[NoBitches]

How many anagrams can you form with AETBUEPE where the letters don't appear in their original position?

If all the letters were unique this problem would be simple
it would just be 8! however the letter E is repeated 3 times
This means we need to filter out the permutations of E
Basically for all other letters we care about the order so for example ABC is distinct from BAC
However since E is repeated it means we will end with something like EAE and EAE which are not distinct
So I think we must divide by 3! to get rid of the repeats
(8!/3!)-1=6719 ways
[Note there is some ambiguity are you counting all that dont have all the letters in the same place or are you saying that everysingle letter in the anagram must be in a different place?]

 

[trying to ascend]

If all the letters were unique this problem would be simple
it would just be 8! however the letter E is repeated 3 times
This means we need to filter out the permutations of E
Basically for all other letters we care about the order so for example ABC is distinct from BAC
However since E is repeated it means we will end with something like EAE and EAE which are not distinct
So I think we must divide by 3! to get rid of the repeats
(8!/3!)-1=6719 ways
[Note there is some ambiguity are you counting all that dont have all the letters in the same place or are you saying that everysingle letter in the anagram must be in a different place?]

Wrong, they must not be in their original position.

This applies to every single letter, regardless of the position of the others