Search:

Hi Laserlight,

i looked at GMP-reference and Java.BigInteger, nice methods provided (like next Prime...), but nothing about fractions.

With fractions I mean some strutcure like
x=(BigInteger...

Hi,

I think, I invented the wheel the thousandst time by writinig a very long integer-Library.

Now I wonder how to work with divisions. Of course you can divide with integers and look at the...

Hi,

i programmed a very simple indexing algorithm, wich results in a alphabetically sorted list of words with their positions (wich file, wich position in the file).

This list is splitted in...

Hi,

if you are satisfied with a very good solution and you do not require to be shure that you found the absolute optimum, then try an genetic algorithm.


GMarco

Hi,

----
By the way, is this something you are trying to do in practice, or merely an academic exercise?
-----

Its not academic, I do this in practise, and it is not like in email. Maybe I...

You do not need to remember wicht randomly choosen letters for wich file, because you can save the letter numbers with the encrypted file without giving too much info to the attacker.

One time pad...

Hi,

think about the following situation: You are working on a foreign system, you have to expect a keylogger, screenshot-archiver and all such things installed on this system and you do not want...

Hi

If I connect
thingi.Event += new EventHandler(CallBackFunction);
how can I check wich callback functions are connected to the thingi.Event?

Now I just try to remove every connection and...

Hi,

I just had the idea for another encryption algorithm, and because there are that few of them :-) I want to explain it.

First you define two bicjective functions working on bit arrays (A and...

Hi,

your "proof" does not work for N=2. If you check only all subsequences of the length 3, you do not check anything if there is no subsequence of the length 3. So your proof does tell us nothing...

Oh sorry, i did not read carefully.

So my proof would be:
1. as long as you move in the diagonal both (i) and (j) are changing.
2. If you step from one diagonal to another sometimes i or j will...

Hi,

the whole asymtoticaly and polynominal-thing is much more show than really substance. There are a few Functions between log and polonoms and exp, but almost none of them has some real impact....

Hi

there is a shorter proof:
Select two out of N is (N) over (2) --> N*(N-1)/(1*2) :-)

Bluescreen: Look here
http://en.wikipedia.org/wiki/Combination#Number_of_k-combinations

Best...

Hi,

for the first problem, searching something like the diff of more than two files is very simple: just take the diff of file1 and file2, remove all changes take this file and do the same with...

Hi,

for the non-orientable surface, you should look for "Klein Bottle". During my studying the books of Felix Klein have been one of my favourite. So I reccomend to read about higher geometry, a...

Thank you very much. The BLAST ist about 4.000.000 times faster than everything, wich I had before :-)

The critical part was to find a fast hash function adapted to the sequence problem. I used a...

Hi

I was just browsing around, searching for exotic number representations, and was suprised to find only really few different ways to represent numbers.

1. widely used integer and floating...

Hi.

Please do not take my solutions tooo seriousely. The OP asked for a not linear algorithm.

Simulation of atomic forces are not linear, they are quadratic, ... whatever. So just build a...

Hello Experts,

I have a problem, maybe connected to the greatest common substring Problem.

There is a file of about 10-20 Mbytes. Inside this file, you can think of it as a textfile, there are...

Hi,

First of all: my solution is far away from efficient, but it should work :-)

I think it is much easier to code it, than to predict, how many upn-results you will get by a given number n of...

Hi

if you mean it theoretical, if it is possible to describe an array out of n/2 1's and n/2 0's with 2n/3 bits of Information (2n/3 decisions), then the answer is "no", because n over n/2 is...

Hi,

I want to solve the followin task:

1. Given is a data string of m bits length.
2. Derive a checksum of the length k, k as short as possible
3. flip one single bit at randob position in...