The environment greatly influences the establishment of human character and large urban suburbs are areas inhabited majority by the lower middle class. The main goal in community service is to provide character education through free tutoring for Mathematics and English  for primary school in course center Pencil Generation in Zone V Simalingkar B Sub-District Medan Tuntungan North Sumatera. The method used in process of the character education is the Whole Brain Teaching (WBT) method which is integrated during the teaching and learning process in the course center. The steps taken by the team in order to carry out this activity are as follows: (1). preparation for service activities, (2). provide guidance about characters, (3). forming learning groups based on class, (4). guide children to learn with the Whole Brain Teaching method, (5). sometimes play games related to Mathematics and English. The result of this service is  academic improvement in Mathematics and English. Beside the academic improvement, there is also an increase in character that is manners, perseverance, discipline, tolerance, and caring.

This study aims to introduce an investigation method to solve mathematical problems using the Japanese anime series Detective Conan, while the spesific purpose is to introduce students to problem solving method that they need to understand based on the information provided and manage the information based on their abilities.  The method used in this research is classroom action research by showing one episode of the Detective Conan anime, after that organized several groups to test each group could solve the challenge quiz within 30 minutes and the results of the analysis of work based on cognitive function. The results showed that the mean duration of group investigation quiz was not significantly different from 30 minutes. In addition, based on the mean assessment of the results of the work there are two results, namely there are differences in values based on groups and no differences in values based on cognitive function..

Abstrak: Faktorisasi polinomial merupakan suatu proses penguraian suatu  polinomial berderajat n menjadi polinomial-polinomial lain yang berderajat lebih kecil dari n.  Faktorisasi polinomial atas lapangan hingga  merupakan suatu proses pengerjaan yang relative tidak mudah. Oleh karena itu, diperlukan suatu metode yang berupa algoritma untuk memproses faktorisasi polinomial. Algoritma Faktorisasi Berlekamp merupakan salah satu metode terbaik dalam memfaktorisasi polinomial atas lapangan hingga . Polinomial atas lapangan terbagi dua kategori berdasarkan faktorisasinya, yaitu polinomial square-free dan bukan square-free. Polinomial square-free adalah polinomial dimana setiap faktorisasi tak tereduksi tunggal. Sedangkan bukan square-free adalah sebaliknya. Penelitian ini bertujuan untuk membuat suatu algoritma untuk menfaktorkan polinomial square-free dan bukan square-free atas lapangan hingga. Adapun (Divasὀn, Joosten, Thiemann, & Yamada, 2017) yang menjadi referensi utama dalam penelitian ini adalah berdasarkan. Namun, dibatasi hanya untuk polinomial square-free saja. Untuk itulah dengan menggunakan konsep polinomial faktorisasi ganda. Pada bagian akhir penelitian akan mengimplementasikan algoritma baru yang telah disusun. Abstract:  Polynomial factorization is a decomposition of a polynomial of degree n into other polynomials whose degree is less than n. Polynomial factorization over finite field  is a relatively easy in process. Therefore, it’s needed a method in the form of an algorithm to process polynomial factorization. Algorithm Factorization Berlekamp is one of the best methods in factoring polynomials over a finite field  . Polynomials over field are divided into two category based on its factorization, namely square-free and not square-free polynomials. Square-free polynomials are polynomials in which each irreducible factorization is single. When non square-free is the opposite. This research aims to set an algorithm for factoring square-free polynomials and non square-free polynomials over a finite field   . The main reference in this research is based on (Divasὀn, Joosten, Thiemann, & Yamada, 2017) (Saropah, 2012). However, it is restricted only  to square-free polynomials. For this reason, this research will use the concept of repeated factorization polynomials. At the end of the research will implement a new algorithm that has been set.

Kode blok adalah skema penyandian yang menggunakan sistem kode-kode pada suatu lapangan hingga dengan panjang yang sama dan tetap. Kode blok linear atau lebih sering disebut kode linear atas suatu lapangan hingga merupakan himpunan kode-kode blok dengan panjang  yang membentuk suatu subruang bagian atas lapangan hingga  dengan  adalah bilangan prima dan  bilangan bulat positif. Sedangkan kode linear  dikatakan kode siklik jika setiap elemennya diputar masih terdapat di himpunan kode linear . Setiap kode blok di kode siklik mempunyai korespondensi dengan semua faktorisasi polinomial tak tereduksi dari polinmial . Umumnya, pembahasan mengenai kode siklik pada lapangan hingga hanya dibatasi oleh Hal ini menyebabkan setiap faktor dari polinomial  adalah tunggal. Untuk , memunculkan suatu pendefinisian baru dari konsep kode siklik. Kode siklik ini disebut disebut kode siklik berulang (repeated cyclic code). Penelitian ini mencakup sifat dan struktur ring  dari kode linear atas ring rangkaian komutatif hingga, kontruksi kode siklik berulang, algoritma dari kontruksi kode siklik atas lapangan hingga  dengan  bilangan prima tertentu.

The DNA molecule chain consists of two complementary strands composed of a sequence of four nucleotide bases, namely adenine (A), cytosine (C), guanine (G) and thymine (T). DNA code is a set of codewords with a fixed length of the alphabet {A, C, T, G}. DNA coding is one application of coding theory over a finite field. The set {A, C, T, G} is identified as finite field GF(4) = {0, 1, w, w2} with w2 + w + 1 = 0. The reversible self-dual (RSD) code over the finite field GF(4) is a code whose dual is itself and the reverse of each codeword contained in the code. This study aims to obtain an algorithm to construct a DNA code derived from the RSD C code on the field to GF(4) which is called the Reversible Self-Dual Method. The aspects studied include the characteristics that form the basis properties of the theory in compiling the DNA code algorithm over the RSD code over GF(4). The compiled algorithm is a DNA code construction method of codeword length even that conforms to the Hamming distance constraint, reverse-complement constraint, and GC-content constraint. The input of the algorithm is a generator matrix of RSD code C with a minimum distance of d and the output is a DNA code that satisfies these three constraints.