High Quality Content by WIKIPEDIA articles! In number theory, the Chinese hypothesis is a disproven conjecture stating that an integer n is prime if and only if it satisfies the condition that 2n?2 is divisible by n. In other words, that integer n is prime if and only if . It is true that if n is prime, then (this is a special case of Fermat's little theorem). However, the converse (if then n is prime) is false, and therefore the hypothesis as a whole is false. The smallest counter example is n = 341 = 11x31. Composite numbers n for which 2n?2 is divisible by n are called Poulet numbers. They are a special class of Fermat pseudoprimes.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.