-1
votes
0answers
23 views

How to easily and automatically transform recurrence equation to difference equation and back?

Recurrence equation is an equation that involves $f(x+1)$, $f(x+2)$, $f(x-1)$ for an unknown function f. Such equations can be represented in the form of finite differences, involving $\Delta f(x)$, ...
6
votes
2answers
104 views

Why is ToRadicals[] not able to handle all cases? Is there a workaround?

The documentation for the function ToRadicals says: ♦ There are some cases in which expressions involving radicals can in principle be given, but ...
1
vote
1answer
374 views

Graph and manipulate DSolve result

Given a DSolve example: ...
1
vote
1answer
291 views

Comparing two symbolic expressions

Does Mathematica provide any way to compare two symbolic expressions and find which is the greatest? For example, I want to find which is the greatest of ...
11
votes
2answers
541 views

Google Code Jam: Mountain View code review

After participating in Google Code Jam 2012 Round 2, it occurred to me that the Mountain View problem boiled down to solving a set of linear inequalities, which could be done in Mathematica. I've only ...