>
> ValueError: Refining interval that does not bound unique root!
>
>
>
>
>
> On Sat, Apr 1, 2023 at 12:02 PM vdelecroix <20100.d...@gmail.com> wrote:
> >
> > Dear Marcel,
> >
> > It is a pity that this does not work more directly. Here is a wor
t; QQbar.polynomial_root(sage_poly, sage_approx)
>
> Outputs:
>
> ValueError: Refining interval that does not bound unique root!
>
>
>
>
>
> On Sat, Apr 1, 2023 at 12:02 PM vdelecroix <20100.d...@gmail.com> wrote:
> >
> > Dear Marcel,
> >
>
> ValueError: Refining interval that does not bound unique root!
>
>
>
>
>
> On Sat, Apr 1, 2023 at 12:02 PM vdelecroix <20100.d...@gmail.com> wrote:
> >
> > Dear Marcel,
> >
> > It is a pity that this does not work more directly. H
Dear Marcel,
It is a pity that this does not work more directly. Here is a work around
to achieve what you want to do
sage: exp = sympify("CRootOf(x**5 + x + 1, 0)")
sage: sage_poly = QQ['x'](list(map(QQ, reversed(exp.poly.rep.rep
sage: sage_approx = RIF(exp.n()) + RIF(-1e-30, 1e-30)
sage: Q
I agree with you. Nevertheles, here is a partial answer to Raman question.
If take a simpler recurrence than yours
1) a_0 = 0, a_1 = 1, b_0 = 1 and b_1 = 0
2) for n >= 0, a_{n+1} = 2 * a_n + b_n and b_{n+2} = a_n + 3 * b_n
@cached_function
def a(n):
if n == 0: return 0
elif n == 1: re
It does make sense for a computer. The following code is perfectly valid
{{{
a = 4
a = 3 * a
}}}
V.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support
Hi,
It seems to be a problem with the version of openssl. See also the related
http://ask.sagemath.org/question/1641/importerror-cannot-import-name-md5
Vincent
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and
> > I am iterating through all partitions p of a fixed length k ( let's
> > say using Partitions (size, length=k) ) and I have written a function
> > which return true if the partition p has atleast one part repeated. I
> > can use a for loop and get the thing done easily.
> > But is there a way I
Hello,
I'm trying to implement an algorithm for factorization of bivariate
polynomials. A step of the algorithm is Hensel lifting and I was not
able to coerce a Taylor development of degree k into a Taylor
development of degree k+1. More precisely, I have a polynomial in the
quotient ring R[t] / (
Hello,
> thanks, I tried all that onwww.sagenb.org.
> I could access files many of the files of 221 visible 'users' in /
> home,
> like some vincent, a certain notorious wstein, a victor, a carlos, a
> Ulrike etc. by
>
> import os; dn = '/home/some_user'; os.listdir(dn);
> os.chdir(dn); fin = open
Hello,
> I would like to know whether I could write a user defined module,
> store it on e.g. our (!) SAGE server sage.informatik.hs-bremen.de
> and access functions of such a module by importing the module into
> another module on the the SAGE server.
You just have to write in a cell
attach "
Hello,
I get a strange error while constructing permutation from a cycle
decomposition. Is it a bug or not the right way to build a
permutation ?
{{{
sage: G = SymmetricGroup(3)
sage: G([(2,3), (1,)])
(2,3)
sage: G([(1,), (2,3)])
---
12 matches
Mail list logo
