ANOTHER INTEGER NUMBER ALGORITHM TO SOLVE LINEAR EQUATIONS (USING CONGRUENCY)

Similar documents
10.2 Series. , we get. which is called an infinite series ( or just a series) and is denoted, for short, by the symbol. i i n

Chapter Linear Regression

University of Pavia, Pavia, Italy. North Andover MA 01845, USA

SOLVING SYSTEMS OF EQUATIONS, DIRECT METHODS

The Geometric Proof of the Hecke Conjecture

ECONOMETRIC ANALYSIS ON EFFICIENCY OF ESTIMATOR ABSTRACT

= y and Normed Linear Spaces

Describes techniques to fit curves (curve fitting) to discrete data to obtain intermediate estimates.

Professor Wei Zhu. 1. Sampling from the Normal Population

Chapter 17. Least Square Regression

Distribution of Geometrically Weighted Sum of Bernoulli Random Variables

5 - Determinants. r r. r r. r r. r s r = + det det det

3. REVIEW OF PROPERTIES OF EIGENVALUES AND EIGENVECTORS

such that for 1 From the definition of the k-fibonacci numbers, the firsts of them are presented in Table 1. Table 1: First k-fibonacci numbers F 1

SOME REMARKS ON HORIZONTAL, SLANT, PARABOLIC AND POLYNOMIAL ASYMPTOTE

Multiple Choice Test. Chapter Adequacy of Models for Regression

Lecture 10: Condensed matter systems

Linear Open Loop Systems

Journal of Engineering and Natural Sciences Mühendislik ve Fen Bilimleri Dergisi SOME PROPERTIES CONCERNING THE HYPERSURFACES OF A WEYL SPACE

Harmonic Curvatures in Lorentzian Space

Chapter 2 Intro to Math Techniques for Quantum Mechanics

MTH 146 Class 7 Notes

Exponential Generating Functions - J. T. Butler

( m is the length of columns of A ) spanned by the columns of A : . Select those columns of B that contain a pivot; say those are Bi

2.Decision Theory of Dependence

The z-transform. LTI System description. Prof. Siripong Potisuk

CONSTRUCTION OF REGULAR QUASI CYCLIC-LOW DENSITY PARITY CHECK CODES FROM CYCLIC CODES

Minimum Hyper-Wiener Index of Molecular Graph and Some Results on Szeged Related Index

Phys 2310 Fri. Oct. 23, 2017 Today s Topics. Begin Chapter 6: More on Geometric Optics Reading for Next Time

Quasi-Rational Canonical Forms of a Matrix over a Number Field

XII. Addition of many identical spins

E-Companion: Mathematical Proofs

Lattice planes. Lattice planes are usually specified by giving their Miller indices in parentheses: (h,k,l)

Certain Expansion Formulae Involving a Basic Analogue of Fox s H-Function

Chapter 2: Descriptive Statistics

On EPr Bimatrices II. ON EP BIMATRICES A1 A Hence x. is said to be EP if it satisfies the condition ABx

Maximum likelihood estimate of phylogeny. BIOL 495S/ CS 490B/ MATH 490B/ STAT 490B Introduction to Bioinformatics April 24, 2002

Chapter Gauss-Seidel Method

Chapter #2 EEE State Space Analysis and Controller Design

Chapter Unary Matrix Operations

PROGRESSION AND SERIES

CURVE FITTING LEAST SQUARES METHOD

Sequences and summations

Math 4318 : Real Analysis II Mid-Term Exam 1 14 February 2013

Introduction to mathematical Statistics

NONDIFFERENTIABLE MATHEMATICAL PROGRAMS. OPTIMALITY AND HIGHER-ORDER DUALITY RESULTS

BINOMIAL THEOREM SOLUTION. 1. (D) n. = (C 0 + C 1 x +C 2 x C n x n ) (1+ x+ x 2 +.)

ASYMPTOTICS OF THE GENERALIZED STATISTICS FOR TESTING THE HYPOTHESIS UNDER RANDOM CENSORING

Spectral Continuity: (p, r) - Α P And (p, k) - Q

On Eigenvalues of Nonlinear Operator Pencils with Many Parameters

Bond Additive Modeling 5. Mathematical Properties of the Variable Sum Exdeg Index

Area and the Definite Integral. Area under Curve. The Partition. y f (x) We want to find the area under f (x) on [ a, b ]

Optimality of Strategies for Collapsing Expanded Random Variables In a Simple Random Sample Ed Stanek

Chapter #5 EEE Control Systems

RECAPITULATION & CONDITIONAL PROBABILITY. Number of favourable events n E Total number of elementary events n S

6.6 The Marquardt Algorithm

ROOT-LOCUS ANALYSIS. Lecture 11: Root Locus Plot. Consider a general feedback control system with a variable gain K. Y ( s ) ( ) K

UNIT V: Z-TRANSFORMS AND DIFFERENCE EQUATIONS. Dr. V. Valliammal Department of Applied Mathematics Sri Venkateswara College of Engineering

Simple Linear Regression Analysis

Born-Oppenheimer Approximation. Kaito Takahashi

Complete Classification of BKM Lie Superalgebras Possessing Strictly Imaginary Property

Semiconductors materials

A Technique for Constructing Odd-order Magic Squares Using Basic Latin Squares

defined on a domain can be expanded into the Taylor series around a point a except a singular point. Also, f( z)

PROGRESSIONS AND SERIES

Summary: Binomial Expansion...! r. where

Difference Sets of Null Density Subsets of

On The Circulant K Fibonacci Matrices

Linear Approximating to Integer Addition

The Mathematical Appendix

Moments of Generalized Order Statistics from a General Class of Distributions

CBSE , ˆj. cos CBSE_2015_SET-1. SECTION A 1. Given that a 2iˆ ˆj. We need to find. 3. Consider the vector equation of the plane.

SGN Audio and Speech Processing. Linear Prediction

Collapsing to Sample and Remainder Means. Ed Stanek. In order to collapse the expanded random variables to weighted sample and remainder

Chapter 7. Kleene s Theorem. 7.1 Kleene s Theorem. The following theorem is the most important and fundamental result in the theory of FA s:

2. Elementary Linear Algebra Problems

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

Technical Appendix for Inventory Management for an Assembly System with Product or Component Returns, DeCroix and Zipkin, Management Science 2005.

Chapter 2 Intro to Math Techniques for Quantum Mechanics

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences

Transmuted Generalized Lindley Distribution

Chapter #2 EEE Subsea Control and Communication Systems

Trace of Positive Integer Power of Adjacency Matrix

Consumer theory. A. The preference ordering B. The feasible set C. The consumption decision. A. The preference ordering. Consumption bundle

Advanced Algorithmic Problem Solving Le 3 Arithmetic. Fredrik Heintz Dept of Computer and Information Science Linköping University

Module 2: Introduction to Numerical Analysis

In Calculus I you learned an approximation method using a Riemann sum. Recall that the Riemann sum is

Intuitionistic Fuzzy Stability of n-dimensional Cubic Functional Equation: Direct and Fixed Point Methods

CS473-Algorithms I. Lecture 12b. Dynamic Tables. CS 473 Lecture X 1

Ch 3.4 Binomial Coefficients. Pascal's Identit y and Triangle. Chapter 3.2 & 3.4. South China University of Technology

Greatest term (numerically) in the expansion of (1 + x) Method 1 Let T

Detection and Estimation Theory

VECTOR MECHANICS FOR ENGINEERS: Vector Mechanics for Engineers: Dynamics. In the current chapter, you will study the motion of systems of particles.

Fredholm Type Integral Equations with Aleph-Function. and General Polynomials

Mu Sequences/Series Solutions National Convention 2014

Permutations that Decompose in Cycles of Length 2 and are Given by Monomials

We show that every analytic function can be expanded into a power series, called the Taylor series of the function.

REVIEW OF SIMPLE LINEAR REGRESSION SIMPLE LINEAR REGRESSION

EXERCISE - 01 CHECK YOUR GRASP

The Pigeonhole Principle 3.4 Binomial Coefficients

Transcription:

ANOTHER INTEGER NUMBER ALGORITHM TO SOLVE LINEAR EQUATIONS (USING CONGRUENCY) Floet Smdche, Ph D Aocte Pofeo Ch of Deptmet of Mth & Scece Uvety of New Mexco 2 College Rod Gllup, NM 873, USA E-ml: md@um.edu I th ecto peeted ew tege umbe lgothm fo le equto. Th lgothm moe pd th W. Sepk peeted [] the ee tht t eche the geel oluto fte mlle umbe of teto. It coecte wll be thooughly demotted. INTEGER NUMBER ALGORITHM TO SOLVE LINEAR EQUATIONS Let u code the equto (); (the ce,b,, educed to the ce () by educg to the me deomto d elmtg the deomto). Let d (,..., ). If d b the the equto doe ot hve tege oluto, whle f d b the equto h tege oluto (ccodg to well-kow theoem fom the umbe theoy). If the equto h oluto d d we dvde the equto by d. The d (we do ot mke y etcto f we code the mxml co-dvo potve). Alo, () If ll the equto tvl; t h the geel tege oluto k,,, whe b (the oly ce whe the geel oluto -tme udetemed) d doe ot hve oluto wheb. (b) If, uch tht the the geel tege oluto : k b d x k,,..., \ The poof of th eto w gve [4]. All thee ce e tvl, theefoe we wll leve them de. The followg lgothm c be wtte: Iput A le equto: (2) b,,b,,,, wth ot ll d (,..., ).

Output The geel oluto of the equto Method. h :, p : 2. Clculte m, (mod ), d deteme d the p, (, ) fo whch th mmum c be obted (whe thee e moe poblte we hve to chooe oe of them). 3. If go to tep 4. If, the x : t x b h x : th x b (A) Subttute the vlue thu detemed of thee ukow ll the ttemet (p), p,2,... (f poble). (B) Fom the lt elto ( p) obted the lgothm ubttute ll elto: p, p 2,...,() (C) Evey ttemet, ttg ode fom p me pocedue (B): the p hould be ppled the 2,...,(3) epectvely. (D) Wte the vlue of the ukow,,, fom the tl equto (wtg the coepodg tege umbe pmete fom the ght tem of thee ukow wth k,...,k ), STOP. 4. Wte the ttemet (p) : x t h 5. Ag x : t h h : h : p : p The othe coeffcet d vble em uchged go bck to tep 2. The Coecte of the Algothm Let u code le equto (2). Ude thee codto, the followg popete ext: 2

Lemm. The et M, (mod ), < h mmum. Obvouly M * d M fte becue the equto h fte umbe of coeffcet:, d codeg ll the poble combto of thee, by two, thee the mxmum AR 2 (ged wth epetto) = 2 elemet. Let u how, by educto d budum, tht M Ø. M Ø (mod ),,. Hece (mod ),,. O th poble oly whe,,,, whch equvlet to (,.., ),,. But (,.., ) e etcto fom the umpto. It follow tht,,, fct whch cotdct the othe etcto of the umpto. M d fte, t follow tht M h mmum. The Lemm 2. If m M, the,,., We ume coveely, tht, uch tht.,. Let p, p, uch tht p d m p ot dvded by. Thee coeffcet the equto, whch the mmum d the coeffcet e ot equl mog themelve (coveely, t would me tht (,.., ) whch gt the hypothe d, g, of the coeffcet whoe bolute vlue gete tht ot ll c be dvded by (coveely, t would mlly eult (,.., ). We wte p / q (tege poto), d p q. We hve p (mod ) d. Thu, we hve foud whch cotdct the defto of mmum gve to. Thu,,. Lemm 3. If m M fo the p of dce (, ), the: 3

x t k b h x th k b x k Z,,..., \, the geel tege oluto of equto (2). Let x e x e, e,, be ptcul tege oluto of equto (2). The k x tht: d,,..., \, d t h x x x x x b x x x x x b x x k x,,..., \,. (becue M ) uch Lemm 4. Let d, be the p of dce fo whch th mmum c be obted. Ag, let code the ytem of le equto: (3) t x x b h t x x h The x e x e, e, ptcul tege oluto fo (2) f d oly f x e x e, e,..., \ d t h t h the ptcul tege oluto of (3). x e x e, e, ptcul oluto fo (2) f d oly f 4

x b x x x x b e e e h t x x b d t h x e,..., \ d t h t h ptcul tege oluto fo (3). x e x e, Lemm 5. The pevou lgothm fte. Whe the lgothm top t tep 3. We wll dcu the ce whe. Accodg to the defto of, *. We wll how tht the ow of uccevely obted by followg the lgothm evel tme deceg wth cycle, d ech cycle ot equl to the pevou, by. Let be the ft obted by followg the lgothm oe tme. the go to tep 4, d the tep 5. Accodg to lemm 2,,,. Now we hll follow the lgothm ecod tme, but th tme fo equto whch (ccodg to tep 5) ubttuted by. Ag, ccodg to lemm 2, the ew wtte 2 wll hve the popety: 2. We wll get to becue d, d f, followg the lgothm oce g we get epetto. d o o. Hece, the lgothm h fte umbe of Theoem of Coecte. The pevou lgothm clculte the geel oluto of the le equto coectly (2). Accodg to lemm 5 the lgothm fte. Fom lemm t follow tht the et M h mmum, hece tep 2 of the lgothm h meg. Whe t w how lemm 3 tht tep 3 of the lgothm clculte the geel tege oluto of the epectve equto coectly the equto tht ppe t tep 3). I lemm 4 t how tht f the ubttuto tep 4 d 5 toduced the tl equto, the geel tege oluto em uchged. Tht, we p fom the tl equto to le ytem hvg the me geel oluto the tl equto. The vble h coute of the ewly toduced vble, whch e ued to uccevely decompoe the ytem ytem of two le equto. The vble p coute of the ubttuto of vble (the elto, t gve momet betwee cet vble). Whe the tl equto w decompoed to, we hd to poceed the evee wy,.e. to compoe t geel tege oluto. Th evee wy dected by the ub-tep 3(A), 3(B) d 3(C). The ub-tep 3(D) h oly ethetc ole,.e., to hve the geel oluto ude the fom: f (k,...,k ), 5

,, f beg le fucto wth tege umbe of coeffcet. Th f poble how tht ubttuto e ot lwy poble. But whe they e we mut mke ll poble ubttuto. Note. The pevou lgothm c be ely toduced to compute pogm. Note 2. The pevou lgothm moe pd th tht of W. Sepk [],.e., the geel tege oluto eched fte mlle umbe of teto (o, t let, the me) fo y le equto (2). I the ft plce, both method m t obtg the coeffcet fo t let oe ukow vble. Whle Sepk tted oly by chce, decompog the getet coeffcet the module (wtg t ude the fom of um betwee multple of the followg mlle coeffcet ( the module) d the et), ou lgothm th decompoto ot ccdetl but lwy eek the mllet d lo chooe the coeffcet d fo whch th mmum cheved. Tht, we tet fom the begg the hotet wy to the geel tege oluto. Sepk doe ot ttempt to fd the hotet wy; he kow tht h method wll tke hm to the geel tege oluto of the equto d ot teeted how log t wll tke. Howeve, whe lgothm toduced to compute pogm t pefeble tht the poce tme hould be hot poble. Exmple. Let u olve 3 the equto 7x 7y z 2. We pply the fome lgothm.. h, p 2. 3, 3, 2 3. 3 go o to tep 4. 3 4. () y t 7 z t z 5. Ag y : t h : 2 3 : 3 p: 2 wth the othe coeffcet d vble emg uchged, go bck to tep 2. 2.,, 3 3. x ( 3t 2 ( 7t ) 2) 3t 2 7t 2 z 7t 2 ( 7t ) 7 ( ) 3 7 ( 2) 7t 2 42t 72 3 6

(A) We ubttute the vlue of x d z thu detemed to the oly ttemet (p) we hve: () y t z 7t2 43t 72 (B) The ubttuto ot poble. (C) The ubttuto ot poble. (D) The geel tege oluto of the equto : x 3k 7k 2 2 y 7k 43k 2 72 z 7k 42k 2 72; k,k 2 REFERENCES: [] Sepk, W, - Ce ştm ş ce u ştm depe umeele pme? - Edtu Stţfcă, Buchet, 966. [2] Cegă, I., Czcu, C., Mhuţ, P., Opţ, Gh., Co Rehe Itoducee î teo umeelo, Ed. Dd. ş Ped., Buchet, 965. [3] Popovc, C. P. Atmetc ş teo umeelo, Ed. Dd. ş Ped., Buchet, 963. [4] Smdche, Floet U lgotm de ezolve î umee îteg ecuţlo le. 7