• Journal of Educational Research in Mathematics
• /
• v.25 no.4
• /
• pp.499-524
• /
• 2015

In the present study, we propose four participating $8^{th}$ grade students' genetic decomposition of congruent transformation and investigate the role of their dragging activities while understanding the concept of congruent transformation in GSP(Geometer's Sketchpad). The students began to use two major schema, 'single-point movement' and 'identification of transformation' simultaneously in their transformation activities, but they were inclined to rely on the single-point movement schema when dealing with relatively difficult tasks. Through dragging activities, they could expand the domain and range of transformation to every point on a plane, not confined to relevant geometric figures. Dragging activities also helped the students recognize the role of a vector, a center of rotation, and an axis of symmetry.

• Journal for History of Mathematics
• /
• v.31 no.6
• /
• pp.315-337
• /
• 2018

Pythagorean thoerem exists in several equivalent forms in the Euclidean plane, that is, the Hilbert plane which in addition satisfies the parallel axiom. In this article, we investigate the truthness and mutual relationships of those propositions in various non-Hilbert planes which satisfy the parallel axiom and all the Hilbert axioms except the SAS axiom.

• School Mathematics
• /
• v.9 no.4
• /
• pp.523-533
• /
• 2007

This article focused the meaning of Pythagoras' and Euclid's proof about the Pythagorean theorem in a historical and mathematical perspective. Pythagoras' proof using similarity is based on the arithmetic assumption about commensurability. However, Euclid proved the Pythagorean theorem again only using the concept of dissection-rearrangement that is purely geometric so that it does not need commensurability. Pythagoras' and Euclid's different approaches to geometry have to do with Birkhoff's axiom system and Hilbert's axiom system in the school geometry Birkhoff proposed the new axioms for plane geometry accepting real number that is strictly defined. Thus Birkhoff's metrical approach can be defined as a Pythagorean approach that developed geometry based on number. On the other hand, Hilbert succeeded Euclid who had pursued pure geometry that did not depend on number. The difference between the proof using similarity and dissection-rearrangement is related to the unsolved problem in the geometry curriculum that is conflict of Euclid's conventional synthetical approach and modern mathematical approach to geometry.

• Journal for History of Mathematics
• /
• v.30 no.5
• /
• pp.261-287
• /
• 2017

De Zolt's axiom which is a precise formulation of Euclid's Common Notion 5, "the whole is greater than the part", for the notion of 'content' holds in any Hilbert plane. In this article, we study the history of de Zolt's axiom which has its origin in Euclid's Common Notions, and introduce an example of a plane geometry in which de Zolt's axiom does not hold. We show that there is no area function in this geometry and every square is equidecomposable with a square which is properly contained in the first one. From this we also show that there are two equidecomposable rectangles which have the same base and do not have the same altitude, and there is a rectangle which is equicomplementable with an emptyset.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.107-112
• /
• 2011

It is very difficult to factorize composite number, $n=pq$ to integer factorization, p and q that is almost similar length of digits. Integer factorization algorithms, for the most part, find ($a,b$) that is congruence of squares ($a^2{\equiv}b^2$ (mod $n$)) with using factoring(factor base, B) and get the result, $p=GCD(a-b,n)$, $q=GCD(a+b,n)$ with taking the greatest common divisor of Euclid based on the formula $a^2-b^2=(a-b)(a+b)$. The efficiency of these algorithms hangs on finding ($a,b$) and deciding factor base, B. This paper proposes a efficient algorithm. The proposed algorithm extracts B from integer factorization with 3 digits prime numbers of $n+1$ and decides f, the combination of B. And then it obtains $x$(this is, $a=fxy$, $\sqrt{n}$ < $a$ < $\sqrt{2n}$) from integer factorization of $n-2$ and gets $y=\frac{a}{fx}$, $y_1$={1,3,7,9}. Our algorithm is much more effective in comparison with the conventional Fermat algorithm that sequentially finds $\sqrt{n}$ < $a$.

• Journal of Service Research and Studies
• /
• v.5 no.2
• /
• pp.71-81
• /
• 2015

The RSA public key encryption algorithm, a few, key generation, factoring, the Euler function, key setup, a joint expression law, the application process are serial indexes. The foundation of such algorithms are mathematical principles. The first concept from mathematics principle is applied from how to obtain a minority. It is to obtain a product of two very large prime numbers, but readily tracking station the original two prime number, the product are used in a very hard principles. If a very large prime numbers p and q to obtain, then the product is the two $n=p{\times}q$ easy station, a method for tracking the number of p and q from n synthesis and it is substantially impossible. The RSA encryption algorithm, the number of digits in order to implement the inverse calculation is difficult mathematical one-way function and uses the integer factorization problem of a large amount. Factoring the concept of the calculation of the mod is difficult to use in addition to the problem in the reverse direction. But the interests of the encryption algorithm implementation usually are focused on introducing the film the first time you use encryption algorithm but we have to know how to go through some process applied to the field work This study presents a field force applied encryption process scheme based on public key algorithms attribute diagnosis.