Help


from Brown Corpus
« »  
We have shown that the graph of F contains at least one component whose inverse is the entire interval {0,T}, and whose multiplicity is odd.
There must be an odd number of such components, which will be called complete components.
The remaining ( incomplete ) components all have an even number of ordinary points at any argument, and are defined only on a proper sub-interval of Aj.

1.986 seconds.