Hubungan Antara Psychological Well-being Dan Happiness Pada Remaja Di Pondok Pesantren

Penelitian ini bertujuan untuk menguji hubungan antara psychological well-being dengan happiness pada remaja di pondok pesantren. Metode penelitian yang digunakan dalam penelitian ini terdapatlah metode kuantitatif dan uji hipotesis dilakukan dengan teknik analisis korelasi bivariate. Sampel penelitian sebanyak 90 responden remaja di pondok pesantren di Depok. Pengambilan data dengan menggunakan skala psychological well-being, skala kebahagiaan umum, positive affect, negative affect dan satisfaction with life. Uji hipotesis dalam penelitian ini menggunakan teknik korelasi product moment. Dari hasil penelitian dapat disimpulkan bahwa terdapatnya korelasi yang positif antara psychological well-being dengan kebahagiaan umum, terdapatnya korelasi yang positif antara psychological well-being dengan positive affect, terdapatnya korelasi yang negatif antara psychological well-being dengan negative affect terdapatnya korelasi yang positif antara psychological well-being dengan satisfaction with life. Hasil uji hipotesis dalam penelitian ini diterima, artinya terdapat hubungan yang positif antara psychological well-being yang tinggi dan happiness yang tinggi

Problems and memories

I state some open problems coming from joint work with Paul Erd\H{o}sComment: This is a paper form of the talk I gave on July 5, 2013 at the centennial conference in Budapest to honor Paul Erd\H{o}

Unordered Canonical Ramsey Numbers

AbstractWe define a weak form of canonical colouring, based on that of P. Erdős and R. Rado (1950, J. London Math. Soc.25, 249–255). This yields a class of unordered canonical Ramsey numbers CR(s, t), again related to the canonical Ramsey numbers ER(2; s) of Erdős and Rado. We present upper and lower bounds (the latter via a construction) for CR(s, t) which are significantly tighter than the best-known corresponding bounds for ER(2; s)

A proof of the stability of extremal graphs, Simonovits' stability from Szemer\'edi's regularity

The following sharpening of Tur\'an's theorem is proved. Let $T_{n,p}$ denote the complete $p$--partite graph of order $n$ having the maximum number of edges. If $G$ is an $n$-vertex $K_{p+1}$-free graph with $e(T_{n,p})-t$ edges then there exists an (at most) $p$-chromatic subgraph $H_0$ such that $e(H_0)\geq e(G)-t$. Using this result we present a concise, contemporary proof (i.e., one applying Szemer\'edi's regularity lemma) for the classical stability result of Simonovits.Comment: 4 pages plus reference

The order of elements in Sylow pp-subgroups of the symmetric group

Define a random variable $\xi_n$ by choosing a conjugacy class $C$ of the Sylow $p$-subgroup of $S_{p^n}$ by random, and let $\xi_n$ be the logarithm of the order of an element in $C$. We show that $\xi_n$ has bounded variance and mean order $\frac{\log n}{\log p}+O(1)$, which differs significantly from the average order of elements chosen with equal probability