Skip to content

Commit fd76e46

Browse files
yakhyoPanquesito7
andauthored
Uzbek language is being added (#159)
* Uzbek language added * Fibonaci series added into Uzbek * Update Fibonachi sonlari.md * Update uz/Boshlang'ich Matematika/Fibonachi sonlari.md Co-authored-by: David Leal <[email protected]> Co-authored-by: David Leal <[email protected]>
1 parent 751b786 commit fd76e46

7 files changed

+96
-0
lines changed

README.md

+1
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@ Popular algorithms explained in simple language with examples and links to their
99

1010
## Languages
1111

12+
- [Uzbek](./uz)
1213
- [Brazilian Portuguese](./pt-br)
1314
- [English](./en)
1415
- [French](./fr)
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
# Arifmetik Progressiya
2+
3+
**Arifmetik progressiya** – ikkinchisidan boshlab har bir son oʻzidan oldingi songa shu qator uchun oʻzgarmas bir son **d** (progressiya ayirmasi)ni qoʻshishdan hosil boʻladigan sonlar qatori.
4+
Masalan, 2, 4, 6, 8, 10 sonlar qatori Arifmetik progressiyadir. Chunki, bu qatordagi har bir son oldingisidan bir xilga, 2ga farq qiladi.
5+
<p align="center">
6+
<img width="60%" src="https://user-images.githubusercontent.com/75872316/122635132-ce38d100-d0ff-11eb-8fdf-2e14a9f640cc.png">
7+
</p>
8+
9+
**Arifmetik Progressiyada:**
10+
11+
1. Arifmetik Progressiyaning birinchi elementi uning `birinchi hadi` deyiladi.
12+
2. hadlari orasidagi farqi esa Arifmetik Progressiyaning `ayirmasi` deyiladi.
13+
3. Arifmetik Progressiyaning o'suvchi yoki kamayuvchi bo'lishini uning `ayirmasi` ifodalayadi. Agar Arifmetik Progressiya `ayirmasi` musbat bo'lsa (`d>0`), `o'suvchi` agarda manfiy bo'lsa (`d<0`), kamayuvchi bo'ladi.
14+
15+
**Arifmetik Progressiyaning `n`chi hadini topish:**
16+
17+
a<sub>1</sub> - birinchi hadi va `d` esa arifmetik progressiya ayirmasi. Shulardan kelib chiqqan holatda umumiy formula quyidagicha bo'ladi:
18+
<p align="center">
19+
<img width="60%" src="https://user-images.githubusercontent.com/75872316/122635193-25d73c80-d100-11eb-9015-344d36633704.png">
20+
</p>
21+
22+
**Arifmetik Progressiyaning birinchi `n`ta hadini yig'indisini topish:**
23+
24+
<p align="center">
25+
<img width="60%" src="https://user-images.githubusercontent.com/75872316/122635260-7a7ab780-d100-11eb-82a5-8ceeba3aff03.png">
26+
</p>
27+
28+
**Arifmetik Progressiyaga oid masalalarni yechishni umumiy formulalari:**
29+
30+
Agar a<sub>1</sub> - birinchi xadi va uning ayirmasi - `d` bo'lsa:
31+
- **a<sub>n</sub>** = a<sub>1</sub> + (n-1)*d.
32+
- **Arifmetik o'rtanchasini topish:** S<sub>n</sub> / n.
33+
- **Dastlabki `n`tasini yig'indisi** `S = 0.5 n [ 2a + (n-1) d ]`.
34+
35+
# Manba
36+
37+
- [Arifmetik Progressiya](https://uz.khanacademy.org/math/algebra/sequences/introduction-to-arithmetic-squences/a/using-formulas-of-arithmetic-sequences)
38+
39+
# YouTube
40+
41+
- [Video materialga bog'ich](https://youtu.be/UVDpqDlBhyE)

uz/Boshlang'ich Matematika/Eng katta sonni topish.md

Whitespace-only changes.
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
# Fibonachi sonlari
2+
3+
Matematikada Fibonachi sonlari deb nomlanadigan sonlar qatori mavjud bo'lib, bu sonlar qatorida har bir son o'zidan
4+
avval kelgan ikkitda ketma-ket sonlarning yig'indisidan iboratdir. Fibonachi sonlar qatorining birinchi va ikkinchi
5+
hadlari mos ravishda 0 va 1ga tengdir. Quyidagi qator ham Fibonachi qatori hisoblanadi:
6+
`[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...]`
7+
8+
## Foydalanish
9+
10+
Biz Fibonachi sonlar qatorini asosan kompyterlarda qidirish algorithmi sifatida ko'rishimiz mumkin. Bundan tashqari bu
11+
qatorni bir hayotimizning quyidagi jabhalarida uchratib turishimiz mumkin:
12+
13+
- Daraxt barglarining o'zagida va daraxt shoxlarida uchratib turishimiz mumkin.
14+
15+
Hozirgi kunda Fibonachi sonlar qatori va Oltin nisbatga fizika, kvant mehanikasi va kriptografiya sohasida izlanish olib
16+
boruvchilar tomonidan katta qiziqishlar bildirilmoqda.
17+
18+
## Namuna
19+
20+
Fibonachi sonlarning 8chi hadini topishni ko'rib chiqamiz:
21+
22+
23+
1-had | `f1 = 0`
24+
25+
2-had | `f2 = 1 `
26+
27+
3-had | `f3 = f1+f2`=1
28+
29+
4-had | `f4 = f2+f3`=2
30+
31+
5-had | `f5 = f3+f4`=3
32+
33+
6-had | `f6 = f4+f5`=5
34+
35+
7-had | `f7 = f5+f6`=8
36+
37+
8-had | `f8 = f6+f7`=13
38+
39+
f(8)=21
40+
41+
## Fibonachi algoritmning dasturlash tillaridagi ko'rinishi:
42+
43+
- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/fibonacci.cpp)
44+
- [Java](https://github.com/TheAlgorithms/Java/blob/master/Maths/FibonacciNumber.java)
45+
- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/80c2dc85d714f73783f133964d6acd9b5625ddd9/Maths/Fibonacci.js)
46+
- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py)
47+
48+
## Video bog'ich
49+
50+
- [YouTube](https://youtu.be/FQiRf4jb3PU)
51+
52+
## Boshqa manbalar
53+
54+
- [Wikipedia](https://uz.wikipedia.org/wiki/Fibonachchi_sonlari)

uz/Boshlang'ich Matematika/Geometrik progressiya.md

Whitespace-only changes.

uz/Boshlang'ich Matematika/O'rtacha qiymat.md

Whitespace-only changes.

uz/Boshlang'ich Matematika/Raqamlar sonini topish.md

Whitespace-only changes.

0 commit comments

Comments
 (0)