Skip to content

Instantly share code, notes, and snippets.

View halirutan's full-sized avatar

Patrick Scheibe halirutan

  • Neurophysics Dep. at Max Planck Institute for Human Cognitive and Brain Sciences
  • Leipzig, Germany
View GitHub Profile
Notebook[{
Cell[CellGroupData[{
Cell[BoxData[
RowBox[{"1", "+",
"2"}]], "Input",ExpressionUUID->"1af99729-7bba-4838-8e03-17d288233302"],
Cell[BoxData["3"], \
"Output",ExpressionUUID->"67bda01c-13f0-4dbf-8242-e9fd46ff6237"]
}, Open ]]
javascript:(function(){if(window.MathJax===undefined){var%20script%20=%20document.createElement("script");script.type%20=%20"text/javascript";script.src%20=%20"https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML";var%20config%20=%20%27MathJax.Hub.Config({%27%20+%20%27extensions:%20["tex2jax.js"],%27%20+%20%27tex2jax:%20{%20inlineMath:%20[["$","$"],["\\\\\\\\\\\\(","\\\\\\\\\\\\)"]],%20displayMath:%20[["$$","$$"],["\\\\[","\\\\]"]],%20processEscapes:%20true%20},%27%20+%20%27jax:%20["input/TeX","output/HTML-CSS"]%27%20+%20%27});%27%20+%20%27MathJax.Hub.Startup.onload();%27;if%20(window.opera)%20{script.innerHTML%20=%20config}%20else%20{script.text%20=%20config}%20document.getElementsByTagName("head")[0].appendChild(script);(doChatJax=function(){window.setTimeout(doChatJax,1000);MathJax.Hub.Queue(["Typeset",MathJax.Hub]);})();}else{MathJax.Hub.Queue(["Typeset",MathJax.Hub]);}})();
@halirutan
halirutan / Greetings.md
Last active July 9, 2018 16:44
StackExchange standard greeting comments

StackExchange greetings

The list below is an extended version of the answers from this post and it is meant to contain easy to copy comments for new users.

Standard greetings

Welcome to Mathematica.SE! I suggest the following:

  1. As you receive help, try to give it too, by answering questions in your area of expertise.
  2. Take the [tour] and check the faqs!
  3. When you see good questions and answers, vote them up by clicking the gray triangles, because the credibility of the system is based on the reputation gained by users sharing their knowledge.
This file has been truncated, but you can view the full file.
Int[(u_.)*((a_) + (b_.)*(x_)^(n_.))^(p_.), x_Symbol] := Int[u*(b*x^n)^p, x] /; FreeQ[{a, b, n, p}, x] && EqQ[a, 0]
Int[(u_.)*((a_.) + (b_.)*(x_)^(n_.))^(p_.), x_Symbol] := Int[u*a^p, x] /; FreeQ[{a, b, n, p}, x] && EqQ[b, 0]
Int[(u_.)*((a_) + (c_.)*(x_)^(j_.) + (b_.)*(x_)^(n_.))^(p_.), x_Symbol] := Int[u*(b*x^n + c*x^(2*n))^p, x] /; FreeQ[{a, b, c, n, p}, x] && EqQ[j, 2*n] && EqQ[a, 0]
Int[(u_.)*((a_.) + (c_.)*(x_)^(j_.) + (b_.)*(x_)^(n_.))^(p_.), x_Symbol] := Int[u*(a + c*x^(2*n))^p, x] /; FreeQ[{a, b, c, n, p}, x] && EqQ[j, 2*n] && EqQ[b, 0]
Int[(u_.)*((a_.) + (c_.)*(x_)^(j_.) + (b_.)*(x_)^(n_.))^(p_.), x_Symbol] := Int[u*(a + b*x^n)^p, x] /; FreeQ[{a, b, c, n, p}, x] && EqQ[j, 2*n] && EqQ[c, 0]
Int[(u_.)*((w_.) + (a_.)*(v_) + (b_.)*(v_))^(p_.), x_Symbol] := Int[u*((a + b)*v + w)^p, x] /; FreeQ[{a, b}, x] && !FreeQ[v, x]
Int[(u_.)*(Px_)^(p_), x_Symbol] := Int[u*Px^Simplify[p], x] /; PolyQ[Px, x] && !RationalQ[p] && FreeQ[p, x] && RationalQ[Simplify[p]]
Int[a_, x_Symbol] := Simp[a*x, x] /; FreeQ[a, x]
Int[
This file has been truncated, but you can view the full file.
// {Sqrt[1 + 2*x], x, 1, (1 + 2*x)^(3/2)/3}
public void test00001() {
check("Integrate[Sqrt[1 + 2*x], x]", "(1 + 2*x)^(3/2)/3");
}
// {(1 + x)/(2 + 2*x + x^2)^3, x, 1, -1/(4*(2 + 2*x + x^2)^2)}
public void test00002() {
check("Integrate[(1 + x)/(2 + 2*x + x^2)^3, x]", "-1/(4*(2 + 2*x + x^2)^2)");
This file has been truncated, but you can view the full file.
Int[Times[Optional[Pattern[u, Blank[]]], Power[Plus[Pattern[a, Blank[]], Times[Optional[Pattern[b, Blank[]]], Power[Pattern[x, Blank[]], Optional[Pattern[n, Blank[]]]]]], Optional[Pattern[p, Blank[]]]]], Pattern[x, Blank[Symbol]]] := Int[u*(b*x^n)^p, x] /; FreeQ[{a, b, n, p}, x] && EqQ[a, 0]
Int[Times[Optional[Pattern[u, Blank[]]], Power[Plus[Optional[Pattern[a, Blank[]]], Times[Optional[Pattern[b, Blank[]]], Power[Pattern[x, Blank[]], Optional[Pattern[n, Blank[]]]]]], Optional[Pattern[p, Blank[]]]]], Pattern[x, Blank[Symbol]]] := Int[u*a^p, x] /; FreeQ[{a, b, n, p}, x] && EqQ[b, 0]
Int[Times[Optional[Pattern[u, Blank[]]], Power[Plus[Pattern[a, Blank[]], Times[Optional[Pattern[c, Blank[]]], Power[Pattern[x, Blank[]], Optional[Pattern[j, Blank[]]]]], Times[Optional[Pattern[b, Blank[]]], Power[Pattern[x, Blank[]], Optional[Pattern[n, Blank[]]]]]], Optional[Pattern[p, Blank[]]]]], Pattern[x, Blank[Symbol]]] := Int[u*(b*x^n + c*x^(2*n))^p, x] /; FreeQ[{a, b, c, n, p}, x] && EqQ[j, 2*n] && EqQ[a, 0]
Int[Times[Opti

Two months ago, Albert Rich posted "What's the hardest integral Mathematica running Rubi can find?" here on the Wolfram Community. You might have also seen that I answered in detail and pointed out the things that could help to improve Rubi. While it appears nothing really happened afterward, this is far from reality. Since then, Albert and I have worked closely together to make Rubi more accessible. If you like to read about how this all started, let me invite you to read my latest blog-post about our collaboration. However, here, we want to share an update that should serve as an overview of what we have done to improve Rubi.

First of all, Rubi has got a new home under rulebasedintegration.org and Albert's old site will no longer be updated. On the new website, you will find information, installation instructions, and links to the source-code and test-suites.

Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
\[Aleph];
\[Alpha];
\[And];
\[Angle];
\[Angstrom];
\[AscendingEllipsis];
\[Backslash];
\[BeamedEighthNote];
\[BeamedSixteenthNote];
\[Because];
/*
* Copyright (c) 2018 Patrick Scheibe
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*