Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2009-09-27, 16:52   #1
Damian's Avatar
May 2005

2728 Posts
Default Bernoulli Number's conjeture?

Is this a known bernoulli number conjeture/theorem?:
The denominators of B_n (when expressed as an irreducible fraction), doesn't contain as a factor powers of prime numbers (ex. isn't divided by 5^2)


B_2 = \frac{1}{6}
6 = 2\cdot3

B_4 = \frac{-1}{30}
30 = 2\cdot3\cdot5

B_{24} = \frac{-236364091}{2730}
2730 = 2\cdot3\cdot5\cdot7\cdot13

I know Ramanujan proved that the denominator contain 2 and 3 as a factor one and only once, but I hadn't heard that any prime on the factorization of the denominator happens only once.
Damian is offline   Reply With Quote
Old 2009-09-27, 18:39   #2
Orgasmic Troll
Cranksta Rap Ayatollah
Orgasmic Troll's Avatar
Jul 2003

641 Posts
Orgasmic Troll is offline   Reply With Quote
Old 2009-09-27, 20:37   #3
Damian's Avatar
May 2005

2728 Posts

Originally Posted by Orgasmic Troll View Post
Thank you!
It's very interesting.
I would be interested in any related information to this.

It seems it doesn't work for numerators, as I run on wxMaxima:

it returned:
Damian is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Does anyone track factors for Bernoulli numbers? VBCurtis And now for something completely different 1 2015-02-08 02:45
Bernoulli(202) C173 bai Factoring 2 2012-10-22 23:16
Bernoulli(200) c204 akruppa Factoring 114 2012-08-20 14:01
Bernoulli number Batalov Math 5 2009-06-01 22:10
Bernoulli and Euler numbers (Sam Wagstaff project) fivemack Factoring 4 2008-02-24 00:39

All times are UTC. The time now is 02:59.

Sun Oct 24 02:59:22 UTC 2021 up 92 days, 21:28, 0 users, load averages: 0.92, 1.28, 1.33

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.