CD Skripsi

Pembuktian Barisan ⌊kpn⌋ Adalah Barisan Naik Dengan Menentukan Nilai Dari n (mod k)

---

This final project discusses the increases of the sequence ⌊k
√
n⌋ for any fixed
positive integer k. For the increases of the sequence, the simplified expressions
value of n (mod k) is given. This is a review of some parts of Hyatt and Skayers
[Journal of Combinatorial Number Theory, 15 (2015), 1-12]. Furthermore,
we provide the difference between the upper bound and lower bound of the
increase.
Keywords: Sequences, upper and lower bounds, floor and ceiling function,
congruence modulo

---

Ketersediaan

Informasi Detail

Judul Seri

-

No. Panggil

03 03.116 (0017)

Penerbit

Pekanbaru : Universitas Riau - FMIPA - Matematika., 2016

Deskripsi Fisik

x, 29 hlm.: ill.: 29 cm

Bahasa

Indonesia

ISBN/ISSN

-

Klasifikasi

03 03.116 (0017)

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

MATEMATIKA

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Dewa

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar