![]() |
|
|
#1 |
|
Dec 2004
3 Posts |
hi !
I hope I won't bother the forum since I am not specialist at all in these mersenne stuffs ... but when I saw the name of the website, I thought you might help me ! I need to have a closed expression of the product of the n first mersenne number, ie : P(n) = (1)x(3)x(5)x ... x(2^n-1) if it exists ... thanks for your help !! |
|
|
|
|
|
#2 |
|
Dec 2003
Hopefully Near M48
2·3·293 Posts |
Actually, the first three Mersenne numbers are 1, 3 and 7.
I'll wait for someone more knowledgeable to answer your question. Last fiddled with by jinydu on 2004-12-21 at 13:38 |
|
|
|
|
|
#3 | |
|
Dec 2004
316 Posts |
Quote:
let me resume (I hope i am in the right forum ?) : what is the product of the n first mersenne numbers, that is : P(n) = 1x3x7x15x31x ... x(2^n-1) ? In fact, I need this because i am searching : lim (n -> infinity) of Product_(from i = 1 to n) (1-2^(-i)) but if anyone has another way to achieve this, (s)he is welcome ! thanks for your help ! |
|
|
|
|
|
|
#4 |
|
Dec 2003
Hopefully Near M48
33368 Posts |
Unfortunately, I've learned plenty of things about infinite sums (mostly proving convergence or divergence), but school has never taught me anything about infinite products. So I don't really know how to attack such a problem...
I tried letting n = 10,000 and calculating the product using Mathematica. To 50 decimal places, the answer is: 0.28878809508660242127889972192923078008891190484069 But Mathematica balks at my attempt to evaluate the limit directly. |
|
|
|
|
|
#5 |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
11110000011002 Posts |
kerguilloud,
You might want to get familiar with The On-Line Encyclopedia of Integer Sequences (OEIS) at http://www.research.att.com/~njas/sequences/ . OEIS has information about more than 100,000 integer sequences. You can look up your sequence 1, 3, 21, 315, 9765, ... (1, 1*3, 1*3*7, 1*3*7*15, 1*3*7*15*31, ...) there and find that it's listed as sequence A005329, "Product(2^i - 1), i=1..n. Also called 2-factorial numbers." There are links to related sequences, including various formulas. There also are links to both the decimal expansion (jinydu's Mathematica approximation is correct to 30 places) for lim (n -> infinity) of Product_(from i = 1 to n) (1-2^(-i)) and the continued fraction for it. OEIS is valuable. Bookmark it. |
|
|
|
|
|
#6 |
|
May 2003
154710 Posts |
Also see http://mathworld.wolfram.com/InfiniteProduct.html
It isn't too hard to prove that the product actually does converge. It is only slightly more difficult to see that it isn't rational. |
|
|
|
|
|
#7 | ||
|
Dec 2004
38 Posts |
Quote:
Quote:
) for these great links and solutions ...I am disappointed that the result has no closer epxression than one using elliptic functions ... but still I thank you for illuminating my mind on this problem ! see you !!
|
||
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| A Mersenne number exercise | lukerichards | Number Theory Discussion Group | 12 | 2018-01-22 16:45 |
| Maximum number of consecutive integers where the product is 1 (mod n). | carpetpool | Miscellaneous Math | 14 | 2017-02-26 15:55 |
| Number of distinct prime factors of a Double Mersenne number | aketilander | Operazione Doppi Mersennes | 1 | 2012-11-09 21:16 |
| Number of Factors for a Mersenne Number | kurtulmehtap | Math | 12 | 2010-05-03 14:02 |
| Mersenne NUmber Factoring | andi314 | Math | 4 | 2002-11-26 14:25 |