@Override public IExpr evaluateArg1(final IExpr arg1) { if (isNegativeExpression(arg1)) { return Times(CN1, Cot(Times(CN1, arg1))); } return null; }
@Override public IExpr evaluateArg1(final IExpr arg1) { IExpr negExpr = AbstractFunctionEvaluator.getNormalizedNegativeExpression(arg1); if (negExpr.isPresent()) { return Negate(Coth(negExpr)); } IExpr imPart = AbstractFunctionEvaluator.getPureImaginaryPart(arg1); if (imPart.isPresent()) { return F.Times(F.CNI, F.Cot(imPart)); } if (arg1.isZero()) { return F.CComplexInfinity; } return F.NIL; }
IExpr negExpr = AbstractFunctionEvaluator.getNormalizedNegativeExpression(arg1); if (negExpr.isPresent()) { return Negate(Cot(negExpr)); if (parts.arg2().isInteger()) { return Cot(parts.arg1()); IFraction rest = F.fraction(divRem[1], f.denominator()); if (!divRem[0].isZero()) { return Cot(Plus(parts.arg1(), Times(rest, Pi))); return Cot(parts.arg1());
return Cot(Subtract(Divide(Pi, C2), arg1));
F.Cot(x_), // F.Cos(x))); F.Cot(x_), // F.C1)); TIMES_ORDERLESS_MATCHER.defineHashRule(new HashedPatternRulesTimes(// TIMES_ORDERLESS_MATCHER.defineHashRule(new HashedPatternRulesTimesPower(// F.Power(F.Cot(x_), F.n_DEFAULT), // F.Condition(F.Times(F.Power(F.Csc(F.x), F.Plus(F.m, F.n)), F.Power(F.Cos(F.x), F.n)), F.And(F.Not(F.NumberQ(F.m)), F.IntegerQ(F.n), F.Greater(F.n, F.C0))))); F.Cot(x)));
Times(CN1D2, Subtract(Sin(Subtract(x, y)), Sin(Plus(x, y))), Sec(y))); ORDERLESS_MATCHER.defineHashRule(Cos(x_), Cot(y_), Times(C1D2, Plus(Cos(Subtract(x, y)), Cos(Plus(x, y))), Csc(y))); ORDERLESS_MATCHER.defineHashRule(Sin(x_), Cot(y_), Times(C1D2, Plus(Sin(Subtract(x, y)), Sin(Plus(x, y))), Csc(y)));