I am currently “down for repairs” with my desktop and the new machine is awaiting parts but once I have access to the hard drives again that large factor I can share. I take it a simple export in GMP is what is required. I’ll have to ask Mark if that is how he generated million digit. I think that is the case. On that maybe I should give a copy to Mark as well.

If anyone is interested is seeing if we are trying to compress a prime number I have no problem sharing some technology and the number I believe is a factor.

The old desktop needs a older quad core and I have to find someone who has the older chip but when all is done here that quad core is available to run factoring efforts.
I am open to working with others in determining is we are trying to compress a prime number or not. Maybe we can conjecture no prime number is compressible?
If nothing else is used I know recursive modulus will do the search for factors but I am open to suggestions.
What do people think of GMP’s prime number test?

With recursive modulus as I employed it, it will search from the number minus one to one so it will cover the ground albeit mechanically.
With recursive modulus we can divide the search into sections and share the work such that each of us can get a block and process so we all don’t overlap.

Other than that I will be slowing down on the number of hours I have for computer with the coming of spring. I am still hopeful I will find a full time job with benefits and it looks surprisingly hopeful with the resent up-tick of hiring across the Nation and especially locally.

Alright then, I hope to check out that factor candidate. At this point I conjecture there only three factors but that could change if this nearly a million digit number is composite.
And again if there is interest in working the number with me just let me know. It would be fun to work with others for a change.

Ernst

When I learned of the Collatz Conjecture I was in class at the junior college taking introduction to programming using the newest programming language C in 1991 and Pascal had just been replaced by C for the class.
I fell deep in to the magic of all things that cycle like the famous 3x+1,x/2 Collatz Conjecture.
As time went on I discovered many things through my private efforts like there are infinite systems for 3x+y where Y is odd.
I also saw the series of systems where collatz fits in I can understand all the systems and I know, without proof, that there are some strange dynamics in play in the true nature of whatever this reality is just by extending that series to the left and realizing that it can go negative. Negative Zero? How strange indeed. It could be true for some point of reality but I simply keep the idea open in my mind. I don’t know exactly and it’s okay for me to keep it open.
I consider myself a successful man when it comes to my programming interests. I have more ideas than I have days I am sure. I am a friend and a fan of the sciences and I have a wide range of interests. Naturally, as a hobby programmer, I have not specialized in any one discipline but I do really good with the data encoding these days.

Moving forward to 2012.
My interests have found a focus with the problem to solve of the Million Digit Challenge. I have been working on and around the file as a data set for many years.
As a data set I understand it is trustworthy. As a trustworthy thing I measure other things against it and it is a good measure to work with.

So why is there such bias and outright aggression towards the people working the Challenge?
Here is what I understand about the state of the art of data compression.
Data compression as defined by Shannon is statistical in nature and by his own words there is a fork in the early road and Shannon lead us in one direction over the other and that modern data compression is currently travelling on that road.
Along the way many proofs and truths have been confirmed that relate and define many boundaries. That is all good. A wall is a wall after all.

Yet all of these things fail to compress all files with the tools that have been developed and most of the advancements in the tools we use come in small increments and many in specialized efforts.
Indeed there are many good craftsmen out there who have tools and skills to keep those advancements going and that is good. More power to ya friends!

For myself I am not in the business. I am simply an interested man who finds this Challenge a great tool and focus for my interests.
The data set is trustworthy and the results of experiments are valid using it by the very statements of the data compression professionals of all times.

The bottom line is I really don’t need this file to compress because in parallel I do my own thing in private. I have more than one iron in the fire and it is my private business what discoveries I may be hiding from the rest of you.
So, why is it such a moral data compression sin to work this Challenge and why do smart people in comp.compression feel the need interfere and down right discriminate?

Rest assured if I was not generating successes from the path I am following I would not be right here right now. I would be doing a different thing on a different path somewhere else but I am having successes. Private success that keep me moving in the direction of finding that information I seek. Me Personally seek! The answers I want. I am not some data-compression-Jesus to hang on the Data Compression cross.

My latest experience, being associated with the Million Digit Challenge, was to report the effect of Recursive Modulus as a factoring primitive. I assumed it was old news I had discovered yet no one seemed to know about it.
So, it turns out that I had seen factors in the stream while designing a hash code and it turns out that it can be considered a primitive recursive function of some class. It is possible I am the first to report it but I am fine with knowing who first wrote it down.

So there is a private success anyone can see just as I assure you I have more private successes that are worth reporting.

Yet, what does it hurt to look for new ways and new understandings? Is it because someone may have disability? Like Newton or Cantor?

Conclusion :

There is nothing wrong with innovation and for every success there are untold numbers of failures in human history.
When it comes to data compression our understanding is incomplete since our understanding of what reality is, is incomplete.

The moral of the story is every one dies and no one knows everything but it is often the fringe people that advance innovation like Newton or Cantor and many others.

So let people dream you data compression Thought Nazis’
Let those on the fringe take a shot at fringe things and stop the authoritarian tirade that wrestled control of comp.compression forum from the same over the years.
If we don’t know everything then we can use all the help we can get even from fringe projects like compressing random data.
If someone wants to invest part of their life trying and you simply are not a mind reader don’t stand there telling them they are idiots and then play them on every idea they have like some molester.

I am now taking the name calling and harassment personal after 10 years of efforts on understanding the nature of information come June 2012 and focusing on the million digit data set as a development tool since around 2003-2004 I believe.

So learn to be a friend comp.compression because you have the opposite part down pat.

However, if someone can prove to me that they will never die and that they know everything I will apologize sincerely.
Other than that expect me to get as ugly as possible to protest the labels and comp.compression keep on closing threads to cover up the mess that you comp.compression make by being a biggot.

In short, let the fringe people give things a try and stop kicking them in the teeth for sharing news and interacting for friendship especially the need for social friendship part.

It is simply amazing that such a noble challenge is tuned into a psychotic-hustle in that forum. What the hell are they afraid of?

Thank you Mark Nelson for a forum and a focus.

Ernst

That’s enough for me on Recursive Modulus. It works the way it works. Does what it does and has interesting mechanics.

I have it in my tool box. It is another aspect to consider.

I hope others will share their discoveries like I did. Makes for an interesting day.

Now back to work on what I was doing when I saw RM.

Good Luck Challenge people.

Who will exit first?

I wasn’t checking for an end condition of the N being 1 after a factor is removed. It’s reasonable to find this errors after checking it out a while.

So i fixed that. Also I was printing the current N before the factor was removed and so seeing a large value for N and no stop for N=1 I didn’t see that there are only three factors.
Now I am using GMP’s function to check if this nearlly a million digit number is a composite probably prime or prime as thos are the three results that function will return.

My question is, having never used this function before let alone on nearly a million digit number, how long does it take for a million digit number check?

Dang.. feels like it’s spinning wheels but I don’t know.

Anyone?

I have a factor that is 175 pages of 10 point font in open office.

If no one has claimed that factoring I now do.

The factor ends in “36579116120702356361444362876721627845529455567385497″

So I have three factors so far at last check.

Alright then . Finally some headway on Million Digit file.
How exciting.

God Speed my friends…

Ernst

I’m sidetracked again.

Three days a go I discovered Recursive Modulus and I have been exploring Recursive Modulus to find factors of numbers.

I started three copies of a simple program I wrote to find factors. Each one is running the RSA 2048 data.

I’m guessing I could be waiting years or minutes more for a factor to show up.

Ain’t it something? I get so many projects stacked up I feel like I need a staff.

Well, Sleepy time now that that program is running. There is a thread in the Comp.compression group where I explain RM a bit.
It looks like the world has one more way to find factors for numbers.
I am interested in knowing if this Recursive Modulus was already known or if I discovered it,

Either way the RSA 2048 race is on. Lets hope I get lucky.

Okay.. I need to calm down and get back to my data compression effort once again.
I was reworking the Codec when I found the RM so I guess that answers that question I had.
Still it will be really hard to get 1 selection out of 2million+ possible strings.
I was worried when I was looking at the modulus stuff and I found a partial answer to my worry but, I think it could go either way.
Now that is okay as long as I can make it work for the Million Digit file. That is a possibility.
But, there is no telling for a while more.
I hope I have time for all this stuff.

I have a question. Has Million Digit been factored?

If so is the data available?

I am a fan of integer sequences. I have an account on a database because I love it.

So; Here, is an interesting sequence.. I’m looking at the “bigger world” through the eyes of the above mentioned hash.

Three dots means sequence before assumed. Three dots after means sequence after assumed. You know, I cannot, post the whole thing so enjoy a snippit.

… 720,8,0,1,2,3,13,727,1021,1022,1023,0,19,733,21 …

Interesting.