what is the highest 8bit prime number?
822436
251\n254 is compostie...(2 x 127)
265093
8085 has an 8-bit architecture and the index register is 16 bits.  3 2-cycle ops: First increment lobyte, then carry, then increment hibyte.
1079384
Hey!  Because there exists an infinite number of numbers, there are also an infinite number of prime numbers.  There is a computer running right now, generating prime numbers.  It made the news about a month ago because it had discovered a prime that was thousands of digits long.  There is also a proof that proves there is an infinite number of primes.  Hope that helps!
1067663
Seven prime integers.\n\n7\n17\n37\n47\n67\n71\n73
514890
the largest that has been calculated is the 43rd Mersenne Prime\n\nOn December 15, 2005, Dr. Curtis Cooper and Dr. Steven Boone, professors at Central Missouri State University, discovered the 43rd Mersenne Prime, (2^30,402,457)-1. The discovery is the largest known prime number \n\nThe new prime is 9,152,052 digits long. The URL below gives it in full, all 9,152,052 digits of it!
68694
The "Top Ten" Record Primes\nThe Ten Largest Known Primes See also the page: The top 20: largest known primes.\n\n    The largest known prime has almost always been a Mersenne prime.  Why Mersennes?  Because the way the largest numbers N are proven prime is based on the factorizations of either N+1 or N-1, and for Mersennes the factorization of N+1 is as trivial as possible (a power of two). \n\n    The Great Internet Mersenne Prime Search (GIMPS) was launched by George Woltman in early 1996, and has had a virtual lock on the largest known prime since then.  This is because its excellent free software is easy to install and maintain, requiring little of the user other than watch and see if they find the next big one!  Tens of thousands of users have replaced the ubiquitous inane "screen savers" with this much more productive use of their computer's idle time (and the hope of winning some EFF prize money)!\n\n    Any record in this list of the top ten is a testament to the incredible amount of work put in by the programmers, project directors (GIMPS, Seventeen or Bust, Generalized Fermat Search...), and the tens of thousands of enthusiasts!\n\n    rankprime digitswhowhenreference\n    1230402457-1 9152052 G92005 Mersenne 43??\n    2225964951-1 7816230 G82005 Mersenne 42??\n    3224036583-1 7235733 G72004 Mersenne 41??\n    4220996011-1 6320430 G62003 Mersenne 40??\n    5213466917-1 4053946 G52001 Mersenne 39?\n    627653.29167433+1 2759677 SB82005 \n    728433.27830457+1 2357207 SB72004 \n    826972593-1 2098960 G41999 Mersenne 38\n    95359.25054502+1 1521561 SB62003 \n    104847.23321063+1 999744 SB92005
886656
It can be as long as you want.\nChoose whatever positive integer n you want. Consider these numbers: n! + 2, n! + 3, .. , n! + n. They are n consecutive numbers. The first one is divisible by 2 (since n! = n*..*2*1, and 2 is), the second one is divisible by 3, .., the last is divisible by n. So none of those are prime.\nSo, whatever n you chose, you have n-1 consecutive non-primes. If I choose n = 1000001, theres a gap of at least 1000000 numbers between any primes there.
616649
I usually agree with the answer 8 that everyone is giving but I think they may have gotten that from a book. My gut tells me that the answer is really 9. Because if you were a 2400 baud modem and you wanted to see the byte you would need that parity bit at the end. Where does the parity bit get credit? Why is it always about the 8 before it?\n\nWhat if the parity bit feels like he is in the byte's family but he is like the bastard stepchild? Poor bit. I think we should include the parity bit in the byte even though it's an odd fit. I mean look at pluto. Pluto isn't the 9th planet. I mean come on... a planet with a density of 2 grams per cm cubed? Whatever... But it's lonely and out there so it's the 9th planet.\n\nSo I vote for 9 bits in a byte. It's only fair that the parity bit get recognized as existing.
293052
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97\n\n101 is the next prime number ... \nso 24 prime numbers between 1 - 100
1034441
The 43rd discovered Mersenne Prime is:\n\n2 ^ (230,402,457) - 1\n\n...which I believe is also the largest known prime.  It must be written in this notation because the actual number is 9,152,052 digits long.  ^.^
434001
i don't have the code but I guess you have to read something about 'numbers theory' and use the function 'mod'. once you understand the algorithm to generate prime numbers, write the code is gonna be easy.\nhope it helps
1023056
There is no largest prime, since there are an infinite number of prime numbers, but there is a largest *known* prime number.  It's a Mersenne prime (of the form 2^p-1) where p is another prime.  Specifically it is 2 ^ 30,402,457 - 1.  The number is too big to represent here because it is 9,152,052 digits long.\n\nThis number and most of the recent Mersenne primes were calculated using a collective effort known as the 'Greater Internet Mersenne Prime Search' (or GIMPS) for short.  Several tens of thousands of volunteers around the world are using background processing time on their PCs to check these high-digit Mersenne primes.\n\nThe number 30,402,457 was tested as the exponent in 2^p-1 and the result was found to be prime as part of this GIMPS project.  The credit goes to both the project (all contributors to the GIMPS project) and to the people who were running that specific test.  In this case it was Dr. Curtis Cooper and Dr. Steven Boone, professors at Central Missouri State University who discovered it December 15, 2005.  The official credit for this new discovery is listed as "Cooper, Boone, Woltman, Kurowski, et. al.".  By the way, I'm one of the et. al. having racked up several years of computational time running tests.\n\nThe search continues and there is a prize for the person that finds the next prime number of over 10 million digits... join now if you want to share part of the $100,000 pot.\n\nIf you want to know the English name of the current largest known prime, it starts, "three hundred fifteen tremillia millia quin quagin millia sescendo octo gintillion, four hundred sixteen tremillia millia quin quagin millia sescenun octo gintillion..." (See the last link for the full name.)
465400
2, 3, 5, 7, 11\n28\n\nFYI- 1 is not a prime number! It is only divisible by 1. To be a prime number, it must be divisible by 2 numbers.\n\nprime numbers up to 20-\n2, 3, 5, 7, 11, 13, 17, 19\n\nto find a prime number, start at the number 2. cross out every other number (that would be 4, 6, 8, even numbers). Then cross out every 3rd number, every 4th number, and so on. The remaining numbers are prime!\n\nHope this helps!
795010
found in 2006, the largest known prime number contains 9808358 digits and it is \n\n2^32582656.\n\nplug in  _largest prime_  at yahoo search and pick a website.
361110
The one millionth prime is 15,485,863.  Check out the site below.
1004221
For the moment we don´t even know if there is an infinite number of Fibonacci primes....\n\nHere are the first fifteen:\n\n2,3,5,13,89,233,1597,28657,\n514229,433494437, 2971215073, 99194853094755497,\n1066340417491710595814572169,\n19134702400093278081449423917,\n475420437734698220747368027166749382927701417016557193662268716376935476241\n\nLooks considerably less dense than the fraction prime numbers / natural numbers
899443
39 can be devided by 3 people.  Scary.  \n\nBut you get the jist of what is a prime and a square from the other posts.