Suppose I have code like this:
l := [44, 178, 412, 746, 1168, 1669, 2260, 2941, 3712, 4573, 5524, 6565]
guess(l).1
Replacing the "guess" with a "guessRat" is essentially the same thing AFAIU.
The above code returns a value of type Expression(Integer) that
represents (visually, at least) a recurrence relation. The recurrence
relation obviously defines a rational function, which means the
operation was technically a success.
The problem is that if I try to convert the Expression to an actual
rational function in a naive manner, as illustrated in the following,
the conversion fails:
guess(l).1::Fraction(Polynomial(Integer))
So, how difficult would it be to accomplish what I want, either by
improving the Guess package or by writing my own code? Note that I am
able to do the conversion in my head, what I'm asking about is how to
do it in Fricas, mechanically.
My motivation for this is that I want to do iterative guessing, i.e.
guess (using GuessInteger) a rational function for each member of a
List(List(Integer)), and then use GuessPolynomialInteger on the list
of rational functions.
Thanks,
Neven
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/CAL%2BbK4MM%3DzYOKi4oH8iLJJtgJoXDPEsm5esu20K%3DYpHWEQwsRA%40mail.gmail.com.
