Wednesday, November 23, 2022
Real numbers-Exercise 1.1
Wednesday, October 21, 2009
Real numbers The Fundamental Theorem of Airthmetic
In your earlier classes, you have seen that any natural number can be written as a product of its prime factors. For instance , 2 = 2, 4 =2 x2 , 253, and so on. Now,let us try and look at natural numbers from the other direction. That is, can any natural number be obtained by multiplying prime numbers ? Let us see.
Take any collection of prime numbers , say 2,3,7,11 and 23. If we multiply some or all of these numbers, allowing them to repeat as many times as we wish. We can produce a large collection of positive integers (In fact , infinitely many). Let us list a few.
7x11x23 = 1771 3x7x11x23 = 5313
2x3x7x11x23 = 10626 23 x 3x73= 8232
22 x3x7x11x23 = 21252
And so on.
Now, let us suppose your collection of primes includes all the possible primes. What is your guess about the size of this collection? Does it contain only a finite number of integers, or infinitely many ? Infact, there are infinitely many primes. So, if we combine all these primes in all possible products of primes. The question is – can we produce all the composite numbers this way ? What do you think ? Do you think that there may be a composite number which is not the product of powers of primes ? Before we answer this, let us factorise positive integers, that is, do the opposite of what we have done so far.
We are going to use the factor tree with which you are all familiar. Let us take some large number , say 32760 and factorise it as shown :
So we have factorised 32760 as 2 x2x 2x3x3x5x7 x13 as a product of primes ie, 32760 = 23 x32 x5 x 7 x 13 as a product of powers of primes. Let us try another number , say , 123456789. This can be written as 32 x 3803 x 3607 . Of course, you have to check that 3803 and 3607 are primes. (Try it out for several other natural numbers yourself.) This leads us to a conjecture that every composite number can be written as the product of powers of primes. In fact, this statement is true, and is called the Fundamental Theorem of Airthemetic because of its basic crucial importance to the study of integers. Let us now formally state this theorem.
Wednesday, October 7, 2009
Real numbers- Example 4
Solution : this can be done by trial and error. But to do it systematically , we find HCF (420,130) . Then this number will give the maximum number of barfis in each stack and the number of stacks will then be the least. The area of the tray that is used up will be the least.
Now, let us use Euclid’s algorithm to find their HCF : We have :
420 = 130 x 3 + 30
130 =30x 4 +10
30 = 10 x 3 + 0
So, the HCF of 420 and 130 is 10.
Therefore, the sweetseller can make stacks of 10 for both kinds of barfis.
Wednesday, September 23, 2009
Real numbers- Example 2
Solution : Let a be any positive integer and b = 2. Then , by Euclid’s algorithm, a = 2q +r, for some integer q 0, and r =0 or r= 1, because 0r<2. So a= 2q or 2q +1.
If a is of the form 2q, then a ids an even integer . Also, a positive integer can be either even or odd. Therefore, any positive odd integer I sof the form 2q +1.
Thursday, September 10, 2009
Real Numbers -Introduction
In Class IX, you began your exploration of the world of real nubers and encountered irrational numbers. We continue our discussion on real numbers in this chapter . We begin with two very important properties of positive integers in Sections 1.2 and 1.3, namely the Euclid’s division algorithm and the Fundamental Theorem of Airthemetic.
Euclid’s division algorithm , as the name suggests , has to do with divisibility of integers. Stated simply , it says any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Many of you probably recognize this as the usual long division process. Although this result is quite easy to state and understand , it has many applications related to the divisibility properities of integers. We touch upon a few of them, and use it mainly to compute the HCF of two positive integers.
The fundamental Theorem of Airthemetic , on the other hand has to do something with multiplication of positive integers. You already know that every composite number can be expressed as a product of primes in a unique way. This important fact is the Fundamental Theorem of Airthemetic . Again, while it is a result that is easy to state and understand, it has some very deep and significant applications in the field of mathematics. We use the Fundamental Theorem of Airthemetic for two main applications. First, we use it prove the irrationality of many of the nubers you studied in Class IX, such as , and . Second , we apply this theorem to explore when exactly the decimal expansion of a rational number , say p/q (q0), is terminating and when it is non-terminating repeating. We do so by looking at the prime factorization of the denominator q of p/q. You will see that the prime factorization of q will completely reveal the nature of the decimal expansion of p/q. So let us begin our exploration.
Monday, September 7, 2009
Real numbers - Example 1
Solution :
Step 1 : Since 12576 > 4052, we apply the division lemma to 12576 and 4052, to get
12576 + 4052 x 3 + 420
Step 2 : Since the remainder 420 0, we apply the division lemma to 4052 and 420, to get
4052 = 420 x9 + 272
Step 3 : We consider the new divisor 420 and the new remainder 272, and apply the division lemma to get
420 = 272 x 1 + 148
We consider the new divisor 272 and the new remainder 148, and apply the division lemma to get
272 = 148 x 1 + 124
We consider the new divisor 148 and the new remainder 124, and apply the division lemma to get
148 = 124 x 1 + 24
We consider the new divisor 124 and the new remainder 24, and apply the division lemma to get
124 = 24 x 5 + 4
We consider the new divisor 24 and the new remainder 4, and apply the division lemma to get
24 = 4 x6 +0
The remainder has now become zero,, so our procedure stops. Since the divisor at this stage is 4, the HCF of 12576 and 4052 is 4.
Notice that 4 = HCF (24,4) = HCF (124,24) = HCF (148, 124) = HCF (272 ,148) = HCF (420, 272) = HCF (4052, 420) = HCF (12576 , 4052).
Euclid’s division algorithem is not only useful for calculating the HCF of very large numbers, but also because it is one of the earliest examples of an algorithm that a computer has been programmed to carry out.
Remarks :
1. Euclid’s division lemma and algorithm are so closely interlinked that people often call former as the division algorithm also.
2. Although Euclid’s Division Algorithm is stated for only positive integers, it can be extended for all integers except zero i.e, b0. However , we shall not discuss this aspect here.
Sunday, September 7, 2008
Geometric Construction
In antiquity, geometric constructions of figures and lengths were restricted to the use of only a straightedge and compass (or in Plato's case, a compass only; a technique now called a Mascheroni construction). Although the term "ruler" is sometimes used instead of "straightedge," the Greek prescription prohibited markings that could be used to make measurements. Furthermore, the "compass" could not even be used to mark off distances by setting it and then "walking" it along, so the compass had to be considered to automatically collapse when not in the process of drawing a circle.
Because of the prominent place Greek geometric constructions held in Euclid's Elements, these constructions are sometimes also known as Euclidean constructions. Such constructions lay at the heart of the geometric problems of antiquity of circle squaring, cube duplication, and angle trisection. The Greeks were unable to solve these problems, but it was not until hundreds of years later that the problems were proved to be actually impossible under the limitations imposed. In 1796, Gauss proved that the number of sides of constructible polygons had to be of a certain form involving Fermat primes, corresponding to the so-called Trigonometry Angles.
Although constructions for the regular triangle, square, pentagon, and their derivatives had been given by Euclid, constructions based on the Fermat primes =17" border="0" width="30" height="14"> were unknown to the ancients. The first explicit construction of a heptadecagon (17-gon) was given by Erchinger in about 1800. Richelot and Schwendenwein found constructions for the 257-gon in 1832, and Hermes spent 10 years on the construction of the 65537-gon at Göttingen around 1900 (Coxeter 1969). Constructions for the equilateral triangle and square are trivial (top figures below). Elegant constructions for the pentagon and heptadecagon are due to Richmond (1893) (bottom figures below).
Given a point, a circle may be constructed of any desired radius, and a diameter drawn through the center. Call the center , and the right end of the diameter
. The diameter perpendicular to the original diameter may be constructed by finding the perpendicular bisector. Call the upper endpoint of this perpendicular diameter
. For the pentagon, find the midpoint of
and call it
. Draw
, and bisect
, calling the intersection point with
. Draw
parallel to
, and the first two points of the pentagon are
and
. The construction for the heptadecagon is more complicated, but can be accomplished in 17 relatively simple steps. The construction problem has now been automated (Bishop 1978).
Simple algebraic operations such as ,
,
(for
a rational number),
,
, and
can be performed using geometric constructions (Bold 1982, Courant and Robbins 1996). Other more complicated constructions, such as the solution of Apollonius' problem and the construction of inverse points can also accomplished.
One of the simplest geometric constructions is the construction of a bisector of a line segment, illustrated above.
| | |
| | |
The Greeks were very adept at constructing polygons, but it took the genius of Gauss to mathematically determine which constructions were possible and which were not. As a result, Gauss determined that a series of polygons (the smallest of which has 17 sides; the heptadecagon) had constructions unknown to the Greeks. Gauss showed that the constructible polygons (several of which are illustrated above) were closely related to numbers called the Fermat primes.
Wernick (1982) gave a list of 139 sets of three located points from which a triangle was to be constructed. Of Wernick's original list of 139 problems, 20 had not yet been solved as of 1996 (Meyers 1996).
It is possible to construct rational numbers and Euclidean numbers using a straightedge and compass construction. In general, the term for a number that can be constructed using a compass and straightedge is a constructible number. Some irrational numbers, but no transcendental numbers, can be constructed.
It turns out that all constructions possible with a compass and straightedge can be done with a compass alone, as long as a line is considered constructed when its two endpoints are located. The reverse is also true, since Jacob Steiner showed that all constructions possible with straightedge and compass can be done using only a straightedge, as long as a fixed circle and its center (or two intersecting circles without their centers, or three nonintersecting circles) have been drawn beforehand. Such a construction is known as a Steiner construction.
Geometrography is a quantitative measure of the simplicity of a geometric construction. It reduces geometric constructions to five types of operations, and seeks to reduce the total number of operations (called the "simplicity") needed to effect a geometric construction.
Dixon (1991, pp. 34-51) gives approximate constructions for some figures (the heptagon and nonagon) and lengths (pi) which cannot be rigorously constructed. Ramanujan (1913-1914) and Olds (1963) give geometric constructions for . Gardner (1966, pp. 92-93) gives a geometric construction for
Kochanski's approximate construction for yields Kochanski's approximation
Steinhaus (1999, p. 143). Constructions for are approximate (but inexact) forms of circle squaring.