@janhardo P:-C is just another way of saying "command C from package P." It's an alternative to with(P,C) that I strongly prefer.

Regarding f-g: Consider this: "The area between f and g is the area below f (and g) minus the area below g." Does that make sense?

My guess is that if it can be done in Maple, then it'd be done with the "Stochastic Processes" tools in the Finance package. Have a look at the subsection "Stochastic Processes" of help page ?Finance. I don't expect that you'll find a stock solution for your equation, but you may be able to cobble togther something from the given tools.

A Google search on run lengths in random sequences yields some useful results. My first hit was a 2015 paper "New statistical randomness tests based on length of runs." I'd guess that one important application of this is forensic accounting. 

@Preben Alsholm You're more than welcome. Let me know if you want any further definitions. Here's an important one that I should've included. I didn't because it didn't pertain directly to this Question, but it's a very important class of graphs with many practical applications:

Definition 6: A graph with chromatic number 1 or 2 is called bipartite. Of course, the case where the chromatic number is 1 only contains the trivial graphs with no edges.

I find that writing formal definitions is very helpful for clarifying my thoughts. Some of the effort in mathematics education should be redirected from writing proofs to writing definitions.

@janhardo The area between curves f and g is evalf(Int(abs(f-g), x= 1..15)), regardless of which is on top. So, you don't need the intersections. However, they're not difficult to find: There's 1 and all points where sin(x)=cos(x)  => tan(x) = 1. So Pi/4+k*Pi.

@Preben Alsholm Preben, these formal definitions should provide everything that you need to know for this question. I only post this because you said that you know next to nothing about graph theory. So, sorry if this is already familiar material.

Definition 1: A partition P of a set S is a set of nonempty pairwise-disjoint sets whose union is S. The members of P are called the blocks of the partition.

Definition 2: A coloring of a graph is a partition of its vertices such that no two vertices in the same block share an edge. If the coloring has k ​​​blocks, it's a k-coloring.

Definition 3: The chromatic number of a graph G is the minimal ​​​​​​k such that G has a k-coloring.

Definition 4: A k-clique of a graph is a k-subset of its vertices such that every pair of those vertices share an edge.

Definition 5: The clique number of a graph G is the maximal k such that G has a k-clique.

Obvious Theorem: For any graph G, CliqueNumber(G) <= ChromaticNumber(G).

@AHSAN Don't repost this same Question in other threads. And stop using the title "ODE solution".

@Carl Love Alas, specifying gridlines= false no longer works as a workaround for uploaded worksheets.

If you post some of those exercises, preferably with your solution attempts, people here will surely be able to respond.

@dantopa But note that you get the correct results with the 'col' option, as VV showed. When you examine 'col' after running the command, you'll get the color assignments, and you can easily verify that it's a valid coloring. What's more difficult to verify (indeed NP-complete difficult) is whether it's a minimal coloring. 

In Maple's 2D Input, you need to put a space after Pi. Without the space, there is no implied multiplication.

@Anthrazit Actually, using evalindets, it's trivial to generalize any procedure that acts on x of some particular (nonrecursive) type into a procedure that performs the same action on all x of that type contained in almost any superstructure, such as a Unit expression. Like this:

rnd2:= (x::realcons, n::integer)-> evalf[length(trunc(x))+n](round(x*10^n)/10^n): #Tom's original
Rnd2:= (super, n::integer)-> evalindets(super, float, x-> rnd2(x,n)): #massive generalization

I changed realcons to float because you'd probably not want to round exact constants (such as exponents) that may appear in some superstructures. Decimal exponents are nasty.

@Christopher2222 

I believe that Maple's first several generations were as an academic project. Now it's a corporate product. I believe that there were some generations where it was in an in-between state. So, the phrase "it's own product history" is ambiguous, and I think that that's the crux of the issue. It could be that the Maplesoft product history of Maple is complete as far as the versions of Maple that were produced by Maplesoft.

This is just to clarify both the Question and Kitonum's Answer regarding inverse. There is no command named inverse that applies in this situation. The inverse of Matrix S is S^(-1). For the uncommon cases where you need to use options with the inverse (e.g., for the pseudoinverse), you can use LinearAlgebra:-MatrixInverse(S, options). 

You may see a command inverse in some old code or old books. That command no longer applies, and it won't work on a Matrix.

@Joe Riel Thanks, Joe. You can find the most-recent code in the most-recent Reply to the most-recent Answer 

Now much faster and exports a procedure to check

below. All of the errors related compiled, multi-threaded, split-rank Iterators still occur. I also sent the code to you via email.