[see also: guarantee]
Theorem 3 is remarkable in that considerably fewer conditions than in the previous theorems ensure universality.
The hypothesis $n>1$ ensures that Lemma 2 is applicable.
Go to the list of words starting with: a
Copyright © 2011 by Jerzy Trzeciak, Warszawa 2011. All rights reserved.
Copyright © 2006-2011 by IMPAN. All rights reserved.
Copyright © 2006-2012 by IMPAN. All rights reserved.