Tub son sahifasining manbasini koʻrish

[[Fayl:Prime Factorization of 42 (Second Example).png|thumb|<math>42=2\times 3 \times7</math>]]
'''Tub son''' — birdan katta [[natural son]] boʻlib, ikkita natural [[boʼluvchi]]ga ega: [[1 (raqam)|1]] va oʻzi. Tub sonlarning xossalarini oʻrganuvchi fan [[Sonlar nazariyasi]] deb ataladi. Tub sonlarning ulushi sonlar qatori qancha uzaygan sari kamayadi masalan 1dan 10gacha 4 ta 40 foiz ulush 100gacha 25 foiz ulush 1000gacha 168 ta 16,8 foiz ulush va hokazo hozir fanga malum bo'lgan eng katta tub son 2^136279841 Dan 1ta kam sondir

Tub sonlar ketma ketligi quyidagilardan boshlanadi:
: [[2 (son)|2]], [[3 (son)|3]], [[5 (son)|5]], [[7 (son)|7]], [[11 (son)|11]], [[13 (son)|13]], [[17 (son)|17]], [[19 (son)|19]], [[23 (son)|23]], [[29 (son)|29]], [[31 (son)|31]], [[37 (son)|37]], [[41 (son)|41]], [[43 (son)|43]], [[47 (son)|47]], [[53 (son)|53]], [[59 (son)|59]], [[61 (son)|61]], [[67 (son)|67]], [[71 (son)|71]], [[73 (son)|73]], [[79 (son)|79]], [[83 (son)|83]], [[89 (son)|89]], [[97 (son)|97]], [[101 (son)|101]], [[103 (son)|103]], [[107 (son)|107]], [[109 (son)|109]], [[113 (son)|113]], [[127 (son)|127]], [[131 (son)|131]], [[137 (son)|137]], [[139 (son)|139]], [[149 (son)|149]], [[151 (son)|151]], [[157 (son)|157]], [[163 (son)|163]], [[167 (son)|167]], [[173 (son)|173]], [[179 (son)|179]], [[181 (son)|181]], [[191 (son)|191]], [[193 (son)|193]], [[197 (son)|197]], [[199 (son)|199]], [[211 (son)|211]], [[223 (son)|223]], [[227 (son)|227]], [[229 (son)|229]], [[233 (son)|233]], [[239 (son)|239]], [[241 (son)|241]], [[251 (son)|251]], [[257 (son)|257]], [[263 (son)|263]], [[269 (son)|269]], [[271 (son)|271]], [[277 (son)|277]], [[281 (son)|281]], [[283 (son)|283]], [[293 (son)|293]] (shuningdek [[tub sonlar roʻyxati]]ni koʻring)

== Yana qarang ==
* [[Tub sonlar roʻyxati]]

== Adabiyotlar ==
* Г. Гальперин, ''[http://kvant.mccme.ru/1987/04/prosto_o_prostyh_chislah.htm «Просто о простых числах»]'', «[[Квант (журнал)|Квант]]», №&nbsp;4, 1987
* ''[http://www.cryptography.ru/db/msg.html?mid=1161235&uri=node28.html «Алгоритмические проблемы теории чисел»] {{Webarxiv|url=https://web.archive.org/web/20050113182047/http://www.cryptography.ru/db/msg.html?mid=1161235&uri=node28.html |date=2005-01-13 }}'', глава из книги ''[http://www.cryptography.ru/db/msg.html?mid=1161235&uri=book.html «Введение в криптографию»] {{Webarxiv|url=https://web.archive.org/web/20050111163147/http://www.cryptography.ru/db/msg.html?mid=1161235&uri=book.html |date=2005-01-11 }}'' под редакцией В.&nbsp;В.&nbsp;Ященко
* О. Н. Василенко, ''[http://www.cryptography.ru/db/msg.html?mid=1169580 «Теоретико-числовые алгоритмы в криптографии»] {{Webarxiv|url=https://web.archive.org/web/20050904122507/http://www.cryptography.ru/db/msg.html?mid=1169580 |date=2005-09-04 }}''
* А. В. Черемушкин, ''[http://www.cryptography.ru/db/msg.html?mid=1169266 «Лекции по арифметическим алгоритмам в криптографии»] {{Webarxiv|url=https://web.archive.org/web/20050909090950/http://www.cryptography.ru/db/msg.html?mid=1169266 |date=2005-09-09 }}''
* К.Кноп ''[https://web.archive.org/web/19990202185354/http://www.geocities.com/CapeCanaveral/4344/211.html «В погоне за простотой»]''
* Б. А. Кордемский Математическая смекалка. - М.:ГИФ-МЛ, 1958.-576 с. (стр. 344-345).

== Havolalar ==
* [http://primegrid.com/orig/torrent.php PrimeGrid prime lists] {{Webarxiv|url=https://web.archive.org/web/20100530071550/http://primegrid.com/orig/torrent.php |date=2010-05-30 }} - все простые числа, найденные в рамках проекта [http://primegrid.com/orig/torrent.php PrimeGrid] {{Webarxiv|url=https://web.archive.org/web/20100530071550/http://primegrid.com/orig/torrent.php |date=2010-05-30 }}
* [http://www.polprimos.com Геометрия простых и совершенных чисел]{{ref-es}}

[[Turkum:Sonlar nazariyasi]]