Loading ...
Sorry, an error occurred while loading the content.
Advanced Search
Author
Subject
Message
Special notice only

299 results from messages in primenumbers

Advanced Search
  • ...would be the perfect posterchilds for such a proposal. Why don't you do a favor to humanity and throw yourself off a tall building? Décio [Non-text portions of this message have been removed]
    Décio Luiz Gazzoni Filho May 5, 2005
  • ...inverse modulo: Mod(0, 42542905343533366778773944705953203289361426945380795183689). Ironically, Milton's work was not 100% in vain. Décio PS: in principle one can actually check my conjecture that the sequence is finite: if p, p+2 is the largest twin prime pair generated...
    Décio Luiz Gazzoni Filho May 5, 2005
  • ...primes for that factorial. Emphasis on `prior pairs'. Now tell me which values of n,k generate (n! + k, n! + k + 2) = (59,61). Décio [Non-text portions of this message have been removed]
    Décio Luiz Gazzoni Filho May 5, 2005
  • Fetching Sponsored Content...
  • ...7! doesn't produce any values. And thus Milton's conjecture is demolished, as about anything that he brainfarts on this list. Décio [Non-text portions of this message have been removed]
    Décio Luiz Gazzoni Filho May 5, 2005
  • ...be more exact in your queries, and avoid stating trivialities, otherwise you're just going to confuse others that try to help. Décio [Non-text portions of this message have been removed]
    Décio Luiz Gazzoni Filho May 5, 2005
  • On Wednesday 04 May 2005 06:15, Paul Jobling wrote: > Décio, > > Removing the brackets around the statement "z(i)=primepi(i);" gets rid of > the error. However, what is the routine...allocatemem() some extra memory because of the linear algebra solver; 16 MB seems to work fine here, but the default 4 MB does not. Décio [Non-text portions of this message have been removed]
    Décio Luiz Gazzoni Filho May 4, 2005
  • ...for the coprime (a,b) pairs. I'm not sure if I'll try to improve this, or if I should write a `serious' implementation in C++. Décio nfs(n)= { l=log(n); d=(3*l/log(l))^(1/3)\1; k=3*l\log(2); m=n^(1/d)\1; t=d; s=n; H=vector(d+1,i,1); (p(i)=prime(i)); for(i=1,d...
    Décio Luiz Gazzoni Filho May 4, 2005
  • On Tuesday 03 May 2005 00:24, you wrote: > Decio, > Does Pari-GP really allow you to break up things like a function name > into parts? For instance, on line 3 you have "f(x)=ev...users.pdf, section 2.67). That's why I like writing obfuscated programs. You really learn a lot about the language by writing them. Décio [Non-text portions of this message have been removed]
    Décio Luiz Gazzoni Filho May 3, 2005
  • ...thus I have no choice but to implement a large prime variant. Once I get around to that I'll post the final result to the list. Décio [Non-text portions of this message have been removed]
    Décio Luiz Gazzoni Filho May 2, 2005
  • ...font on an 80-column or larger terminal. If Yahoo! breaks up the message, just reassemble it in Notepad or your favorite editor. Décio {nfs(n)=l=log(n);d=(3*l/log(l))^(1/3)\1;k=3*l\log(2);m=n^(1/d)\1;t=d;s=n;H=vect or(d+1,i,1 );(p(i)=prime(i ));for( i=1,d, s-=H...
    Décio Luiz Gazzoni Filho May 2, 2005