Marvin Ray Burns

 I've been using Maple since 1997 or so.

MaplePrimes Activity

These are replies submitted by Marvin Ray Burns


Let x=MRB constant and a= the constant that is the real root of 36503*n^3-33411*n^2+10301*n-4610.

a=sin(79*x) with an error < 55/10000000000000000000000.


 restart; Digits := 23; x := .1878596424620671202485; a := fsolve(36503*n^3-33411*n^2+10301*n-4610, n); a-sin(79*x)



Let x=MRB constant and k=Theodorus's Constant = sqrt(3)

(82*k)/209+113/394 = -cos(85*x)with an error < 89/100000000000000000000

restart; Digits := 23: x := .1878596424620671202485: k := sqrt(3); a := (82*k)/209+113/394 : evalf(a+cos(85*x))


Let e = the number e, x=MRB constant and j=Foias Constant ~= 1.187452351126501054595

(200*exp(1)-1149*j)/2709  = cos(10*x) with an error < 14/1000000000000000

restart; Digits := 23; x := .1878596424620671202485; j := 1.187452351126501054595; a := (200*exp(1)-1149*j)*(1/2709); evalf(a-cos(10*x))




Let x =MRB constant and h = Alladi - Grinstead Constant ~=.80939402054063913071793188059409131.


(2095 - 3303*h)/(450*h - 620) = 77^x with an error < 82/1000000000000000000.



Digits := 23; x := .1878596424620671202485; h := .80939402054063913071793188059409131; a := (2095-3303*h)/(450*h-620); b := 77^x; b-a



Let x =MRB constant and g=Gompertz' s constant ~=0.596347362323194074341078499369.

(5300 + 800*g)/(1497 + 2910*g) = 22^x with an error < 65/10000000000000000000

Digits := 23; x := .1878596424620671202485; g := .596347362323194074341078499369; a := (5300+800*g)/(1497+2910*g); b := 22^x; a-b



 Let x=MRB constant and d=Hall-Montgomery Constant ~= 0.17150049314153606586


(18+210*d)/(778+37*d) = log(2)-1+2*x with an orror ~=222/10000000000000000

Digits:=23:x:= .1878596424620671202485: d := .17150049314153606586: evalf((210*d+18)/(37*d+778)+(1-log(2)-2*x))




Let e= the number e, x=MRB constant and f=Viswanath's constant ~= 1.1319882487943

5*exp(1)-41018*f*(1/17773) = 10-log(2*x) with an error ~= 25*10^(-16).

Digits := 18; x := .1878596424620671202485; f := 1.1319882487943; a := evalf(5*exp(1)-41018*f*(1/17773)); b := 10-log(2*x); a-b



The previous mentioned article is published; see .

Let x=MRB constant and c=Takeuchi-Prellberg Constant ~= 2.239433104005260731754785.


(59-4016*c) / (44+3407*c) = log(1/2-x) with an error < 12/10000000000000000000.

Digits := 23; x := .1878596424620671202485; c := 2.239433104005260731754785; a := (59-4016*c)/(44+3407*c); b := log(1/2-x); abs(a-b)


 Back in 1994 I guess I went a little crazy and started excessively playing with numbers. I even had a dream about them and started to think they were trying to tell me things. (Did I say crazy?)  However, in Jan, of 1999 I was still ignorant enough to think I could discover a new constant. I mentioned that I even had one notable “number dream.” Close to the very end of 1998 I had a very vivid dream about the integers. It kind of led me to playing with roots of positive integers, looking for some type of curve that got “flatter and flatter.” The “sum function” really intrigued me at that time so I began to spend a good deal of my nervous energy playing with it. I began to reason that the only way the sum function was going to produce a graph that became flatter and flatter was to use an alternating series. I was familiar with them from when I wrote a couple of programs for my new calculator, a TI 92 a step up from my Casio grapher. The programs computed an arbitrary number of digits for sine and cosine. Since my TI 92 had a sum function I used it, the Inverse Symbolic Calculator and then a version of Mathcad, that I got real cheap, to experiment with alternating sums of the roots of integers. By Jan 11, 1999 I had a little expression that when calculated seem to give a result that converged.  I began to think of the result of that computation as a constant. I first called the constant rc for root constant: see


 I kept on writing people and posting messages, on Dave's math tables and Algebra online, about that constant. Here is another message, I started a few days later, One person I had previously wrote to a bit, about numeric computations involving logarithms I wanted to do on My TI 92, was Simon Plouffe. I knew he kept a table of constants on the Inverse Symbolic Calculator, so I blatantly told him that I discovered a new constant. I’m sure he took that with a grain of salt; nonetheless he told me that he would put it into his table of constants. He referred to it simply as Marvin Ray Burns’ constant. I assume he just meant, “The constant that Marvin mentioned.” When he republished his list of constants on, he called it the MRB constant.  



That is pretty good.


EnvFormal := true; sum((-1)^n*(n-a), n = 1 .. infinity) correctly gives -1/4+(1/2)*a.


Now if maple adds to its tool box the sybmolic form of the MRB constant, it will be able to correctly compute a symbolic solution for 
 EnvFormal := true;sum((-1)^n*(n^(1/n)-a), n = 1 .. infinity).

It is my desire to find even more series that have closed form solutions involving the MRB constant. If I find a series that also has a closed form without  it, I will have a closed form for the MRB constant.



True, but evalf(sum) by its nature always gives an approximate value. I am wishing for exact and symbolic solutions for such sums.


Here is a recently eddited version of my paper: .

i hope to get some feedback.

Over the last several days I've had someone help me edit the paper and I have corrected a couple of gross errors and made many small revisions.

I am looking for some feedback whether it is favorable or not.

I computed 299,998 Digits of the MRB constant.

The computation began

Fri 13 Aug 2010 10:16:20 pm EDT  

and ended

 6:27:43 pm EDT  |  Wednesday, September 8, 2010.

 With Mathematica 6.0 for Microsoft Windows (64-bit) (June 19, 2007)

 That is an average of


seconds per digit..

I used my Dell Studio XPS 8100 i7 860 @ 2.80 GH 2.80 GH with 8GB physical DDR3 RAM. Windows 7 reserved an additional 48.929 GB virtual Ram.

This confirms my previous computation of 260,000 digits.

Here is a link to the digits:


Below is a new abstract for

The previous version of the paper is at

Do you have a preference for one or the other abstract?


The MRB constant is the upper limit point of the sequence of partial sums defined by S(x)=sum((-1)^n*n^(1/n),n=1..x). The goal of this paper is to show that the MRB constant is geometrically quantifiable. To “measure” the MRB constant, we will consider a set, sequence and alternating series of the nth roots of n.  Then we will compare the length of the edges of a special set of hypercubes or n-cubes which have a content of n. (The two words hypercubes and n-cubes will be used synonymously.) We will finally look at the value of the MRB constant as a representation of that comparison, of the length of the edges of a special set of hypercubes, in units of dimension 1/ (units of dimension 2 times units of dimension 3 times units of dimension 4 times etc.). For an arbitrary example we will use units of length/ (time*mass* density*…).

5 6 7 8 9 10 11 Last Page 7 of 19