This document provides an overview of modular arithmetic and its applications. It begins with definitions of modular equivalence and congruence classes. Applications discussed include hashing to store records efficiently, generating pseudorandom numbers, and calculating ISBN numbers and Easter dates. The Chinese Remainder Theorem and solving linear congruences are also covered. The document concludes with a method for performing arithmetic on large integers using modular arithmetic.
A Proof of Hypothesis Riemann and it is proven that apply only for equation ζ(z)=0.Also here it turns out that it does not apply in General Case.(DOI:10.13140/RG.2.2.10888.34563/5)
The 1741 Goldbach [1] made his most famous contribution to mathematics with the conjecture that all even numbers can be expressed as the sum of the two primes (currently Conjecture) referred to as “all even numbers greater than 2 can be expressed as the sum-two primes” (DOI:10.13140/RG.2.2.32893.69600/1)
Abstract: The Riemann zeta function is one of the most Leonhard Euler important and fascinating functions in mathematics. Analyzing the matter of conjecture of Riemann divide our analysis in the zeta function and in the proof of conjecture, which has consequences on the distribution of prime numbers.
A Proof of Hypothesis Riemann and it is proven that apply only for equation ζ(z)=0.Also here it turns out that it does not apply in General Case.(DOI:10.13140/RG.2.2.10888.34563/5)
The 1741 Goldbach [1] made his most famous contribution to mathematics with the conjecture that all even numbers can be expressed as the sum of the two primes (currently Conjecture) referred to as “all even numbers greater than 2 can be expressed as the sum-two primes” (DOI:10.13140/RG.2.2.32893.69600/1)
Abstract: The Riemann zeta function is one of the most Leonhard Euler important and fascinating functions in mathematics. Analyzing the matter of conjecture of Riemann divide our analysis in the zeta function and in the proof of conjecture, which has consequences on the distribution of prime numbers.
The Euler-Mascheroni constant is calculated by three novel representations over these sets respectively: 1) Turán moments, 2) coefficients of Jensen polynomials for the Taylor series of the Riemann Xi function at s = 1/2 + i.t and 3) even coefficients of the Riemann Xi function around s = 1/2.
It turns out that an equation x^p+y^q=z^w has a solution in Z+ if and only if at least one exponent p or q or w equals 2.DOI:10.13140/RG.2.2.15459.22567/7
formulation of first order linear and nonlinear 2nd order differential equationMahaswari Jogia
• Equations which are composed of an unknown function and its derivatives are called differential equations.
• Differential equations play a fundamental role in engineering because many physical phenomena are best formulated mathematically in terms of their rate of change.
• When a function involves one dependent variable, the equation is called an ordinary differential equation (ODE).
• A partial differential equation (PDE) involves two or more independent variables.
Figure 1: CHARACTERIZATION OF DIFFERENTIAL EQUATION
FIRST ORDER DIFFERENTIAL EQUATION:
FIRST ORDER LINEAR AND NON LINEAR EQUATION:
A first order equation includes a first derivative as its highest derivative.
- Linear 1st order ODE:
Where P and Q are functions of x.
TYPES OF LINEAR DIFFERENTIAL EQUATION:
1. Separable Variable
2. Homogeneous Equation
3. Exact Equation
4. Linear Equation
i. SEPARABLE VARIABLE:
The first-order differential equation:
Is called separable provided that f(x,y) can be written as the product of a function of x and a function of y.
Suppose we can write the above equation as
We then say we have “separated” the variables. By taking h(y) to the LHS, the equation becomes:
Integrating, we get the solution as:
Where c is an arbitrary constant.
EXAMPLE 1.
Consider the DE :
Separating the variables, we get
Integrating we get the solution as:
The Euler-Mascheroni constant is calculated by three novel representations over these sets respectively: 1) Turán moments, 2) coefficients of Jensen polynomials for the Taylor series of the Riemann Xi function at s = 1/2 + i.t and 3) even coefficients of the Riemann Xi function around s = 1/2.
It turns out that an equation x^p+y^q=z^w has a solution in Z+ if and only if at least one exponent p or q or w equals 2.DOI:10.13140/RG.2.2.15459.22567/7
formulation of first order linear and nonlinear 2nd order differential equationMahaswari Jogia
• Equations which are composed of an unknown function and its derivatives are called differential equations.
• Differential equations play a fundamental role in engineering because many physical phenomena are best formulated mathematically in terms of their rate of change.
• When a function involves one dependent variable, the equation is called an ordinary differential equation (ODE).
• A partial differential equation (PDE) involves two or more independent variables.
Figure 1: CHARACTERIZATION OF DIFFERENTIAL EQUATION
FIRST ORDER DIFFERENTIAL EQUATION:
FIRST ORDER LINEAR AND NON LINEAR EQUATION:
A first order equation includes a first derivative as its highest derivative.
- Linear 1st order ODE:
Where P and Q are functions of x.
TYPES OF LINEAR DIFFERENTIAL EQUATION:
1. Separable Variable
2. Homogeneous Equation
3. Exact Equation
4. Linear Equation
i. SEPARABLE VARIABLE:
The first-order differential equation:
Is called separable provided that f(x,y) can be written as the product of a function of x and a function of y.
Suppose we can write the above equation as
We then say we have “separated” the variables. By taking h(y) to the LHS, the equation becomes:
Integrating, we get the solution as:
Where c is an arbitrary constant.
EXAMPLE 1.
Consider the DE :
Separating the variables, we get
Integrating we get the solution as:
I am Bella A. I am a Statistical Method In Economics Assignment Expert at economicshomeworkhelper.com/. I hold a Ph.D. in Economics. I have been helping students with their homework for the past 9 years. I solve assignments related to Economics Assignment.
Visit economicshomeworkhelper.com/ or email info@economicshomeworkhelper.com.
You can also call on +1 678 648 4277 for any assistance with Statistical Method In Economics Assignments.
We make use of the conformal compactification of Minkowski spacetime M# to explore a way of describing general, nonlinear Maxwell fields with conformal symmetry. We distinguish the inverse Minkowski spacetime [M#]−1 obtained via conformal inversion, so as to discuss a doubled compactified spacetime on which Maxwell fields may be defined. Identifying M# with the projective light cone in (4+2)-dimensional spacetime, we write two independent conformal-invariant functionals of the 6-dimensional Maxwellian field strength tensors - one bilinear, the other trilinear in the field strengths -- which are to enter general nonlinear constitutive equations. We also make some remarks regarding the dimensional reduction procedure as we consider its generalization from linear to general nonlinear theories.
Exact Matrix Completion via Convex Optimization Slide (PPT)Joonyoung Yi
Slide of the paper "Exact Matrix Completion via Convex Optimization" of Emmanuel J. Candès and Benjamin Recht. We presented this slide in KAIST CS592 Class, April 2018.
- Code: https://github.com/JoonyoungYi/MCCO-numpy
- Abstract of the paper: We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys
𝑚≥𝐶𝑛1.2𝑟log𝑛
for some positive numerical constant C, then with very high probability, most n×n matrices of rank r can be perfectly recovered by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold for arbitrary rectangular matrices as well. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information.
Published in association with the Utilitas Mathematica Academy. Offers selected original research in Pure and Applied Mathematics and Statistics. It enjoys a good reputation and popularity at the international level in terms of research papers and distribution worldwide.
https://utilitasmathematica.com/index.php/Index
Our Journal We believe that by embracing a wide range of backgrounds and viewpoints, we enrich the statistical discourse and enhance the quality and relevance of our research. Our commitment to inclusivity extends beyond the content of our publications.
https://utilitasmathematica.com/index.php/Index
Our Journal has a profession of statistics can only thrive when justice, equity, diversity, and inclusion are not just ideals but integral components of our ethos. We recognize that a diverse and inclusive community sparks creativity, innovation, and a richness of perspectives that is indispensable for advancing statistical knowledge.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
1. Modular Arithmetic
Victor Adamchik
Fall of 2005
Plan
1. Review
2. Applications of Modular Arithmetic
3. Solving Linear Congruences
4. Chinese Remainder Theorem
5. Arithmetic with Large Integers
Review
Definition. a mod n means the remainder when a is divided by n
a q n r
Definition. (modulo equivalence)
a b mod n if and only if n a b
We will say that a and b are equivalent modulo n. We will also write modulo equivalence as
a n b
Theorem. n is an equivalence relation on the integers.
An equivalence class consists of those integers which have the same remainder on division by n.
The equivalence classes are also known as congruence classes modulo n. Rather than say the
integers a and b are equivalent we say that they are congruent modulo n.
Definition.The set of all integers congruent to a modulo n is called the residue class a .
Example. Residue classes mod 3:
V. Adamchik 1
2. [0]={...,-6,-3,0,3,6,...}
[1]={...,-5,-2,1,4,7,...}
[2]={...,-4,-1,2,5,8,...}
Definition. The set of residue classes is denoted by Zn
Zn 0, 1, 2, ..., n 1
Theorem (arithmetic on Zn) When we are doing +, - or * modulo n, we can replace a number by
another number in the same residue class.
Example. Compute
414 * 463 mod 413
1 * 50 = 50
Note (cancelation property). Though it seems that arithmetic on Zn is the same as on Z, do not be
deceived. The product of two non-zero elements of Zn can sometimes be 0.
Question. Is the following implication correct?
x a n x b a n b
Only if GCD x, n 1.
Proof.
x a n x b n x a x b n x a b n a b a n b
Definition.
Zn x Zn GCD x, n 1
Example.
Z0 0, 1, 2, 3, 4, 5
Z6 1, 5
V. Adamchik 21-127: Concepts of Mathematics
3. Advantage of Zn is that it has a cancelation property.
Definition. Euler's phi function (or totient function) is the size of Zn
n Zn
n is the number of integers 1 k n coprime to n.
Example.
12 1, 5, 7, 11 4
It's easy to see that if p is prime then p p 1. More on this function later.
Note. A number's multiplicative inverse x 1 defined by
x x 1
1
is another difference between Zn and Z. In Z only two elements have inverses: 1 and -1. We have
proved that if p is prime then each element in Zp has an inverse. We say that Zp is a finite field. a
set in which we can , , , . The prove is based on the following theorem
Theorem (Ferma's little theorem) If p is prime and p a, then
ap 1
p 1
According to this theorem, the inverse is defined by (assuming p is prime)
a 1 ap 2
Applications of Modular Arithmetic
Problem 1. How do we efficiently store people's records?
If we use Social Security number as the key, we will have to deal with an array of size 1010
.
The solution - hashing. Store records in the table at index h k defined by
h k k mod N
Here, h is a hash function, and N is an array size. Regardless of chosen N, collisions might happen
h k1 h k2
V. Adamchik 3
4. You will deal with collisions in 15-211.
Problem 2. How do we generate a random number?
There is nothing random about random() or rand() function. The standard technique is to create a
pseudorandom sequence. The most commonly used procedure for generating pseudorandom num-
bers is the linear congruential method (Lehmer, 1949). We generate a sequence of pseudorandom
numbers xk, by successively using the congruence
xn 1 a xn b mod m , n 0
x0 m is the seed
with appropriate values of 0 a m, 0 b m, m 0 and GCD b, m 1
For example,
xn 1 7 xn 4 mod 9 , n 0
x0 3
This generates the following sequence
x1 7 x0 4 7 3 4 25 7 mod 9
x2 7 x1 4 7 7 4 53 8 mod 9
x3 7 x2 4 7 8 4 60 6 mod 9
and so on
This recurrence is eventually periodic. So, it is desirable to use a recurence with the long period.
Problem 3. ISBN numbers for published books.
The ISBN number for our textbook is 0-13-184-868-2.
The information is decoded in the first 9 digits. The last digit is for parity check
1 a1 2 a2 ... 9 a9 a10 mod 11
Applying this to our textbook
1 0 2 1 3 3 4 1 5 8 6 4 7 8 8 6 9 8 255 2 mod 11
V. Adamchik 21-127: Concepts of Mathematics
5. The sum of 9 digits is 255 and it equals to the last digit mod 11.
Problem 4. The Gauss' Easter formula.
The church set the Easter on first Sunday after the first full moon in spring. The Easter sunday
always moves in the period of 22nd March until 25th April. F. Gauss developed the exact formula
to calculate the date of Easter. Here is its short version
a year mod 11
b year mod 4
c year mod 7
d 19 a M mod 30
e 2 b 4 c 6 d N mod 7
where constants M and N are
M 24
N 5
valid throughout the period between 1900 and 2099 years. Then Easter falls on 22 d e March
or d e 9 April.
year 2006;
a Mod year, 19 ; b Mod year, 4 ; c Mod year, 7 ;
M 24; n 5; 1900 2099
d Mod 19 a M, 30 ;
e Mod 2 b 4 c 6 d n, 7 ;
22 d e march , d e 9 april
47, 16
In 2006 the catholic church will celebrate Easter on April 16. Dates are according the Gregorian
calendar.
Here i sthe full version of the algorithm (see http://www.smart.net/~mmontes/nature1876.html), published
in Nature, 1876 April 20, vol. 13, p. 487.
V. Adamchik 5
6. year 2006;
a Mod year, 19 ;
b IntegerPart year 100 ;
c Mod year, 100 ;
d IntegerPart b 4 ;
e Mod b, 4 ;
f IntegerPart b 8 25 ;
g IntegerPart b f 1 3 ;
h Mod 19 a b d g 15, 30 ;
i IntegerPart c 4 ;
k Mod c, 4 ;
l Mod 32 2 e 2 i h k, 7 ;
m IntegerPart a 11 h 22 l 451 ;
EasterMonth IntegerPart h l 7 m 114 31 ; 3 March,4 April
p Mod h l 7 m 114, 31 ;
EasterDate p 1;
EasterDate, EasterMonth
16, 4
Solving Linear Congruences.
Definition. A relation of the form
a x b mod n
is called a linear congruence. We will also write this as
a x n b
How many solutions does it have? It's clear that if x0 is a solution then every element from a congru-
ent class is also a solution.
Example.
x 3 mod 4
Here are solutions
..., 1, 3, 7, 10, ...
Therefore, uniqueness can only be mod n.
x 3 4 k, where k Z
V. Adamchik 21-127: Concepts of Mathematics
7. Example.
2 x 2 mod 4
The congruence is satisfied for two representatives
x 1 and x 3
Therefore, the equations has two solutions
x 1 4 k and x 3 4 k, where k Z
Theorem. The linear congruence
a x b mod n
has a unique solution iff GCD a, n 1.
Proof. )
First we prove that the equation has a solution. To solve the equation means to find the inverse of a
x b a 1
mod n
But as we know the inverse is not necessarely exists in Zn. Therefore, some restrictions required. In
the next paragraph we show how to find an inverse using the Extended Euclidean Algorithm.
Given GCD a, n 1, it follows by the EEA that s, r Z
a r n s 1
Consider this equation mod n
a r 1 mod n
This means that r is the multiplicative inverse of a
r a 1
mod n
Therefore, the solution is
V. Adamchik 7
8. x b r mod n
Next, we prove uniqueness. We assume that there are two solutions X and Y.
a X b mod n
a Y b mod n
a X a Y mod n
n a X Y n X Y X Y mod n
The proof in ) direction is left as an exercise.
QED.
Chinese Remainder Theorem.
Suppose we want to solve a system of linear congruences
x 2 mod 3
x 3 mod 5
x 2 mod 7
Does a solution exist? Is it unique?
Let us build a solution. We solve the first equation x 2 mod 3
y1 2 mod 3
assuming that the solution is 0 modulo 5 and 7
y1 0 mod 5
y1 0 mod 7
The straightforward answer is defined by
5 7 z 2 mod 3
Therefore,
z 1 y1 35
V. Adamchik 21-127: Concepts of Mathematics
9. Next we solve the second equation x 3 mod 5 , again assuming that the solution is 0 modulo 3
and 7.
3 7 z 3 mod 5
It follows
z 3 y2 63
In the same manner, solving the last equation x 2 mod 7 yields
3 5 z 2 mod 7
z 2 y3 30
What is the general solution?
y1 y2 y3 35 63 30 128
Clearly, this is the solution modulo 3*5*7
x 128 mod 105
In the parameteric form
x 23 105 k, k Z
Thereom. (Chinese Remainder Theorem) Let m1, m2, ..., mn Z be pairwise relatively prime.
The system
x ak mod mk , k 1, 2, ..., n
has a unique solution modulo M m1 m2 ... mn.
Proof.
First we prove that the system has a solution. Proceeding as in the above example, we define
solution to each equation as
yk ak mod mk
yk 0 mod mj , k j
Combining them together yeilds the equation
V. Adamchik 9
10. M
mk
z ak mod mk
which definitely has a solution (why-?) with respect to z. Thus
yk
M
mk
z
Next we define the general solution by
y1 y2 ... yn
Clearly this is a solution to a given system by modulo M.
Uniqueness.
Suppose there are two solutions, say X, and Y. Then we would have
X mk
Y for all k
Therefore, they are the same modulo M
X M Y
Arithmetic with Large Integers
Problem. Compute 7! without ever encountering a number larger than 28
.
First, we find moduli mk relatively prime and m1 m2 ... mn 7
We choose 13, 11, 9 and 7.
Next we do all computations using these moduli
2 5 10, 10, 1, 3
3 4 12, 1, 3, 5
5 120, 10, 3, 15 3, 10, 3, 1
6 18, 60, 18, 6 5, 5, 0, 6
7 35, 35, 0, 42 9, 2, 0, 0
V. Adamchik 21-127: Concepts of Mathematics
11. The last step we recover 7! by applying the CRT
x 9 mod 13
x 2 mod 11
x 0 mod 9
x 0 mod 7
We find such a number x that 0 x 13 11 9 7.
Note. Solving the above system, you should not generate numbers bigger then 28.
Here we outline another method of solving the system of congruences. We denote the list of mod-
uli and the list of remainders by
m 13, 11, 9, 7
r 9, 2, 0, 0
respectively. On the first step, we find the inverses of each modulo with respect to each later mod-
ulo in the list. This can be done by the extended Euclidean algorithm (see the proof of the theorem
for solving linear congruence.)
13 1
6 mod 11, 13 1
7 mod 9, 13 1
6 mod 7
11 1
5 mod 9, 11 1
2 mod 7
9 1
4 mod 7
Let us denote the list of inverse (padded with zeros om the left) by
inv = {{0, 6, 7, 6}, {0, 0, 5, 2}, {0, 0, 0, 4}};
Then
invj,k mj 1 mod mk
Next, starting with a given list of remainders we do
V. Adamchik 11
12. for(j = 1, j < n, j++,
for(k = j+1, k <= n, k++,
r[k] = (r[k]-r[j])*inv[j][k]) % m[k];
]]
Finally, the solution is built up by
x
k 1
R
remk
j 1
k 1
mk
One can check that 0 x M m1 m2 ..., mn. In case of four moduli the solution is
x r1 m1 v1 m1 m2 v2 m1 m2 m3 v3 mod M
where
v1 r2 r1 inv1,2 mod m2
v2 r3 r1 inv1,3 v1 inv2,3 mod m3
v3 r4 r1 inv1,4 v1 inv2,4 v2 inv3,4 mod m4
To verify that this is indeed a solution, we compute x mod mk, k 1, 2, 3, 4. Obviously
x r1 mod m1
since the each term of x is divible by m1 except the first one. Next, we compute x mod m2 . Apply-
ing mod m2, we obtain
x r1 m1 v1 mod m2
Replacing v1
x r1 r2 r1 m1 inv1,2 mod m2
and using
m1 inv1,2 1 mod m2
yeilds
V. Adamchik 21-127: Concepts of Mathematics
13. x r2 mod m2
In the same manner we prove other two cases.
Here is the Mathematica code
n 4;
m 13, 11, 9, 7 ;
rem 9, 2, 0, 0 ;
inv 0, 6, 7, 6 , 0, 0, 5, 2 , 0, 0, 0, 4 ;
For j 1, j n, j ,
For k j 1, k n, k ,
rem k Mod rem k rem j inv j, k , m k
;
Sum rem k Product m j , j, 1, k 1 ,
k, 1, n
5040
Generally, choosing the following five relatively prime numbers as moduli
235
1, 234
1, 233
1, 229
1, 223
1
we can add and multiply positive integers up to the size of 2154
M
k 1
5
mk 2154
Compare this with the size of the largest integer 232 1 on a 32-bit CPU.
V. Adamchik 13