PR #11510 introduced some method to fixing the problems that the dsolve faced to solve systems of ODEs. But, it has already been solved by the solvers added in the past few months.

We want to remove the PR but there are some test cases added in the PR that can be used to check the current functionality added. We want test cases added in `te

Migrated from https://bitbucket.org/gap-system/gap/issues/31/maximumlist-and-minimumlist-wrt-to

@JHahnHRO created an issue 2014-08-29

The sort method has a version that is able to sort a list w.r.t. to any given ordering instead of the ordering defined by <. But analogous methods for maximum and minimum finding are missing. I've attached my suggestion of how to implement these methods. It w

Pretty-print GATs as LaTeX in both of the following styles:

1. Cartmell-style linear notation

2. natural-deduction-style tree notation
   <img width="680" alt="image" src="https://user-images.githubusercontent.com/316610/91097121-f953b080-e613-11ea-8dda-8da598

Implement an improved Binet formula.

See:

• https://medium.com/cantors-paradise/fastest-fibonacci-9273e2a1805d
• https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula

The current implementation can be found here:

• https://github.com/axkr/symja_android_library/blob/625f6dcc3375abddd46c0f86704da97a70a7eb27/symja_android_library/matheclipse-core/src/main/java/org/matheclipse/core/b

The mark note for algiorithms often looks like this:

apply(note1);
apply(note2);
apply(note3);
...

It would be more convenient to write

apply(note1, note2, note3, ...)

Presumably this just calls atan2 and hypot...

Could also investigate whether upstream Octave can be improved to make these "just work" on any class that has atan2 and hypot.

It could be more informative on pypi.org:

The right column must be expanded to roughly match the left one.