The conjecture (now known not to be true in general) was that......
In other algorithms, this may not be true.
This is not true of F. [Or: for F]
This works regardless of [= irrespective of] whether B is true or false.
Let us now take a quick look at the class N, with the purpose of determining how much of Theorems 1 and 2 is true here.
This suggests a question: under what conditions is it true that......?
Only in exceptional circumstances is it true that f(x+y)=f(x)+f(y). [Note the inversion.]
Go to List of words starting with:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
Y
Z