Tag Info

New answers tagged

1

expr = 2 x^2 + 7 x + 2; expr2 = (x + a) (x + b) + x (x + c); expr2 /. Solve[Equal @@ (CoefficientList[#, x] & /@ {expr, expr2}), {a, b, c}, Integers][[-1]] (1 + x) (2 + x) + x (4 + x)


2

This will generate your sequence: new[n_] := Module[{digs = Flatten@Map[IntegerDigits, ConstantArray @@@ FactorInteger[n], {2}]}, n*10^Length@digs + FromDigits@digs]; Nest[new,2,6] (* {2, 22, 22211, 22211719167, 2221171916731111313195493, \ 222117191673111131319549333123883568997108723797801, \ ...


3

Here is an approach based on finding an approximate root, bumping to an approximate factor using GroebnerBasis, and resolving as an exact factor using RootApproximant. poly = 3 - 6*x^2 + 3*x^4 - 10*y^2 + 6*x^2*y^2 + 3*y^4; x0 = 11/7; roots = y /. NSolve[poly /. x -> x0, WorkingPrecision -> 400]; root1 = First[roots]; fac = First[ ...



Top 50 recent answers are included