public static string solveRecursion(int refVal, int refResult, int nVal, string eq)
{
string[] eqArr = eq.Split(new string[] { "f(n) = f(n - 1)" }, StringSplitOptions.None);
eq = eqArr[1];
string eqString = $"x{eq}";
int difference = nVal - refVal;
int lastResult = refResult;
Console.WriteLine(lastResult.ToString());
for (int i = 0; i < difference; i++)
{
lastResult = Int32.Parse(DetectPage.solveItem(eqString, lastResult.ToString()));
}
return($"f({nVal.ToString()}) = {lastResult.ToString()}");
}
public static string FnCompLauncher(string fx, string gx, string sxval, string mode)
{
try
{
if (mode == "f(g(x))")
{
return($"f(g({sxval})) = " + DetectPage.solveItem(fx, DetectPage.solveItem(gx, sxval)));
}
else if (mode == "g(f(x))")
{
return($"g(f({sxval})) = " + DetectPage.solveItem(gx, DetectPage.solveItem(fx, sxval)));
}
}
catch
{
return("");
}
return("Invalid mode selected");
}
public static string solveSigma(int startVal, int endVal, string eq)
{
string eqString = "";
for (int i = 0; i < eq.Length; i++)
{
if (eq[i] == 'n' || eq[i] == 'N')
{
eqString += "x";
continue;
}
eqString += eq[i].ToString();
}
int sigmaSum = 0;
for (int i = startVal; i <= endVal; i++)
{
sigmaSum += Int32.Parse(DetectPage.solveItem(eqString, i.ToString()));
}
return($"Σ {eq} = {sigmaSum.ToString()}");
}
