begin 644 haskell-gd.tar.bz2 M0EIH.3%!629368B6U`@``X5_TLZ0`)!\]__?/^_>RO__W_H`(`$`0```"%`$ MO=CF;F-3S9J-7IX))$U,T@4;4\IYIH%'B0;4/2-I#U-`--#30T\IY0"4IHQ2 M;4>U--JC]4]0]0``]0`-&@`````D2""3U3&"GI/4&GJ`VHTT````:```-J2G MI">*>H!IY1H'J-```!Z@&@#30`>H))3*&(F>J,TC$T:&@``!HT````!0%-OT M.ETT6,93%8NC,D\<S(30H0/9"%*R1NF[RC5JFEB2=K=(E8]0Y6P,E+-8E5): M$FD)R7PWC^%U.L=SXK52<?OJZ/]<DZ(D2EVYXL)7/Q"P3[)5CAUP*@\@K8#T MN^/+)%*L1F"MDPNORCKD/<;HS_<N^:H2%62T1F-H\>1+MZP[8RVZ6NE2;XT" MK^S5"M#>/J;1<Y+:&M*0G=<9$N\,>*%,!>ZLU9!8O#'&C<Y;4F_,PL'N4T'& MEN!9?GJD8_"B<0+X4%:HSB)1<K6/F'7I1;IR6[>6F28Q;._&O63<D;S2^##` MY1"N&8SHYZT)#K$#E26@VM1<3+=P<;%LM'!1C;>T>58][)EP%Z&+?&+:3)45 M=5D)&L)E9O.I9HIQ(T@7.)_1CT9>3QJ,5IB*BD/L<<?;]*/5,XGL(E$E7TUG MLGO>F$%&Z@HNN#"1<DN.5R`(`S%")<@,AJD;7K/15"KQ>S^QSK[AA4:"Q*VU MW8DHJ1+V62=-9NHXETZM0UEMOE*^6%82L"W#8N2<TKG952FA42G.5$7-*KG$ M%*WW'MG]'>3J0JW3V"E+K*P32<Z1B-!XP@UFHD=P@P&P>9\@Y#I@/S*:^5+% M<ZX;CJ(I62)A?\LW4^M[?TY\NE!V6JOBD04TGLTYLV'"6T9UMM'X*&O[7D6' M>B&LN.WI<*!J/VQ<[$@W#-TRY#'*6B=W+P4-?X+UMSR4G,'2Y(H.,6)"L$4H M)2#S,IU2Y:G&`WBW3%D@3I95[P?T:ARVB>E2+X0+:1?EI))KQ9A*1,L"G*J` MN8YX[#Z340S"(D#F1*YE9+K)$FM5&K.!5#E1`E**%T(5ZJK5N^]G\>8;SWPY MP54%3"JT40LR[A>3)UCD0/D,P]*M%:CG,LQ/GL`N-,,F&3,\<*F!C*1U]/+O M`9##-.0)50J$*1,)0M?2JE%1BT[-*,&N3GLP\<,#E:+D[)K$">JB=;9@PC6N MG]_?FEW2M?1%6N)5ZM<9M;.<S*Z4!26J%=SD]`7H+1>\%1FF+8HF2SD*.`51 M@G?&JE/84P\*9&0'(-=*JL$3(+BB+!7U$^NPZ:1BA*PP#$A@H>^J89O0)C\2 MM*-1A[XQ(0%,`Q?P![IF%,A,A)AT35"(;"&0,9>DR6C!YB-PD92A"SKI&!GY MV$<A;10B5D5ZXA/6K/*E<+97400%<8M+&HT$JQE`X<K,`LY/`V2M4UO(5O!> M4+E7O/F8D*TVS.;!@K2],1'B6",4"XVHHHK,%'3%42]NR3NDKS1J`R"5/J3) MM22?XT@52EC&5@X@MF%1T'&0.0F*MT$)#2JE"2<#N-)Q;#'C>D/U:,8Q@ M\"&Q&DIC))Q,61$28D5BD,6L]%6SH5R6`>*U+(*RI\.E3)6XY"(6M':0C_%W ))%.%"0B);4"` ` end
Saturday, October 30, 2004
Haskell GD linking example
Friday, October 29, 2004
Verhoeff Digit Checksums
Monday, October 25, 2004
CVS on su
su
command (or sudo
) you can make a RCS-style comment entry of what you did with the privilege.
A separate idea: whatever your system's ``control panel'' is has the ability to roll back changes to a previous version (and form branches and stuff, like CVS).
Between Spreadsheet and Database
Thursday, October 21, 2004
Modular Exponentiation Permutations
P versus NP
It's interesting that P=NP can be proved or disproved by a single example or counterexample in either direction. It can be disproved by finding a single counterexample of a problem that is NP but not P. By the magic of computability theory, it can also be proved by finding a single example of an NP-complete problem that can by solved in deterministic polynomial time.
I know of of no other hard, unsolved, problems that have this property. Usually the counterexample is ``easy'' but the proof is hard.
Furthermore, instead of explicitly finding an example or counterexample, one only needs to show existence. However, how frustrating will it be if someone proves the existence of an NP-complete problem solvable in poly-time without constructing an example?
Monday, October 11, 2004
Diffie-Hellman Challenge
Find the value of x, 1440<=x<M-1, which minimizes the value of y=(3^x % M), where % is the "modulo" or "take the remainder" operator, and M=2^2281-1. M is the 17th Mersenne prime. 3 is a primitive root of M. The value 1440 makes 3^x loop around and the modulo operation take effect, i.e., 3^1440>M. This could be solved once and for all by solving the discrete logarithm problem 3^x == 2 (mod M). If this challenge gets solved, or is too easy, then do the same thing with 3^x % M21701, where M21701=2^21701-1 is also a Mersenne prime. By some analysis I don't fully remember, I have reason to believe that 3 is probably a primitive root of M21701. (I think the reasoning was that if 3 is not primitive, it gets eliminated from consideration by some small factor of M-1, and the small factors of M21701 were tested.) And if that's still too easy, try the modulus P=5359*2^5054502+1, which is a prime number found by the Seventeen or Bust project. I don't know the least primitive root of P, but it should be pretty easy since P-1 factors trivially.
Update: Pohlig-Hellman makes this a bad idea.