Post Reply 
(49G) Prime Counting Programme
08-03-2015, 03:22 PM
Post: #2
RE: HP 49G: Prime Counting Programme
An APPROXIMATE solution to the prime count question is given by Locker-Ernst's formula

p(n) ≈ n / ( H(n) - 3 / 2 )

H(n) the nth harmonic number.

In the programme below the harmonic number function is replaced by the HP 49G function Psi(n) (FPTR 7 11E is the Psi function for long reals), as Psi(n+1)+gamma gives H(n).

Code:

::
  CK1&Dispatch
  BINT1
  ::
    %>%%
    DUP
    %%1+_
    FPTR 7 11E
    %% 9.22784335098467E-1
    %%-
    %%/
    %%>%
  ;
;
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
(49G) Prime Counting Programme - Gerald H - 08-02-2015, 08:55 AM
RE: HP 49G: Prime Counting Programme - Gerald H - 08-03-2015 03:22 PM



User(s) browsing this thread: 1 Guest(s)