Math, asked by pretykasinath, 7 months ago

Linguists are studying texts in some ancient language with 25 letters. They want to compute how often different 3-letter combinations occur in texts in this language. For this they first need to list all 3-letter combinations. How many combinations will they have?

Answers

Answered by dvampire736
0

Step-by-step explanation:

bfveegnghmmhwgnbffvngf zvddbdcsdv bfdv vo bfdv qc a rahi qfbbf. fbdbsvngfbfvbttcddvdvfvf bfngwgnffbdvvvsscsccsscdfbbfffbfbrjtbrhtbrthrjhrvcegaggbbrntybve

Similar questions