I was born in Sweden in 1966, still alive and living in Umea in the northern part of Sweden, so it is definitely Sweden.
I have always been interested in mathematics, my interest for prime numbers started when I was about 15 years. When I got my first computer with a floppy drive I filled a number of disks with primes until I got bored and started with fractals instead.
When I started at the university (civil engineering in physics) I also got back into prime numbers by writing a Lucas-Lehmer program for Mersenne primes. When I later learned about Prime95 I jumped onto that project and is currently running six computers for GIMPS. I played around with Proth about a year ago and wrote a sieving program that never got to a finished state. Tried to factor some Fermat-numbers but lack of spare time and some realism :-) killed that project too. I didn't believe my eyes today when I started proth on the only number I got this morning (was retrieved factor for F91213). When it started to check for coefficients of Fermat numbers I just stood there and watched. This is surely a boost of my math interest. Now I just have to find a Mersenne prime to get the collection complete! :-)
I was born in Washington State, USA June 23, 1953. I attended undergraduate college at the University of South Florida and Medical School at the University of Miami. While an undergraduate, I received the Dr. Sylvan Myers Award for Highest Achievement in Physics and Mathematics by Pre-Medical Students. After a few years in private-practice Diagnostic Radiology, I went to the University of Florida where I studied Medical Physics, specifically magnetic resonance spectroscopy.
For the last several years I have been working at an University-affiliated hospital and enjoying time with my wife and two children, Christopher and Jennifer, who are 10 y/o and 9 y/o respectively. My hobbies include working on distributed prime number projects, jogging, swimming and hiking.
I have a PIII 500 and a Cel433at545. These computers run 10-18 hours per day at differend projects. It is planned to upgrade, especially the Celeron. Found divisor for F48. I live in Germany.
I was born October,21 1975 in Stavropol, Russia. I have completed a technical university. My hobby then and now is programming and calculus. I starteed calculating the digits of Pi when I was at school, for this purpose using the old computer Z80. Aspiring to calculate it more and faster, I have studied many languages and compilers. Beyond a certain point supercomputers are required to calculate the number Pi, therefore competitions are senseless.
Now I try to refine the distributed project for search of divisors of Fermat numbers. The usual household computers can successfully take part in this competition. Today I work as a programmer in an accounting department. I am married and raising a young daughter.
My full name is Michael Richard Eaton. I was born in 1986 in the USA. I
have a B.S. in Computer Science and I work as a professional software
I have had a fascination with prime numbers and integer factorization since a very young age. I first began searching for Fermat factors in 2003.
I was only age 18 when I made my first two fermat factor discoveries in February 2005. I enjoy the thrill of the hunt and I feel like its a way to help uncover the little secrets of the universe.
I was born in 1944 and I live in Kingston-upon Thames, England. I worked for British Rail for 25 years until the Computer Department was sold to a private company in 1998, and about a year later I took early retirement.
I am now a 'Gentleman of Leisure' and I am therefore able to persue full-time my hobby of Mathematics (number theory and combinatorics). I am the editor of 'M500', a mathematics magazine for Open University students & staff. With Harvey Dubner and Paul Zimmermann, Michel Mizony and Nik Lygeros we discovered 10 consecutive primes in arithmetic progression see http://www.ltkz.demon.co.uk I am married (since 1973),
and we have three daughters, Tamsin, Kim, Zoe. Apart from mathematics, I am interested in classical music (especially opera) and I play 'bridge' (at a fairly low level).
Tony Forbes is coordinating a search for a factor of MM61 (2^(2^61-1)-1). This is the smallest Mersenne number with a Mersenne prime exponent whose primality status is unknown.
I was born in 1966 and live in central USA (Omaha Nebraska). I work for a satellite broadcast company. I became interested in cryptography/cryptanalysis in the late 80's, and more recently have become interested in the search for large prime numbers. I am much more of a computer engineer than a mathematics guru, and I enjoy writing and enhancing code.
I am one of the main contributors to the OpenPFGW project, and I recently added Generalized Fermat divisibility testing to PFGW. I am also in the process of writing a Win32 GUI around the PFGW program. There currently is a version of WinPFGW (the GUI) available over the net which does enhance this search. I have also written several "trial factoring" programs which quickly eliminate composite candidates from a list of numbers. The most recent has been designed specifically for large number Fermat type searches. It is called FermFact. I have not quite finished it, but when it is finished I will also make this program available. FermFact works very similar to another great trial factoring program, NewPGen by Paul Jobling, and borrows a little code from an older version of Paul's utility. The difference between NewPGen and FermFact is that FermFact allows you to factor a rectangle of k's and n's at the same time.
The OpenPFGW software (get the most recent development version), and the WinPFGW GUI program can be found at http://groups.yahoo.com/group/primeform/files Note that when FermFact is released, it will also be contained within this directory.
I was born August 10, 1954 in Chattanooga, Tennessee, USA. I attended Vanderbilt University, where I received undergraduate degrees in Electrical Engineering and Computer Science. I later received a masters degree in Computer Engineering from the University of Illinois. While there, I became interested in factoring Fermat numbers, discovering my first factor (the only know factor of F17) using a CDC 7600 computer. Since then I have used a variety of machines to search for Fermat factors, including a home-made computer based on the Motorola 6800 processor! Over the years I have written several different programs for factoring Fermat numbers, plus one program to search for Mersenne primes. I am currently a computer systems architect, designing high performance systems. I worked for Convex Computer Corp until 1985, and I am currently working for Hewlett Packard in Richardson, Texas. I am married and have two sons.
Prof. Peter Grobstich Department for eduacation of Civil Engeneers, subject Mathematics and Informatics University of Applied Sciences of Neubrandenburg/Germany
I spent about 130 CPU Pentium-90 years on the GIMPS project. In fact, I was one of the very first who started in early 1996, when there where only about 10 people participating. Interests: Many sports on a competitive level. Number theory. Classical piano. Participating in an Internet project for finding Mersenne primes. Railway modelling, bridge, numismatism. Dipl. Ing. Dr. techn. Speech Recognition Technologist at Philips Speech Processing. Austria.
I am a student at the Faculty of Mechanics and Mathematics MSU (Moscow State University). I am interesting in number theory, intelligence systems (artificial intelligence), cryptography.
Alex has found a factor for F31. He has written:
I started my own search late last year, before I had ever heard of Fermatsearch, and I began searching from zero, or rather 1*233+1 . I worked my way up to 2310*109*233+1 on my own computer and infrequently on machines available on the Technical University of Munich. At that point I got permission to use 5 Athlon 1GHz permanently at the Uni, which accelerated my search greatly, ultimately resulting in the discovery of the factor.
I have spent about 100000 (hundred thousand) Pentium II 400Mhz cpu hours on various factoring projects (M727, F14, P773 and others) and came up empty each and every time. The F31 factor more than makes up for the many boring hours of factoring in vain, and it proves that if you keep trying, odds are you'll succeed sometime. Persistence is the key.
I live in St. Louis, Missouri, USA. I am a chemist and have worked on the Riesel search coordinated by Ballinger and Keller for about two years. The Fermat factor search looks very interesting.
I have ended a physical and mathematical speciality in Belgorod University, now I teach to mathematicians in школе+обучаюсь without seeing on a speciality " the Software of computer facilities and automized systems.
Born in December 1969 in the Khimki-town, Moscow Region, Russia.
I studied at the Moscow Aviation Institute in 1987-1993.
Now I am a programmer in TVZAVR Ltd.
Interested in the synthesis of theories of graphs and matrices.
Groping approaches in the field of symmetry and harmony.
I was born in Sao Paulo, Brazil, July 13 1971. Still attending undergraduate course of computing, I am a living proof that someone with (almost) no knowledge of mathematics can do something that can maybe be called mathematics.
As a firm believer that we shouldn't waste any CPU cycle, I joined SETI@home, even before the client program was released. Thinking about the probability of find an alien civilization, I changed to something more feasible: the Great Internet Mersenne Prime Search, but even Mersennes are hard to find. So I decided to try something a little more easy to find as well having more control on what exactly I do. Thus I turned my attention to Proth primes and started to see the beauty of divisibility properties with respect to Fermat and generalized Fermat numbers. And here I am.
Finder of some not so small primes and some generalized Fermat divisors and discoverer of one Fermat divisor: 357*2^35567+1 Divides Fermat F(35563).
Also a believer that our results should be public, I maintain a home page about my searches at
Prover code at Prime Pages: g97
Mathematics Division. Lane Community College, Eugene, Oregon. My goal is to find out if there are any other factors of Fermat numbers less than the larger factor of F7: 5704689200685129054721. I have been doing ECM factoring with George Woltman's program for the past 1.5 years on F19 through F23, but will need more memory even to try F24, so I thought that using Fermat.exe program will complement this work nicely.
I was born in Rome, Italy on March 7th, 1962. My inspiration and imagination have soon been caught from science, and since I was a boy my studies led me through the (too often) waste land of technology. When I
was 16 I faced computers' world, programming games in Assembly language on Commodore 64. It has been on that (slow) machine that I firstly met numerical analisys, and I loved the way a computer could be used to speed up slow and time consuming calculations.
My life went on, and so did my passion for Mathematics and Computer Science: I started working as a mainframe operator, then I became a programmer, an analyst, and finally a system and network manager. Now I collected different skills: I can use up to seven different programming languages and as many operative systems, but the call for undoscovered lands is still strong.
This is the reason why I decided, during April 1997 to join GIMPS (and then Entropia): the unused spare cycles of my computers' CPUs were worth a redemption. I reached rank #160 on Entropia during 1999, but then I got interested in other distributed computational projects, as PiHex and Equal sum of like powers. I strongly believe in the use of spare CPU cycles to help distributed scientific projects and this is the second most important reason why I am here.
The first, of course, is the need for knowledge. Our great poet, dante Alighieri, said about the Man: "Fatti non foste a viver come bruti, - ma per seguir virtute e conoscenza", that is "You were not created to live as beasts, but instead to follow the path of virtue and knowledge".
I was born in 1969, live in Japan. I've been major in chemical. My occupation is engineer of semiconductor process. Mathematics was rather poor but intersted in it. Above all, I was poor at English in my high school age and teacher scolded me sometimes.
I've searched the dividors of Fermat number at larger 'n' with Proth.exe. Often use NewPGen.exe also. I found 8247.2^9324+1 divides F9322 independently in November 1999. But Kerchner found it 12 days earlier. This fact was noticed to me by Wilfrid Keller's reply.
I, Oleynik Anton Petrovich, originally from Samara, was born on July 16th in 1972. In 1994 successfully graduated from Samara State Technical University majoring in System Engineering. Started carreer in the bank the same year. Have been working as a Automation Office manager since 1997. Took part in
some distributed computer engineering projects. Presently reside in the city of Blagoveschensk (Far East).
Hobbies - computers, Internet. While having spare time enjoy watching black action movies, such as "Lock, Stock and Two Smoking Barrels". Married. Have a two-year-old son named Ilya.
I was born 21 Jan 1969 in BandarAnzali (previousely known as BandarPahlavi), a beautiful port at the north of Iran, near the Caspean sea.
In 1985 I entered the Iran university of science and technology. I get my BSc in 1991 and MSc in 1994, both in pure mathematics.
In 1990 I married and now have a 9 years old daughter named Pegah - means dawn. My wife's name is Mahnaz Fattahi.
My job is computer programming. Currently I am working in Atomic Energy Organization of Iran as a computer programmer. I can write programs in C/C++, Java and assembly language of both IBM and Sun compatible machines.
My main interest is computational mathematics. My hobby is prime numbers. I have already found a 100001 digit prime number 1271*2^332185+1. This prime was the 25th greatest when was found.
I am currently working on Sierpinski problem with k=4847 and recently searching for a Fermat trial divisor using Durman's FERMAT program.
I need to continue my educations in Mathematics or Computer science, preferably in a number crunching related field, outside Iran. Can anybody help me?
I use three computers to do distributed computing: PIII 600Mhz 24 hours/day (My work computer), AMD 333Mhz about 1-3 hours/day (My own home computer),PII 233Mhz about 4-8 hours/day (My work laptop). I have no permission to use other computers here in work. So I can use only these three computer to calculating. I am from Finland.
I was born in Kavala,Greece 25 November 1980.I am currently attending the second year of undergraduate course in mathematics.My mathematical interests include number theory, cryptography, set theory and Logic.I also enjoy literature, languages,history,especially ancient or medieval history,going to the cinema and internet. In the proth searches,i search for fermat divisors but found so far none(been too close..) I hope that some day all the knowledge in mathematics,physics and all science is absolutely devoted for the Good of mankind (Depleted Uranium? Humanitarian War? Balkans=Dump for X's nuclear waste?) I am just adding these stuff because my region the Balkans has suffered a great many bad things and my hope is that finally peace will be established.
The engineer - programmer. Works in research institute of nuclear physics of the Moscow State University.
I was born in 1985. I live in Cheb in Czech republic.I study University of West Bohemia in Pilzen. I am trying to get master degree in Matematics ingineering, specialization in numerics.I am interested in computers and everything around them, baseball, frisbe, tee. I found out about searching fermat numbers on one lecture, when lecturer mentioned open problems and one of them was the fermat numbers. Few months later I remembered, found this web and started computing. My computer has cpu AMD sempron LE-1200 2,1GHz and 2GB ram.
Matt Anderson graduated from Pacific Lutheran University in 1997, with a degree in Math and Engineering. He received a Master's Degree from Oregon State University in 1999, studying electrical engineering. He worked for two years developing circuits for fiber optic devices, and now he works in city hall, as a Legislative Assistant. His webpage is http://mattcanderson.741.com/
I am 29 years old.
Born in Gent (Ghent) on Halloween 1980 (31/10/80)
I studied Applied Informatics and graduated when I was 20 years old.
I am working for the Belgian Post Group as a developer (Oracle, Sql
Server, Service Center, ...)
I started with distributed projects with Seti@home, RieselSieve, Sob, Fermat Search and countless others)
I was born June,23 1981 in Beja, Portugal. I'm a Computer Science student at ESTIG-IPBeja. I'm interested in number theory and cryptography. I participate in some research projects since 1998 at my hometown Moura. I use several machines for Fermat Factorization, MersennePrimes search and SETI@home. I have also made some research at Zetagrid, Seventeenorbust, Mersenneathome, OEIS, Folding, SkyNet and KRYPTOS.
Born in USA in 1955
Mathematics amateur, my interests are in Prime Numbers, Number Theory and Quantum Theory.
I discovered the 300th Fermat factor.