Self Recursion

Author

Eric W. Weisstein
April 27, 2006

This notebook downloaded from http://mathworld.wolfram.com/notebooks/Algorithms/Self-Recursion.nb.

For more information, see Eric's MathWorld entry http://mathworld.wolfram.com/Self-Recursion.html.

©2006 Wolfram Research, Inc. except for portions noted otherwise

vos Post

str="This sentence contains ten words, eighteen syllables, and sixty-four letters";

StringSplit[str]//Length

<<Utilities`Hyphenate`

StringSplit[Hyphenate[str],{" ","-"}]//Length

StringCases[str,LetterCharacter]//Length

Sqrt[-1]

Sqrt[-1]//TraditionalForm

Hexidecimal

BaseForm[190,16]

Prime

PrimeQ[29]

(Sqrt[2])

Solve[1/(Sqrt[2])==1/x,x]

Derivative

D[Exp[x/(Sqrt[2])](Sin[x/(Sqrt[2])]+Cos[x/(Sqrt[2])]),{x,8}]//Simplify

Consonants

Length[StringCases[#,RegularExpression["[^aeiou]"]]]&/@{"one","two","three"}

Amicable pair of questions

With[{str="three-eighths"},
(Length[StringCases[str,#]]&/@{RegularExpression["[aeiou]"],LetterCharacter})
]

With[{str="one-third"},
(Length[StringCases[str,#]]&/@{RegularExpression["[aeiou]"],LetterCharacter})
]