Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.soft-sys.math.maple > #952

Re: A simplification challenge.

Show all headers | View raw

On 11.09.2014 19:53, peter.luschny@gmail.com wrote:
> Once upon the time an old friend of Maple from the Crimea
> used to post simplification challenges to this group.
>
> In recollection of Vladimir today's simplification challenge:
>
> bi:=n->BesselI(4+n,-2); bk:=n->BesselK(4+n,2);
> i:=n->BesselI(n,2); k:=n->BesselK(n,2);
>
> Simplify
> a := n ->(bi(n)*(5*k(5)-k(6))+bk(n)*(5*i(5)+i(6)))/(i(6)*k(5)+i(5)*k(6));
>
> Peter
>
> P. S. Note seq(round(evalf(a(n), 99)), n=0..20);

Hm ... http://oeis.org/A058309 due to your hint: using the package 'gfun'
finds a recursion rec := {-u(n)+(-n-5)*u(n+1)+u(n+2), u(0)=0, u(1)=1},
feeding a for u and calling 'simplify' confirms it.

Maple can not solve it. Could it be that Janson's article (in the link)
gives a more simple expression for your a(n) ?

Back to comp.soft-sys.math.maple | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

A simplification challenge. peter.luschny@gmail.com - 2014-09-11 10:53 -0700
  Re: A simplification challenge. Axel Vogt <&noreply@axelvogt.de> - 2014-09-12 19:30 +0200
    Re: A simplification challenge. peter.luschny@gmail.com - 2014-09-12 13:29 -0700
      Re: A simplification challenge. Axel Vogt <&noreply@axelvogt.de> - 2014-09-12 22:50 +0200
        Re: A simplification challenge. peter.luschny@gmail.com - 2014-09-13 11:46 -0700
          Re: A simplification challenge. Axel Vogt <&noreply@axelvogt.de> - 2014-09-13 22:06 +0200

csiph-web