Jacques Gélinas on Sun, 08 Oct 2017 10:09:19 +0200
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
- To: "pari-users@pari.math.u-bordeaux.fr" <pari-users@pari.math.u-bordeaux.fr>
- Subject: RE: a(n+1) = log(1+a(n))
- From: Jacques Gélinas <jacquesg00@hotmail.com>
- Date: Sun, 8 Oct 2017 08:09:08 +0000
- Accept-language: fr-CA, en-US
- Delivery-date: Sun, 08 Oct 2017 10:09:19 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=hotmail.com; s=selector1; h=From:Date:Subject:Message-ID:Content-Type:MIME-Version; bh=n48XVVd+Pt7QTeViRdRMtZaAYdeLfrl4AroPIBPNOPw=; b=TPSHlsNk35ndeNJqjEyRn+GGY8SrjM7xXsVwkolEA3tyh/oRnfTISQb2TQ2LIBWEwvJZWrAa/7k4kfmJoQNXdaDQ6UiU2iNMAtCRrYlsTX0QptA2wrko6FoJaoipY8OzHg5dn0RE9xt+FcX/AzwOS8KAE+hl9++9HlKn1T11CIruFueUE4AXfbhISciAAR0epEa5PLDD14RJ6wU+eICRxfB7mobQ1CJDhuRGLlg0AEJCCNdc9QPVPdWGnnDQTQ7/QBMTT7iGoeR6qU5lSRivrXr8Y6fseK3QPByfF7Yt2+Z7bCmxFULsAM6ZBjWpNXDbMjehjjdSOjJ/mr0eR02yvg==
- In-reply-to: <CAKxJ458M4Pg3SezjxuueJbGaCPMdZ0qgmHn1ORH5fVMbuLS+Gw@mail.gmail.com>
- References: <CAKxJ458M4Pg3SezjxuueJbGaCPMdZ0qgmHn1ORH5fVMbuLS+Gw@mail.gmail.com>
- Spamdiagnosticmetadata: NSPM
- Spamdiagnosticoutput: 1:99
- Thread-index: AQHTP+fKtjSP1bZwQUCnWP70alB7Y6LZl8c/
- Thread-topic: a(n+1) = log(1+a(n))
Precompute the logarithm values once for all.
v=2;V=vector(400,n,v=log(1+v));
g(n)=n*(n*V[n]-2)/log(n);
g(400)
Jacques Gélinas
De : Elim Qiu <elim.qiu@gmail.com>
Envoyé : 7 octobre 2017 23:44
À : pari-users@pari.math.u-bordeaux.fr
Objet : a(n+1) = log(1+a(n))
I'm study the behavior of n(n a(n) -2) / log(n)
where a(1) > 0, a(n+1) = log(1+a(n))
Using Pari:
f(n) =
{ my(v = 2);
for(k=1,n, v = log(1+v));
return(n*(n*v -2) / (log(n)));
}
It turns out the program runs very slowly. The same logic in python runs 100 time faster but not have the accuracy I need.
Any ideas?
Thanks