Escape one word to avoid matching it with the namespace of same name

git-svn-id: https://svn.dealii.org/trunk@15769 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/examples/step-31/doc/intro.dox b/deal.II/examples/step-31/doc/intro.dox
index db478ac095d8827f3d1a89b4c6d78d032c469938..08fb730d2a796086eef55c09c2b3208cc44a5dc1 100644 (file)
--- a/deal.II/examples/step-31/doc/intro.dox
+++ b/deal.II/examples/step-31/doc/intro.dox
@@ -463,7 +463,7 @@ O}(NB^2)$ operations. In 2d, this is ${\cal O}(N^2)$; though this is a higher
 complexity than, for example, assembling the linear system which takes ${\cal
 O}(N)$, the constant for computing the decomposition is so small that it
 doesn't become the dominating factor in the entire program until we get to
-very large numbers of unknowns in the high 100,000s or more.)
+very large %numbers of unknowns in the high 100,000s or more.)
 
 The situation changes in 3d, because there we quickly have many more
 unknowns and the bandwidth of matrices (which determines the number of