Discussion » Questions » Language » Can you prove whether the English language has a finite list showing its two-letter words?
Randy D

Can you prove whether the English language has a finite list showing its two-letter words?



(I posted this without using any two-letter words whatsoever. The effort took forever with repeated constructing and reconstructing, but I finally made the thing work.)

[Names are excluded from consideration.]
~

Posted - March 14, 2019
Tags : None

Responses


  • You’re weird. 
      March 14, 2019 3:52 PM MDT
    2

  • 44602
    Yes. There are 26 letters in the English language. If each of them were paired with all the others in all possible combinations, that is a finite number. In this case, that number is 650. Now, subtract all of them that aren't words. Ain't math grand? In my original answer, I left out a significant calculation. Ain't re-checking work grand? This post was edited by Element 99 at March 14, 2019 5:42 PM MDT
      March 14, 2019 3:54 PM MDT
    3

  • You’re even weirder for understanding this. 
      March 14, 2019 3:58 PM MDT
    3

  • 44602
    Thank you my dear.
      March 14, 2019 3:58 PM MDT
    3

  • You’re welcome.
      March 14, 2019 3:59 PM MDT
    2

  • 10052
    And to think, I almost didn't even look at this post! 

    You two are wonderful! :)
      March 14, 2019 4:56 PM MDT
    3

  • Lol :)
      March 14, 2019 4:58 PM MDT
    3