This post is a prime number Prove me wrong

>>4903352
divide it by 2

ur a fag

prove me wrong

>>4903355
>dub dubs
F*CKIN CONFIRMSED

JFO

(just Frick off)

no, but it is several prime numbers multiplied together, which is itself an achievement

2^3*191*3209

there arent even 4903352 prima numbers lol

File: millhousecheckem.jpg (29KB, 304x400px) Image search: [Google]

29KB, 304x400px

This post is a meme
Prove me wrong

>>4903455
dubs confirms checking dubs is a meme

Your fortune: Outlook good

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number. For example, 5 is prime because 1 and 5 are its only positive integer factors, whereas 6 is composite because it has the divisors 2 and 3 in addition to 1 and 6. The fundamental theorem of arithmetic establishes the central role of primes in number theory: any integer greater than 1 can be expressed as a product of primes that is unique up to ordering. The uniqueness in this theorem requires excluding 1 as a prime because one can include arbitrarily many instances of 1 in any factorization, e.g., 3, 1 · 3, 1 · 1 · 3, etc. are all valid factorizations of 3.

The property of being prime (or not) is called primality. A simple but slow method of verifying the primality of a given number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and {\displaystyle {\sqrt {n}}} {\sqrt {n}}. Algorithms much more efficient than trial division have been devised to test the primality of large numbers. These include the Miller–Rabin primality test, which is fast but has a small probability of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical. Particularly fast methods are available for numbers of special forms, such as Mersenne numbers. As of January 2016, the largest known prime number has 22,338,618 decimal digits.

There are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no known simple formula that separates prime numbers from composite numbers. However, the distribution of primes, that is to say, the statistical behaviour of primes in the large, can be modelled. direction is the prime number theorem, randomly chosen number n is prime is inversely proportional to its number of digits, or to the logarithm of n.

>>4903390
nice