Loading ...
Sorry, an error occurred while loading the content.

17090Re: [PrimeNumbers] Re: A Property

Expand Messages
  • Jacques Tramu
    Oct 21, 2005
      - I have designed a new (i think it is new) and quite simple compression
      algorithm which can compress a string of ANY length into a string
      of 666 bytes (using the well-known fact that 36 n^2 - 666 n + 1277 is prime
      for all n between 0 and 42,inclusive )(1)

      - I'm currently working on the corresponding decompression algorithm ...



      (1)
      -> for(n=0;n<=42;n++) {p = 36*n**2 - 666*n +1277; println(n,p,isprime(p));}

      0 1277 2
      1 647 2
      2 89 2
      3 -397 2
      4 -811 2
      5 -1153 2
      6 -1423 2
      7 -1621 2
      8 -1747 2
      9 -1801 2
      10 -1783 2
      11 -1693 2
      12 -1531 2
      13 -1297 2
      14 -991 2
      15 -613 2
      16 -163 2
      17 359 2
      18 953 2
      19 1619 2
      20 2357 2
      21 3167 2
      22 4049 2
      23 5003 2
      24 6029 2
      25 7127 2
      26 8297 2
      27 9539 2
      28 10853 2
      29 12239 2
      30 13697 2
      31 15227 2
      32 16829 2
      33 18503 2
      34 20249 2
      35 22067 2
      36 23957 2
      37 25919 2
      38 27953 2
      39 30059 2
      40 32237 2
      41 34487 2
      42 36809 2
      -------------------------------------
      http://www.echolalie.com
      -------------------------------------
    • Show all 64 messages in this topic