Re: Not a Prime- c code

On Mar 9, 6:37 pm, Douglas Eagleson <eaglesondoug...@xxxxxxxxx> wrote:
Here is some code that forgets to print out only prime numbers, I
believe.  It is hardly tested, but forgets so nicly I wonder why all
the falder-al.

If the reader understand how nonprinting means sometime then I am
available to consult on cracking RSA in another fashion.

Not-primes in q

Douglas Eagleson
Gaithersburg, MD USA
*****************************************************

#include        <stdio.h>

/* Infamous "hello world-primes are only factors" program */

main()
{
int start = 3;
int i,j,k;

for(i=0;i<40;i++){

start=start+2;

for(j=2;j<start;){

        for(k=2;k<start;){

                if(k*j<start){ k=k+1;
                }
                if(k*j==start){
                printf(" k=%d \n",k*j);
                k=start;
                }
                if (k*j>start){
                k=start;
                j=j+1;
                }

        }
        /*A short code.  A multiplier then causes the series.  Any repeated
        number appear the dividable*/

}
}

        printf("Hello, world:) -replACE a single d and all applied RSA is
crackable.\n");



}- Hide quoted text -

- Show quoted text -

A basic limit as solution was p*q=m where p and q are large primes.
MY methods are p*q^2 trials to solve. To get ride as an exponent to a
true linear function would require a set of primes as all primes. And
the existance of this set was discovered.

And it has not been discovered. Causing doubts as to its existance.

Until somebody discovers the prime funct my method appears the fastest
solution method.

So I have not so shabby a method.

.

Quantcast