Skip to content

Commit

Permalink
Uzbek language is being added (#159)
Browse files Browse the repository at this point in the history
* 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]>
  • Loading branch information
yakhyo and Panquesito7 authored Jan 24, 2022
1 parent 751b786 commit fd76e46
Show file tree
Hide file tree
Showing 7 changed files with 96 additions and 0 deletions.
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -9,6 +9,7 @@ Popular algorithms explained in simple language with examples and links to their

## Languages

- [Uzbek](./uz)
- [Brazilian Portuguese](./pt-br)
- [English](./en)
- [French](./fr)
Expand Down
41 changes: 41 additions & 0 deletions uz/Boshlang'ich Matematika/Arifmetik progressiya.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
# Arifmetik Progressiya

**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.
Masalan, 2, 4, 6, 8, 10 sonlar qatori Arifmetik progressiyadir. Chunki, bu qatordagi har bir son oldingisidan bir xilga, 2ga farq qiladi.
<p align="center">
<img width="60%" src="https://user-images.githubusercontent.com/75872316/122635132-ce38d100-d0ff-11eb-8fdf-2e14a9f640cc.png">
</p>

**Arifmetik Progressiyada:**

1. Arifmetik Progressiyaning birinchi elementi uning `birinchi hadi` deyiladi.
2. hadlari orasidagi farqi esa Arifmetik Progressiyaning `ayirmasi` deyiladi.
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.

**Arifmetik Progressiyaning `n`chi hadini topish:**

a<sub>1</sub> - birinchi hadi va `d` esa arifmetik progressiya ayirmasi. Shulardan kelib chiqqan holatda umumiy formula quyidagicha bo'ladi:
<p align="center">
<img width="60%" src="https://user-images.githubusercontent.com/75872316/122635193-25d73c80-d100-11eb-9015-344d36633704.png">
</p>

**Arifmetik Progressiyaning birinchi `n`ta hadini yig'indisini topish:**

<p align="center">
<img width="60%" src="https://user-images.githubusercontent.com/75872316/122635260-7a7ab780-d100-11eb-82a5-8ceeba3aff03.png">
</p>

**Arifmetik Progressiyaga oid masalalarni yechishni umumiy formulalari:**

Agar a<sub>1</sub> - birinchi xadi va uning ayirmasi - `d` bo'lsa:
- **a<sub>n</sub>** = a<sub>1</sub> + (n-1)*d.
- **Arifmetik o'rtanchasini topish:** S<sub>n</sub> / n.
- **Dastlabki `n`tasini yig'indisi** `S = 0.5 n [ 2a + (n-1) d ]`.

# Manba

- [Arifmetik Progressiya](https://uz.khanacademy.org/math/algebra/sequences/introduction-to-arithmetic-squences/a/using-formulas-of-arithmetic-sequences)

# YouTube

- [Video materialga bog'ich](https://youtu.be/UVDpqDlBhyE)
Empty file.
54 changes: 54 additions & 0 deletions uz/Boshlang'ich Matematika/Fibonachi sonlari.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,54 @@
# Fibonachi sonlari

Matematikada Fibonachi sonlari deb nomlanadigan sonlar qatori mavjud bo'lib, bu sonlar qatorida har bir son o'zidan
avval kelgan ikkitda ketma-ket sonlarning yig'indisidan iboratdir. Fibonachi sonlar qatorining birinchi va ikkinchi
hadlari mos ravishda 0 va 1ga tengdir. Quyidagi qator ham Fibonachi qatori hisoblanadi:
`[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...]`

## Foydalanish

Biz Fibonachi sonlar qatorini asosan kompyterlarda qidirish algorithmi sifatida ko'rishimiz mumkin. Bundan tashqari bu
qatorni bir hayotimizning quyidagi jabhalarida uchratib turishimiz mumkin:

- Daraxt barglarining o'zagida va daraxt shoxlarida uchratib turishimiz mumkin.

Hozirgi kunda Fibonachi sonlar qatori va Oltin nisbatga fizika, kvant mehanikasi va kriptografiya sohasida izlanish olib
boruvchilar tomonidan katta qiziqishlar bildirilmoqda.

## Namuna

Fibonachi sonlarning 8chi hadini topishni ko'rib chiqamiz:


1-had | `f1 = 0`

2-had | `f2 = 1 `

3-had | `f3 = f1+f2`=1

4-had | `f4 = f2+f3`=2

5-had | `f5 = f3+f4`=3

6-had | `f6 = f4+f5`=5

7-had | `f7 = f5+f6`=8

8-had | `f8 = f6+f7`=13

f(8)=21

## Fibonachi algoritmning dasturlash tillaridagi ko'rinishi:

- [C++](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/fibonacci.cpp)
- [Java](https://github.com/TheAlgorithms/Java/blob/master/Maths/FibonacciNumber.java)
- [Javascript](https://github.com/TheAlgorithms/Javascript/blob/80c2dc85d714f73783f133964d6acd9b5625ddd9/Maths/Fibonacci.js)
- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/fibonacci.py)

## Video bog'ich

- [YouTube](https://youtu.be/FQiRf4jb3PU)

## Boshqa manbalar

- [Wikipedia](https://uz.wikipedia.org/wiki/Fibonachchi_sonlari)
Empty file.
Empty file.
Empty file.

0 comments on commit fd76e46

Please sign in to comment.