mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 5 of 5
Search took 0.01 seconds.
Search: Posts Made By: fltdabbler
Forum: Puzzles 2007-08-29, 06:37
Replies: 14
Views: 1,078
Posted By fltdabbler
... and, yes, I'm off now... Though maybe a mod...

... and, yes, I'm off now... Though maybe a mod could rename the title of the thread?
Forum: Puzzles 2007-08-29, 05:16
Replies: 14
Views: 1,078
Posted By fltdabbler
Points taken. I didn't intend to misuse the...

Points taken. I didn't intend to misuse the forum; indeed I was grateful for the time spent on my query & said so. Especially for the pointers toward literature which I asked for and received. ...
Forum: Puzzles 2007-08-28, 22:06
Replies: 14
Views: 1,078
Posted By fltdabbler
1. Agreed; I don't have access to (or familiarity...

1. Agreed; I don't have access to (or familiarity with) computing resources for such testing. I realize it must be annoying for such as myself to waltz in spouting ideas which a) are old hat and...
Forum: Puzzles 2007-08-28, 07:53
Replies: 14
Views: 1,078
Posted By fltdabbler
You are quite right: I got over-excited, and not...

You are quite right: I got over-excited, and not a little obsessed over the issue. I should not have called it a conjecture. Please excuse my naivete: I realize I am dabbling in things over my...
Forum: Puzzles 2007-08-25, 03:56
Replies: 14
Views: 1,078
Posted By fltdabbler
Duncan's conjecture

any odd n is expressible as "some prime" + "some power "k" of two "

eg. for n< or = 2^6, k is an element or elements of {1,2,...2^5}

interestingly the number of elements (powers of 2)...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 20:39.


Fri Aug 6 20:39:02 UTC 2021 up 14 days, 15:08, 1 user, load averages: 2.43, 2.68, 2.81

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.