![]() |
![]() |
#1 |
Jan 2005
Caught in a sieve
1100010112 Posts |
![]()
Let's try something else along similar lines to the descramble thread. At the same time I wrote the program to solve that, I wrote a hangman solver. I'll give a word or words with most letters replaced with dots, but enough that my program can find the correct solution. Can you? If a letter is present, no other occurances of it are hidden.
Ranked in approximately increasing difficulty: po...rd r.o ; no i p.o.h'. .heo.e. f.u.ie. t..nsf... ; no k ....p..c cu.v. ; no h or y .e.e..re ..e....r..e ; no x ..o.e..e. s...ol ; no d All words have either appeared here, or in other prime-related literature. Good luck! ![]() |
![]() |
![]() |
![]() |
#2 | |
Cranksta Rap Ayatollah
Jul 2003
641 Posts |
![]() Quote:
pollard rho proth's theorem fourier transform elliptic curve legendre I don't have the last 2 |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Don“t step on my toes... please! | lycorn | Lone Mersenne Hunters | 37 | 2011-10-09 16:09 |
squre root step problem | loong | Msieve | 10 | 2011-05-03 13:14 |
GMP-ECM fails on step 2 with B2 > 96M | CRGreathouse | Factoring | 9 | 2010-10-30 16:38 |
Feature Request!!! Save after p-1 Step 1 | Andi47 | GMP-ECM | 9 | 2007-04-12 11:40 |
Optimizing step 2 of ECM on Prime95 | alpertron | Software | 4 | 2006-01-11 17:27 |