The implementation and exploration of an algorithm that supports the proof of inequalities

We propose the implementation in Mathematica of an algorithm to prove inequalities of sequences provided that inequalities are known for the error term of the asymptotic expansion of theses sequences. This algorithm enables one to prove inequalities like log concavity which is a topic of interest in the research community.

We propose the implementation in Mathematica of an algorithm to prove inequalities of sequences provided that inequalities are known for the error term of the asymptotic expansion of theses sequences. This algorithm enables one to prove inequalities like log concavity which is a topic of interest in the research community.