bonjour. Bienvenue sur mon blog. Blog ini saya buat dengan tujuan untuk berbagi cerita. Tentang saya, bisnis saya, keluarga serta teman-teman saya. Selamat membaca, semoga bermanfaat. enjoy this :)
Selasa, 20 Desember 2011
Selasa, 06 Desember 2011
WORKSHEET BILANGAN BULAT
I. Tentukan hasil dari penjumlahan berikut !
a. 9 + 5 = …
b. -14 + 8 = …
c. 1 + (-6) = …
d. -5 + (-5) = …
e. 24 + (-1) = …
II. Tentukan hasil dari pengurangan berikut !
a. 15 – 3 = …
b. -7 – 5 = …
c. 6 – (-2) = …
d. -1 – (-3) = …
e. 5 – (-5) = …
III. Tentukan hasil dari perkalian berikut !
a. -8 X 4 = …
b. -3 X (-2) = …
c. 11 x (-1) = …
d. 3 x 9 = …
e. -10 x 9 = …
Kamis, 27 Oktober 2011
Peran Integrasi Seni dalam Pembelajaran Matematika
MATEMATIKA DAN WARISAN BUDAYA
the great prime Mersenne.
Computer lab team hits its prime
Now that we've all had time to adjust to the enormity of $700 billion, here's a new challenge: Try bending your mind around a number that's 13 million digits long.
It's a number that is so long that if you typed it out at 10 characters per inch, it would stretch 20 to 30 miles long, depending on what font you were using. As the world's largest known prime number (a number only divisible by itself and 1), it was recently discovered by an ordinary UCLA computer in the math department, thanks to the efforts of a team of seven system administrators who joined a competition called the Great Internet Mersenne Prime Search (GIMPS) a year ago.
UCLA's prime team includes (eft to right)Charles Chen,Chris Oberlander, Jim Carter,Edson Smith,Robert Amodeo and Ed Trejo. Missing from the photo is Linda Bingham. (Photo by Reed Hutchinson)
Last August, the team leader, computing resource manager Edson Smith, went down in history as the finder of the 45th known Mersenne Prime (MP), ending a nearly decades-long hunt by more than 50,000 people and tens of thousands of computers around the world. Once the number is published a year from now in some academic journal, Smith is likely to share in a $100,000 prize. The money is being provided by the Electronic Frontier Foundation — the Internet's premier civil liberties organization — to the finder of the first Mersenne Prime that is at least 10 million digits long.
Under the rules, 50 percent of the award will go to the finder of the number, with 25 precent going to charity (budget-strapped math departments qualify) and 25 percent going to the other discoverers of MPs. GIMPS will also receive a small slice of the award.
"We didn't really do this for the money," said Smith, sitting amidst 75 computers in Boelter Hall's Program In Computing (PIC) Lab, where the UCLA hunt-for-the-prime was based. "It was more of an exercise that we thought would be fun and maybe get undergrads interested in computational math. It's a hobby for some people, sort of a passion. There's really no guarantee that any of these numbers exist. We don't know they're there until we find them. So it's exciting to push the envelope."
The power of many
The Mersenne Primes, named after 17th century mathematician and music theorist Marin Mersenne, are a subclass of prime numbers that can be expressed mathematically as 2p-1.(In this case, the UCLA exponent, the p, is a whopping 43,112,609.) While ancient mathematicians found the smaller MPs by doing their own calculations, the MPs quickly got larger and more unwieldy. The majority of MPs have been discovered in the past 50 years, largely with the help of computers and several of them at UCLA. UC Berkeley professor Raphael Robinson, while on temporary assignment at UCLA, found five MPs in 1952 using one of the fastest computers of that era. In 1961, Alexander Hurwitz, a UCLA mathematician, discovered two MPs on another UCLA computer.
In fact, tens of thousands have participated in the search by downloading a free program from GIMPS, which keeps track of which numbers are tested and eliminated, and sends out untested candidate numbers to the GIMPS community for factoring. The process of factoring one number can take a computer as long as two months, Smith explained. But joining forces via the Internet makes the search possible.
"It's an example," Smith said, "of the power of distributed computing," leveraging the power of Internet-connected computers all over the world.
The first few digits of the Mersenne prime number discovered at UCLA.
The ability to exploit the power of many computers working in parallel could, in fact, have an additional significant side benefit, said Terence Tao, UCLA's first mathematician to receive the prestigious Fields Medal, often described as the "Nobel Prize in Mathematics."
"This could very well come in handy for any future mathematical problem which requires a similar amount of manipulation of extremely large numbers," Tao noted. "In particular, the type of computations that come up in modern cryptography are actually quite similar in many ways to what is used by GIMPS. So there may be some insights gained into how to encrypt or decrypt messages more quickly."
Humble lab, newfound celebrity
The MP discovery has given the humble PIC Lab some notoriety. "Welcome to the world famous PIC Lab" a handwritten sign on the door says. "Big Number Found Here," another hand-lettered sign announces. Located way, way off the beaten path in Boelter Hall, the lab is used by non-computer science majors from north and south campus who learning computer programming.
But when the students leave and the computers are left to their own devices, their unused power, their CPUs, are left unengaged — at least until about a year ago, when they joined the quest for the MP.
"We knew we had lots and lots of computers down here that weren't doing anything 99.9 percent of the time," Smith said. "They were just running idle. And we were looking for something useful for them to do."
Smith's team, whose members do everything from build computer clusters to deal with dirty "mice," looked at several distributed computing projects that could run on PIC computers in the background when there was downtime. They decided to load the GIMPS program because it's simple, well written and doesn't interfere with the computers' main job. They also hoped that students might become interested in the challenge and learn more about computational math.
Learn more about Mersenne Primes with this FAQ put together by Smith for both the math- inclined and the math-challenged.
"When we did this, we never expected to actually find one," Smith said. But on August 23, a Dell Optiflex 745 running Wondows XP started inexplicably beeping. "I thought it might be broken. It was making the same sound you get with a broken keyboard," said Smith.
But an e-mail from George Woltman, who founded GIMPS and wrote the prime testing software, confirmed that he had received a message — one of the UCLA computers had indeed turned up a candidate prime.
GIMPS tested the number by factoring it using a different algorithm on various kinds of computers. "We had to sweat it out for two weeks until they verified it," Smith said.
Oddly enough, two weeks after the UCLA prime was discovered, Hans-Michael Elvenich of Germany, another prime number enthusiast, came up with an MP — but only 11.2-million digits long, smaller than UCLA's.
Learn more about the Great Internet Mersenne Prime Search.
Since their find was made public, Smith has been interviewed by the L.A. Times, Australian and BBC radio and the Voice of America. "I'm not a mathematician," he tells them repeatedly, slightly uncomfortable with his newfound celebrity.
It's not what one man — or even one computer — can do, Smith reminds people.
"The most important thing is that we are pushing the frontiers of what cooperative computers can do," he said. "People working together on a single goal can solve amazing things that are completely unsolvable without cooperation."
source : http://www.today.ucla.edu/portal/ut/PRN-081008_mersenne-prime.aspx
Senin, 03 Oktober 2011
SYMMETRY GROUP
SYMMETRY GROUP
Symmetry group is A group of symmetry-preserving operations, i.e., rotations, reflections, and inversions. Symmetry group is a college-level concept that would be first encountered in an abstract algebra course covering group theory.
Examples
Dihedral Group:
The symmetry group for a regular polygon.
Prerequisites
Group:
A set of elements and a binary operation that together satisfy the four fundamental properties of closure, associativity, the identity property, and the inverse property.
A tetrahedron can be placed in 12 distinct positions by rotation alone. These are illustrated above in the cycle graph format, along with the 180° edge (blue arrows) and 120° vertex (reddish arrows) rotations that permute the tetrahedron through the positions. The 12 rotations form the rotation (symmetry) group of the figure.
The symmetry group of an object (image, signal, etc.) is the group of all isometries under which it is invariant with composition as the operation. It is a subgroup of the isometry group of the space concerned.
Introduction
The "objects" may be geometric figures, images, and patterns, such as a wallpaper pattern. The definition can be made more precise by specifying what is meant by image or pattern, e.g., a function of position with values in a set of colors. For symmetry of physical objects, one may also want to take physical composition into account. The group of isometries of space induces a group action on objects in it.
The symmetry group is sometimes also called full symmetry group in order to emphasize that it includes the orientation-reversing isometries (like reflections, glide reflections and improper rotations) under which the figure is invariant. The subgroup of orientation-preserving isometries (i.e. translations, rotations, and compositions of these) which leave the figure invariant is called its proper symmetry group. The proper symmetry group of an object is equal to its full symmetry group if and only if the object is chiral (and thus there are no orientation-reversing isometries under which it is invariant).
Any symmetry group whose elements have a common fixed point, which is true for all finite symmetry groups and also for the symmetry groups of bounded figures, can be represented as a subgroup of orthogonal group O(n) by choosing the origin to be a fixed point. The proper symmetry group is a subgroup of the special orthogonal group SO(n) then, and therefore also called rotation group of the figure.
Discrete symmetry groups come in three types: (1) finite point groups, which include only rotations, reflections, inversion and rotoinversion - they are in fact just the finite subgroups of O(n), (2) infinite lattice groups, which include only translations, and (3) infinite space groups which combines elements of both previous types, and may also include extra transformations like screw axis and glide reflection. There are also continuous symmetry groups, which contain rotations of arbitrarily small angles or translations of arbitrarily small distances. The group of all symmetries of a sphere O(3) is an example of this, and in general such continuous symmetry groups are studied as Lie groups. With a categorization of subgroups of the Euclidean group corresponds a categorization of symmetry groups.
Two geometric figures are considered to be of the same symmetry type if their symmetry groups are conjugate subgroups of the Euclidean group E(n) (the isometry group of Rn), where two subgroups H1, H2 of a group G are conjugate, if there exists g ∈ G such that H1=g−1H2g. For example:
• two 3D figures have mirror symmetry, but with respect to different mirror planes.
• two 3D figures have 3-fold rotational symmetry, but with respect to different axes.
• two 2D patterns have translational symmetry, each in one direction; the two translation vectors have the same length but a different direction.
When considering isometry groups, one may restrict oneself to those where for all points the set of images under the isometries is topologically closed. This excludes for example in 1D the group of translations by a rational number. A "figure" with this symmetry group is non-drawable and up to arbitrarily fine detail homogeneous, without being really homogeneous.
One dimension
The isometry groups in 1D where for all points the set of images under the isometries is topologically closed are:
• the trivial group C1
• the groups of two elements generated by a reflection in a point; they are isomorphic with C2
• the infinite discrete groups generated by a translation; they are isomorphic with Z
• the infinite discrete groups generated by a translation and a reflection in a point; they are isomorphic with the generalized dihedral group of Z, Dih(Z), also denoted by D∞ (which is a semidirect product of Z and C2).
• the group generated by all translations (isomorphic with R); this group cannot be the symmetry group of a "pattern": it would be homogeneous, hence could also be reflected. However, a uniform 1D vector field has this symmetry group.
• the group generated by all translations and reflections in points; they are isomorphic with the generalized dihedral group of R, Dih(R).
Two dimensions
Up to conjugacy the discrete point groups in 2 dimensional space are the following classes:
• cyclic groups C1, C2, C3, C4,... where Cn consists of all rotations about a fixed point by multiples of the angle 360°/n
• dihedral groups D1, D2, D3, D4,... where Dn (of order 2n) consists of the rotations in Cn together with reflections in n axes that pass through the fixed point.
C1 is the trivial group containing only the identity operation, which occurs when the figure has no symmetry at all, for example the letter F. C2 is the symmetry group of the letter Z, C3 that of a triskelion, C4 of a swastika, and C5, C6 etc. are the symmetry groups of similar swastika-like figures with five, six etc. arms instead of four.
D1 is the 2-element group containing the identity operation and a single reflection, which occurs when the figure has only a single axis of bilateral symmetry, for example the letter A. D2, which is isomorphic to the Klein four-group, is the symmetry group of a non-equilateral rectangle, and D3, D4 etc. are the symmetry groups of the regular polygons.
The actual symmetry groups in each of these cases have two degrees of freedom for the center of rotation, and in the case of the dihedral groups, one more for the positions of the mirrors.
The remaining isometry groups in 2D with a fixed point, where for all points the set of images under the isometries is topologically closed are:
• the special orthogonal group SO(2) consisting of all rotations about a fixed point; it is also called the circle group S1, the multiplicative group of complex numbers of absolute value 1. It is the proper symmetry group of a circle and the continuous equivalent of Cn. There is no figure which has as full symmetry group the circle group, but for a vector field it may apply (see the 3D case below).
• the orthogonal group O(2) consisting of all rotations about a fixed point and reflections in any axis through that fixed point. This is the symmetry group of a circle. It is also called Dih(S1) as it is the generalized dihedral group of S1.
For non-bounded figures, the additional isometry groups can include translations; the closed ones are:
• the 7 frieze groups
• the 17 wallpaper groups
• for each of the symmetry groups in 1D, the combination of all symmetries in that group in one direction, and the group of all translations in the perpendicular direction
• ditto with also reflections in a line in the first direction
Three dimensions
Up to conjugacy the set of 3D point groups consists of 7 infinite series, and 7 separate ones. In crystallography they are restricted to be compatible with the discrete translation symmetries of a crystal lattice. This crystallographic restriction of the infinite families of general point groups results in 32 crystallographic point groups (27 from the 7 infinite series, and 5 of the 7 others).
The continuous symmetry groups with a fixed point include those of:
• cylindrical symmetry without a symmetry plane perpendicular to the axis, this applies for example often for a bottle
• cylindrical symmetry with a symmetry plane perpendicular to the axis
• spherical symmetry
For objects and scalar fields the cylindrical symmetry implies vertical planes of reflection. However, for vector fields it does not: in cylindrical coordinates with respect to some axis, has cylindrical symmetry with respect to the axis if and only if Aρ,Aφ, and Az have this symmetry, i.e., they do not depend on φ. Additionally there is reflectional symmetry if and only if Aφ = 0.
For spherical symmetry there is no such distinction, it implies planes of reflection.
The continuous symmetry groups without a fixed point include those with a screw axis, such as an infinite helix. See also subgroups of the Euclidean group.
Symmetry groups in general
In wider contexts, a symmetry group may be any kind of transformation group, or automorphism group. Once we know what kind of mathematical structure we are concerned with, we should be able to pinpoint what mappings preserve the structure. Conversely, specifying the symmetry can define the structure, or at least clarify what we mean by an invariant, geometric language in which to discuss it; this is one way of looking at the Erlangen programme.
For example, automorphism groups of certain models of finite geometries are not "symmetry groups" in the usual sense, although they preserve symmetry. They do this by preserving families of point-sets rather than point-sets (or "objects") themselves.
Like above, the group of automorphisms of space induces a group action on objects in it.
For a given geometric figure in a given geometric space, consider the following equivalence relation: two automorphisms of space are equivalent if and only if the two images of the figure are the same (here "the same" does not mean something like e.g. "the same up to translation and rotation", but it means "exactly the same"). Then the equivalence class of the identity is the symmetry group of the figure, and every equivalence class corresponds to one isomorphic version of the figure.
There is a bijection between every pair of equivalence classes: the inverse of a representative of the first equivalence class, composed with a representative of the second.
In the case of a finite automorphism group of the whole space, its order is the order of the symmetry group of the figure multiplied by the number of isomorphic versions of the figure.
Examples:
• Isometries of the Euclidean plane, the figure is a rectangle: there are infinitely many equivalence classes; each contains 4 isometries.
• The space is a cube with Euclidean metric; the figures include cubes of the same size as the space, with colors or patterns on the faces; the automorphisms of the space are the 48 isometries; the figure is a cube of which one face has a different color; the figure has a symmetry group of 8 isometries, there are 6 equivalence classes of 8 isometries, for 6 isomorphic versions of the figure.
Compare Lagrange's theorem (group theory) and its proof.
Source :
http://mathworld.wolfram.com/classroom/SymmetryGroup.html
http://en.wikipedia.org/wiki/Symmetry_group
Kamis, 29 September 2011
alat peraga peluang ( kartu bridge )


congklak bil-bul (alat peraga bilangan bulat)

Kamis, 08 September 2011
ALAT PERAGA PELUANG (BANGAU)
Materi yang relevan dengan alat peraga: statistik dan peluang
Gambar Bangau Origami adalah sebuah seni lipat yang berasal dari Jepang. Bahan yang digunakan adalah kertas atau kain yang biasanya berbentuk persegi. Kita dapat membuat bentuk apaun menggunakan origami. Salah satu yang dapat dibentuk adalah bangau.
Statistika adalah pengetahuan yang berhubungan dengan cara-cara pengumpulan data, pengolahan, penganalisisan, dan penarikan kesimpulan berdasarkan data. Sedangkan statistik sendiri merupakan kumpulan data, baik bilangan maupun nonbilangan yang disusun dalam tabel dan atau diagram yang menggambarkan atau memaparkan suatu masalah.
Penggunaan dalam statistic untuk menentukan nilai rata-rata (mean), median, modus, rentang dan lain-lain pada data tunggal. Dengan menggunakan bangau sebagai alat peraga dalam pelajaran statistic dan peluang, diharapkan pemahan siswa dalam materi tersebut dapat bertambah.
Alat dan bahan yang diperlukan untuk membuat bangau :
50 lembar kertas origami yang terdiri dari
1. biru muda 10 lembar,
2. hitam 8 lembar,
3. oranye 7 lembar,
4. ungu 5 lembar,
5. hijau muda 5 lembar,
6. hijau tua 5 lembar,
7. coklat 4 lembar,
8. biru tua 3 lembar,
9. merah 2 lembar,
10. kuning 1 lembar.
Cara membuat bangau menggunakan kertas origami yaitu sediakan kertas origami dan ikuti langkah berikut ini.

Cara penggunaan bangau pada materi statistik:
Diketahui : ada 50 bangau, terdiri dari 10 bangau biru muda, 8 bangau hitam, 7 bangau oranye, 5 bangau ungu, 5 bangau hijau muda, 5 bangau hijau tua, 4 bangau coklat, 3 bangau biru tua, 2 bangau merah dan 1 bangau kuning.
1. Berapa modus dalam data tersebut ?
Jawab : Modus = 5. Dengan frekuensi 3.
*modus merupakan nilai (angka) yang sering muncul,
2. Berapa nilai maksimal dan nilai minimal dalam data tersebut ?
Jawab: Nilai maksimal = 10, nilai minimal = 1
3. Berapa rentang pada data tersebut ?
Jawab : Rentang = data terbesar-data terkecil.
Rentang = 10 - 1 = 9
4. Berapa peluang terambilnya bangau berwarna coklat?
Jawab: peluang = banyak kejadian / jumlah seluruh data
peluang = 4 / 50 = 2 / 25 = 0,08




