BTW :
sage: solve(1+2*log(x+1, 4)==2*log(x,2), x, to_poly_solve="force")
[x == -sqrt(3) + 1, x == sqrt(3) + 1]
HTH,
Le samedi 9 avril 2022 à 11:34:10 UTC+2, wdjo...@gmail.com a écrit :
> On Sat, Apr 9, 2022 at 5:18 AM Paolo Robillos
> wrote:
> >
> > Hi,
> >
> > I am trying to solve the
Hi everyone,
Is there a way to implement Kruskal's algorithm for finding the MST of an
undirected graph using priority queues? The standard implementation uses
the disjoint set data structurel but I was curious if a PQ implementation
is possible, and potentially even better in time complexity.
On Sat, Apr 9, 2022 at 5:18 AM Paolo Robillos wrote:
>
> Hi,
>
> I am trying to solve the following equation for x, 1+2log(x+1, 4)==2log(x,2)
>
> I entered in the input "(1+2log(x+1,
> 4)==2log(x,2)).solve(x,algorithm='sympy', domain='all')"
>
> and the Output was
Hi,
I am trying to solve the following equation for x, 1+2*log(x+1, 4)==2*
log(x,2)
I entered in the input "(1+2*log(x+1,
4)==2*log(x,2)).solve(x,algorithm='sympy',
domain='all')"
and the Output was
"{푥∣푥∈ℂ∧−푥2log(2)+푒(푥+1)1log(2)=0}∖{푥∣푥∈ℂ∧푥2log(2)=0}"
The answer I am looking for is "x