ABSTRACT

Basic concepts of number theory, related definitions, Ramanujan numbers, and

indications of Ramanujan note books, and applications of the number theory are discus in first
chapter.
The second chapter explained is clearly shown that there cannot exist whichever number
can be expressed as addition of two numbers both are in power form of equal even exponents
greater than two in two or more ways. The least number is 1729, and the characteristic of a
number to produce such type of Ramanujan relation.

In this document discus here the 3rd section different order of n is n x n matrix containing
integers, that each row and column adds up to the same values in such a way. Define Eigen
values and rows and column dot products of third order magic squares with use some of the
properties.
Now discus the fourth chapter, “The smallest number expressed the sum of two cubes at
the different ways”. The number is called Taxicab(2)=1729=93+103=13+123, Taxicab(n) being
the smallest number expressible in n ways as a sum of two cubes and it can generalize the
problem by difference of cubes, Cabtaxi(n) is the smallest number expressible in n ways as a
sum or difference of two cubes.

The fifth chapter is discus reveals that studying Euler’s Diophantine equation
a2+b2=c2+d2 it turns out that work anticipate deep structures and phenomena which have become
fundamental objects in arithmetic geometry and number theory. In discover a k3 surface with
Picard number 18, can be use to obtain infinitely many cubic twists over Q with rank ≥2.

1
 CHAPTER - 1

1.1 Introduction

Number theory is an older usage; a branch of arithmetic pure mathematics devoted

primarily to the study of the integers. The foundational place in the discipline it is called “The
Queen of Mathematics”.

Number theorists study “prime number” as well as the properties of objects made out of
integers. (E.g) Rational numbers or defined as generalizations of the integers (e.g) Algebraic
integer.

Can be considered the Integer whichever in themselves or as the equations of solution

(Diophantine geometry). Questions in number theory are frequently best understood through the
study of analytical objects (e.g, The Riemann zeta function) that encode properties of the
integers, primes or other number-theoretic objects in some fashion (analytic number theory).
Also study, the real numbers are relation to relation numbers, (e.g) as approximated by the latter
(Diophantine approximation).

For the arithmetic number theory is an older term., it had been superseded by “number
theory” on 20th century. [The word “arithmetic “is used by the general public to mean
“elementary calculation”, it has also acquired other meanings in mathematical logic, as in Peano
arithmetic, and computer science, as in floating point arithmetic]. The second half of the 20th
century regained for number theory use of the term arithmetic. Arguably in part due to French
influence. In particular, arithmetical was preferred as an adjective to number-theoretic.

Traditionally, number theory is the branch of mathematics concerned with the properties
of integers and many of its open problems are easily understood even by non-mathematicians.
Normally, the field has come to be concerned with a wider class of problems that arise obviously
from the study of integers. Number theory may be subdivided into several fields according to the
methods used and the questions investigated.

2
 Transcendental number theory is a branch of number theory that investigates
transcendental numbers, in both qualitative and quantitative ways.

The fundamental theorem of algebra tell us that if have a non-zero polynomial with
integer coefficients then that polynomial will have a root in the complex numbers. Any
polynomial p with integer coefficients there will be a complex number a p (a) =0.

Generally, the theory deals with algebraic independence of numbers. A set of number
{a1,a2,…..an} is called algebraically independent over a field k if there is no non-zero polynomial
P in n variables with coefficients in k such that p(a1,a2,…..an)=0.

A related but broader notion than “algebraic” is whether there is a closed-form expression
for a number, including exponentials and logarithms as well as algebraic operations. There are
various definitions of “closed-form”, and questions about closed-form can often be reduced to
questions and transcendence.

Algebraic number theory is a branch of number theory that uses the techniques of abstract
algebra to study the integer, rational numbers, and their generalizations. Number-theoretic
questions are expressed in terms of properties of algebraic objects such as algebraic number field
and their ring of integer, finite fields, and function fields.

Analytic number theory can be split up into two major parts, divided more by the type of
problems they attempt to solve than fundamental differences in technique.

(i) Multiplicative number theory deals with the distribution of the prime
numbers, such as estimating the number of primes in an interval, and includes the
prime number theorem and Dirichlet’s theorem on primes in arithmetic
progressions.
(ii) Additive number theory is concerned with additive structure of the
integers, such as Goldbach’s conjecture that every even number greater than 2 is
the sum of two primes.
In number theory, the specialty additive number theory studies subsets of integer and
their behavior under addition. The field of “Additive number theory” includes the study of

3
 abelian groups and commutative semi groups with an operation of addition. Additive number
theory has the geometry of numbers.

1.2 Literature Survey

Debajit Das[6] a number is capable of ideal ramanujan multi-relation producing fully

dependent on the factors. A square integer at least two cases will produce R- multi relations.

Christian Boyer[10] the smallest number expressible as a sum of two cubes in two
different ways, in Taxicab & Cabtaxi. A history of the two problems in Fermat, gives new upper
bounds.

Critian S.Calude,[4] Elena Calude, Michael J.Dinneen Taxicab(k,j,n)is the smallest

number which can be expressed as the sum of j, kth powers in n different ways. This number is
challenging and interesting both from mathematical and programming of view.

C.K.Neeradha, Dr.V.MAdhukar Mallayya[21] a magic square is a numbersthe row,

columns, diagonals and co-diogonal add up to the same number. The sum of the entries of the
sub-square taken without any gaps between the rows or columns is also the magic constant.

Ken ono and sarah Trebat- Leder[11] writing reveals that he had been studing Euler’s
Diophantine equation a3+b3=c3+d3. He discovered a k3 surface with picard number 18, can used
infinitely many cubic twists over Q with rank k≥2.

Deo Brat Ojhe, Kaul.B.L[5] order n is n x n matrix containing integer that each row &
column add same value. 4 x 4 matrix with the help of a special knowledge of a algebra and
another branch of mathematics. The reader can easily extract that there is requirement of
knowledge of algebra, number and its properties and many different branches of mathematics for
magic squares.

4
 Sreeranjini K.S, V.Madhukar Mallaya[7] Dot product of 3rd order magic squares of row
& column, and Eigen values some of properties. Hindu tradition assigns them to god Siva and
they treated it as ‘Bhadra Ganita’. Cornelius Agrippa of China is believed to be the first to take
up construction of magic square. They were associated with the heavenly bodies-Sun, Moon,
Mars, Mercury, Jupiter, Venus, and Saturn, Methodologicl construction of magic squares based
on certain mathematical principles was taken up in France in the 7th century A.D.

Meenu Sahni and D.B.Ojha [22] 8 x 8 matrix containing integer and addition result same
of each row and column with help of new platform to generate key and encrypt the data using
order.

Oliver Couto [20] is numerical solutions are available but are not equale to twice a 5th
power as required Euler’s conjecture to contend with help us paramatize them.

Saleem sh.A1-Ashhab[8] says it is possible to add constraints like the value of the
determinant. The counting of sami pandiagonal magic squares is also another step on the way to
calculate the number of magic square 6 x 6. We present the property preserving transformations.
The enumeration is based on parallel computing.

Lokenath Debnath[1] A brief account Ramanujan life, career, And remarkable

mathematical contributions is given to gifted talented of Srinivasan Ramanujan. That partitions
of the numbers and applications of statistical numbers in mathematics.

Jonathan Sondow John W.Nicholoson & Tony D.Noe[2] the nth Ramanujan prime is the
smallest positive integer Rn such that if x ≥ Rn, then the interval (1/2x, x] contains at least ‘n’
prime. We “sharpen Laishram’s theorem” that Rn ˂ p3n by proving that the maximum of Rn/p3n is
R5/p15 = 41/47. We give statistics on the length of the longest run of Ramanujan primes among
all primes p˂10n, for n≤9. An appendix explains Noe’s fast algorithm for computing R1, R2…..
Rn.

5
 Matthew Curtis and Gurudeo Anand Tularam[14] The prime number is exceptionally
essential the plane of concentration in mathematics of students. By younger stars well thought-
out is not an area of the most important number. A quantity of interesting aspects in the study of
prime number theory studies can be well thought-out important and impending mathematicians.

1.3 Basic concept of number theory:

In number theory, the prime number theory describes the asymptotic distribution of the
prime numbers. The prime number theorem gives a rough description of how the primes are
distributed.
The Prime Number Theorem (PNT) states that if randomly select a number
nearby some large number N, the chance of it being primes is about 1/In(N), here In(N) denotes
the natural logarithm of N.
For example, near N=10,000, about one in nine numbers is prime, whereas near
N=1,000,000,000, only one in every 21 numbers is prime.

A natural number is a number that occurs commonly and obviously in nature. As such, it
is a whole, non-negative number. The set of natural numbers are denoted by N. Study the
relationships between different sorts of number. We have separated the natural number in to a
variety of different types. Here familiar and not-so-familiar example:

Odd : 1, 2, 3, 4, 5…..
Even : 2, 4, 6, 8………
Square : 1, 4, 9, 16…….
Cube ` : 1, 8, 27, 64………
Prime : 2, 3, 5, 7, 11, 13…..
Composite : 4, 6, 8, 9, 10…….
1(mod4) : 1, 5, 9, 13, 17, 21……
3(mod4) : 3, 7, 11, 15, 19, 23, 27….
Triangular : 1, 3, 6, 10, 15…..
Perfect : 6, 28, 496…….
Fibonacci : 1, 1, 2, 3, 5, 8, 13, 21……

6
 A number is said to be congruent to 1(mod4) if it leaves a remainder of 1 when divided
by 4, and similarly, 3(mod4) numbers.

The Fibonacci numbers are created by starting with 1 and 1. Then to get the next number
is the list, just add the previous two.

A perfect number is the addition of all its divisors, other than itself, adds Bach up to the
original number.

The number dividing 6 are 1, 2 & 3.

1+2+3=6

Similarly,
The divisors of 28 are 1, 2, 4, 7 & 14.
1+2+4+7+14=28

Number Shapes:

The square numbers are the numbers 1, 4, 9, 16…. That can be arranged in the shape of a
square.
The triangular numbers are the numbers 1, 3, 6, 10….. That can be arranged in the shape
of a triangle.

Triangular Numbers

(1+2=3) (1+2+3=6) (1+2+3+4=10)

* * *
* * * * * *
* * * * * *
* * * *

7
Square Number

22 = 4 32 = 9 42 = 16

* * * * * * * * *
* * * * * * * * *
* * * * * * *
* * * *

The following formula is helpful:

1+2+3+………+ (n-1) +n=n (n+1)/2

Integers are the building blocks of the theory of number we proceed to define the concept
of divisibility and the division algorithm.

Division

Given two integers, say and, the quotient b/a may or may not be an integer (e.g., 16/4=4
but 12/5= 2.4). Number theory concerns the former case, and discovers criteria upon which
one can decide about divisibility of two integers.
More formally, for a≠0
That divides if there is another integer such that b=ka and write a|b .
For example,
Let us establish the following lemma.

Lemma:
If a|b and a|c , then a|(b+c) .

Proof:
From the definition of divisibility and the hypotheses that there are integers and
such that b=ta, c=sa

8
 Hence
b+c =a(s+t)
Since, s+t is an integer, prove that a | (b + c)

Divisibility

Let a, b ϵ z. That a divides b (equivalently, ‘a’ is a divisor of b (or) b is divisible by a, or

‘a’ is a factor of b) if there exist c ϵ z such that b=ac. Write alb if a divides b and alb if a dose
not divides b.

Properties:

i. Transitivity
Let a, b, c ϵ z, if a|b & b|c then a|c.

ii. Linear Combination

Let a, b, c ϵ z. If a|b & a|c then a|bn+cm for any n, m ϵ z.
In particular,
if a|b & a|c, then a|b+c & a|b-c.

iii. Size of Divisors

Let a, b ϵ z, with b≠0. If a|b, then |a|≤|b|. In particular any positive divisor ‘a’ of a
positive integer b must fail in the interval 1 ≤ a ≤ b.

iv. Divisibility and Ratios

Let a, b ϵ z with a≠0. Then a|b holds if and only if b/a ϵ z.

Example,

The number 12987 is divisible by 13 because

13|12987 ˂=˃13|1298- 63˂=˃13|1235˂=˃13|123-45˂=˃13|78 and 13*6=78.

9
The Greatest Common Divisor

Let a, b ϵ z with ‘a’ and ‘b’ not both 0.The greatest common divisor of ‘a’ & ’b’, denoted
by gcd(a, b), or simply (a, b), is defined as the largest among the common divisor of ‘a’ & ‘b’.

(a, b) = gcd (a, b) =max {d: d|a and d|b}.

Properties:

Let a, b ϵ z, with a & b not both 0

(a, b) = (-a, b) = (a, -b) = (-a, -b)

(a, b) = (a+bn , b) = (a, b+am) for any n, m ϵ z
(ma, mb) = m(a, b) for any m ϵ N
If d = (a, b), then (a/d, b/d) = 1

Let d ϵ N. Then d| (a, b), holds if and only if d|a & d|b.

The Least Common Multiply

Let a, b ϵ z, with ‘a’ & ‘b’ both non zero. The least common multiply of a & b, denoted
by [a, b], is defined as the smallest positive integer that is divisible by both a & b;

[a, b] = min {m ϵ N; a|m & b|m}.

Properties:

Let a, b be nonzero integers.

[a, b] = m[-a, b] = [a, -b] = [-a, -b]

[ma, mb] = m [a, b] for any m ϵ N.
[a, b] = |ab|/[a, b]

Let m ϵ N. Then [a, b] |m holds if and only if a|m & b|m.

Modular Arithmetic
Definition:

10
 If ‘a’ & ‘b’ are integers and m is a positive integer, then ‘a’ is congruent to b
modulo m if m divides a-b. Use the notation a ≡ b (mod m) if this is the case, and a non
congruent b (mod m).

Congruence:

Let a, b ϵ z and m ϵ N. That ‘a’ is congruent to ‘b’ mod m, and write a ≡ b mod m, if m|a-
b. The integer m is called the modulus of the congruence.

Primes & Composite Number:

Let n ϵ N with n ˃ 1. Then n is called a prime if its only positive is 1 & n; it is called
composite otherwise. Equivalently, n is composite if it can be written in the form n = ab with
a, b ϵ z and 1 ˂ a ˂ n and n is prime otherwise.

Twins Ramanujan Primes:

If pn+2 = pn+1, then pn and pn+1 are twin prime; the [2] smallest are 3 and 5. If Rn+2=Rn+1,
then Rn and Rn+1 are twin Ramanujan primes, the smallest are 149 and 151.

Given prime p and q ˃ p, a necessary condition for them to be twin Ramanujan prime is
evidently that,
𝜋(p) – π(1/2p) + 1 = π(q) – π(1/2q).
The prime numbers occupy very prominent role in number theory. A prime number p is
an integer greater than that is divisible only by 1 and itself. A number that is not primes is called
composite.

Definitions of Ramanujan Number:

The n-th Ramanujan prime Rn is the smallest integer such that for any x ≥ Rn, at least n
primes are in (x/2, x].

C – Ramanujan Primes:

For c ϵ (0, 1), the nth c –Ramanujan prime Rc,n is the smallest integer such that for any
x≥ Rc,n, at least n primes are in (cx, x].

11
Different System of Ramanujan Number:

Ramanujan’s number: 1729

Cardinal : One thousand seven hundred twenty- nine
Ordinal : 1729th
Factorization : 7*13*19
Divisors : 1, 7, 13, 19, 91, 133, 247, 1729.
Roman numeral: MDCCXXIX
Binary : 110110000012
Ternary : 21010012
Quaternary : 1230014
Quinary : 234045
Senary : 120016
Octal : 33018

The natural number is 1729, the following 1728 and preceding 1730.
“Masahiko Fujiwara” showed that 1729 is one of the four positive which, when its digits
are added together, produces a sum which, when multiplied by its reversal, yields the original
number,

1+7+2+9 = 19
19 * 91 = 1729
It suffices only to check sums congruent to 0 (or) 1 (mod 9) up to 19.

The Cube Number of 1728:

Ramanujan worked comprehensively with numbers. The perfect cube was 1728.

The number is slightly greater than 1000, where 1000=103 from which realize that,

113=1331 and, 123=1728

Found the calculate value is following,

12
 1728 = (122)12
= (144)12
= (100+10+10+10+10+4)12
= 1200+4(120) +4(12)
= 1200+480+48

From you straightforwardly find that

1729 = 123+13

By using Pascal’s Triangle it is simply shown that

(123)+13 = (10+2)3+13
= 1000+728+1
= 103+93
So, 1729=123+13 =103+93
Significance of the Ramanujan Number:

The smallest natural number 1729 that can be written in two different ways as the sum of
two cubes of natural number,

1729 = 103+93=123+13

The quotation is sometimes expressed using the term “positive cubes”. Since, allowing
negative perfect cubes given the smallest solution as 91

91 = 63+ (-5)3 = 43+33

Numbers that are the smallest number that can be expressed as the sum of two cubes in n
distinct ways have been dubbed “taxicab numbers”.

The same expression defines 1729 as the first in the sequence of “Fermat near misses”
defined as numbers of the form 1+z3 which are also expressible as the sum of two other cubes.
Of course, equating smallest with most negative as opposed to “closest to zero” given rise to
solution like -91, -189, -1729 and further negative number.

13
 This ambiguity is eliminated by the term “positive cubes”. It is also incidentally product
3 prime number,

7*13*19 = 1729

The largest know similar number is;

885623890831 = 75113+77303
= 87593+59783
= 3943*14737*15241

Explanation with Formula Based:

We know that,
(a + b) 3 = a3+3ab (a + b) +b3

Let,

4104 = 163+23 = 153+93

Now to find cube of 4104, taking whole cube of both side as

(163+23) = (153+93)

Here

Putting, a=16, b=2

(a + b) 3 = a3+3ab (a + b) +b3
(163+23)3 = 163+3(16) (2) (16+2) + 23
69122916864 = 69122916864

So,
41043 = 69122916864

Similarly,
13832 = 23+243 = 183+203

14
 Find cube of 138323 taking whole cube of both side as;
(23+243)3 = (183+203)3
2646396666368 = 2646396666368

So,
(13832)3=2646396666368

The name of this particular number:

There are various manifestations of the taxicab numbers,

1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728.
110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656,
and 314496, 320264, 327763, 373464, 402597, 439101, 443889, 513000,513856.

1.4 Indication of Ramanujan Notebooks

Ramanujan notebooks were compiled approximately in the years 1903-1914, prior to his
departure for England. After Ramanujan’s death in 1920, many mathematicians, including
G.H.Hardy, strongly urged that Ramanujan’s notebooks be edited and published.

In fact, original plans called for the publishing [15] of the notebooks along with
Ramanujan’s Collected papers in 1927, but financial considerations prevented this. In 1929,
G.N.Watson and B.M.Wilson began the editing of the notebooks, but the task was never
completed. Finally, in 1957 an unedited Photostat edition of Ramanujan’s notebooks was
published.

This volume is the first of three volumes devoted to the editing of Ramanujan’s
notebooks. Many of the results found herein are very well known, but many are new. Some
results are rather easy to prove, but others are established only with great difficulty.

A glance at the contents indicates a wide diversity of topics examined by Ramanujan.

Our goal has been to prove each of Ramanujan’s theorems. However, for results that are known,
we generally refer to the literature where proofs may be found.

15
 The second of four volumes devoted to the editing of Ramanujan’s notebooks. Part I,
Published in 1985, contains an account of chapters 1-9 in the second notebook as well as a
description of Ramanujan’s quarterly reports. Ramanujan’s second notebook chapter 10-15

Chapters 10-15 are among the most interesting notebooks. We hope readers will strive to
discover Ramanujan’s thoughts and further develop his beautiful ideas.

Ramanujan’s second notebook part-II published in 1989 of chapters 10-15. Part IV and V
will contain accounts of the 100pages of unorganized material at the end of the second notebook,
the 33 pages of unorganized results comprising the third notebook, and those results in the first
notebook not recorded by Ramanujan in the second or third notebooks.

Ramanujan part-III, published in 1991, provides an account of chapters 16-21 in the

second notebook. Part IV published in 1994, the first four volumes, either proof are provided for
claims not previously established in the literature.

Dr.Lucy Slater had recommended to him that there were materials deposited there from
the estate of the G.N.Watson that might be of interest to him. In one box of materials from
Watson’s estate, Andrews found several items written by Ramanujan.

The most fascinating items being a document wrote on 138 sides in Ramanujan’s
characteristics handwriting. The sheets contained over 600 formulas without proofs. Although
technically not a notebook, and although technically not “lost”, as we shall in the sequel, it was
natural in view of the fame of Ramanujan’s notebooks to call this manuscript, Ramanujan’s lost
notebook.

Almost certainly, this manuscript, or at least most of it, was written during the last year of
Ramanujan’s life, after his return to Indian from England.

The manuscript contains no introduction or covering letter. In fact, there are hardly any
words in the manuscript. There are a few marks evidently made by cataloguer, and there are also
a few remarks in the handwriting of Hardy.

16
1.5 Applications of Ramanujan Number

The prime numbers are exceptional and are well thought-out [14] to have a line of
unpredictability on the subject of them so it is conventional that the great consideration they take
delivery of creates opportunities for genuine life applications. There are at this moment
assortments of applications of prime theorems that comprise factual life significations of prime
numbers. It uses prime numbers and the approximately impracticable occupation of factorizing
outstandingly outsized numbers to encrypt. At the same time as is to hodgepodge significant in
sequence for whichever supplementary then the proposed beneficiary. Prime numbers are used to
continue imperative in sequence out of harm's way which reveals immediately how imperative
an application it is.

A meandering application of prime numbers was revealed and used by musical group all
the way through narration. A Superlative substance produce of the prime numbers to gives their
music a sense of self-determination beginning the regulations foremost long-established
composition.

An additional authentic life application can be seen from personality itself. There are
convinced insects whose exceptionally lives turn around the use of prime numbers. Prime
numbers do not work together with every one supplementary extraordinarily repeatedly. These
two prime numbers only work together with all additional, explicitly, 13*17=221. A
uncomplicated arithmetic respond to illustration of this is 6 and 4 which are combination
numbers. 6 and 4 work together much in advance than their prearranged 6*4=24 as they both
interrelate at 12.

Prime numbers are no longer chained to with the sole purpose mathematical science.
There has been use of prime numbers surrounded by hypothetical physics to make an effort and
manufacture a speculation that ties simultaneously prime numbers with quantum pandemonium
assumption. It would give the impression that in cooperation mathematicians and physicists are
operational simultaneously to make available a supplementary appreciative of how our creation
is governed and are responsibility it all the way through then be of assistance of prime numbers.

17
 A motivating monetary encouragement for supplementary application of prime numbers
is the recompense for the investigated for the prevalent prime numbers. At the same time as this
is not a undeviating application onto the authentic world for prime numbers it unquestionably
opens the door for a outsized provoked interview into the learning of prime numbers.

The partition of a number has a rice history. The problem is given a positive integer ‘n’, a
partition is a way to write it downward as a calculation of positive integer.

Let us make a choice a small number, 7. Then it is comprehensible that there are 15 ways
of doing it.

(7, 6+1, 5+2, 4+3, 3+1+3, 2+1+1+3, 4+1+2, 5+1+1, 3+3+1, 2+2+2+1,
1+1+1+1+1+1+1, 4+1+1+1, 1+1+1+1+3, 2+1+1+1+2, 2+1+1+1+1+1).

For n a positive integer, let p(n) represent the number of unordered partitions of n, that is,
unordered sequences of positive integers which addition to n; then the significance of p(n) is
given asymptotically by

1
p(n) ~ 4n√3 𝑒 𝜏√𝑛/6

Given Diagram,

18
The notation p (n) to represent the number of partition of an integer ‘n’ thus,

p(7)=15.

Similar,

p(30) = 5604 & p(50) = 204226.

A similar search as on for asymptotic formulae for the partition number p (n) and because
of the combinatorial explosion an accurate formula was considered difficult.

19
 CHAPTER: 2

Ramanujan Mysteriousness of the Integer

2.1 Introduction

Let us take N=a3+b3 =c3+d3. Obviously N.p3 = (ap)3+(bp)3=(cp)3+(dp)3. Here, Np3

produces another expression of e3+f3 it has no significance. That is,
N.p3=(ap)3+(bp)3=(cp)3+(dp)3=e3+f3. So, may [6] be said to Ideal Ramanujan Numbers (IRN) are
the two kinds of numbers. Wherever all expressions are free from any familiar factor and other
can be said as simply Ramanujan Number (RN), here common factors of the expressions in
between the elements and at least one expression are free from any common factor.

Power form of the prime factor cannot have an ideal Ramanujan Number. The product of
the m numbers of prime numbers & representatively by IRNm and Ramanujan Numbers are
always produced by p3. Here p is a prime and composite numbers.

The factors involved in Ideal Ramanujan Number analysis by the unit digit. Some
numbers are fails to produce any R-multi relation. Functional form of all Ideal Ramanujan
Number can also be established in three categories.

2.2 Expressed can be N as sum of two cubes in ‘n’ numbers of ways

N=XYZ is a positive composite odd number, It is have at least three prime factors is Rf =
{12(xy)-3z2} gives the result of square integer in ‘n’ numbers of cases considering for all sets of
(x,y,z).

N=xyz = a3+b3
N= (a+b)(a2+b2-ab)
Here, y= a+b => b=y-a

And,
xz = a2+b2-ab
xz = a2+(y-a)2-a(y-a)

20
 = a2+y2+a2-2ya-ay+a2
= 3a2-3ya+y2
0 = 3a2-3ya+y2-xz
−𝑏±√𝑏2 −4𝑎𝑐
a,b = 2𝑎

3𝑦±√9𝑦 2 −12(𝑦 2 −xz)

= 6

3𝑦±√9𝑦 2 −12𝑦 2 +12xz)

= 6

3𝑦±√12xz−3𝑦 2 )
=
6

Clearly, by returning order 12xz-3y2 is odd square integer. Similarly, 12xy-3z2, 12yz-3x2
will be an odd square integer.

Apparently, the form of square integer 9(2k-1)2, Here k=1, 2, 3……

Put, K=1,
9(2 x 1 -1)2 = 9
9(2 x 2 -1)2 = 81
And so on.

2.3 An Ideal R-multi relations of three wings in the given frequent cases

From the following table, by the unit digits are analysis for the accepted and rejected for
the group of Rf.

up, uq, ur uk of Rf Accept/Reject Remarks

2
12(u1)(u3) - 3(u5) = u6 – u5 = u1 Accepted
2
12(u1)(u5) - 3(u3) = u0 – u7 = u3 Rejected Fails to produce multi-
1, 3, 5
2 relation
12(u3)(u5) - 3(u1) = u0 - u3 = u7 Rejected

12(u3)(u5) - 3(u7)2 = u0 – u7 = u3 All Rejected Fails to produce multi-

3, 5, 7
12(u5)(u7) - 3(u3)2 = u0 – u7 = u3 All Rejected relation

21
 12(u7)(u3) - 3(u5)2 = u2 – u5 = u3 All Rejected
2
12(u5)(u7) – 3(u9) = u0 – u3 = u7 Rejected

2
12(u7)(u9) – 3(u5) = u6 – u5 = u1 Accepted Fails to produce multi-
5, 7, 9
2
relation
12(u9)(u5) – 3(u7) = u0 – u7 = u3 Rejected

2
12(u7)(u9) – 3(u1) = u6 – u3 = u3 Rejected
2
12(u9)(u1) – 3(u7) = u8 – u7 = u1 Accepted Can produce a multi-
7, 9, 1
2 relation.
12(u7)(u1) – 3(u9) = u4 – u3 = u1 Accepted
2
12(u7)(u9) – 3(u3) = u6 – u7 = u9 Accepted
2
12(u9)(u3) – 3(u7) = u4 – u7 = u7 Rejected Can produce a multi-
7, 9, 3
2 relation.
12(u7)(u3) – 3(u9) = u2 – u3 = u9 Accepted
2
12(u1)(u5) – 3(u7) = u0 – u7 = u3 Rejected
2
12(u5)(u7) – 3(u1) = u0 – u3 = u7 Rejected Fails to produce multi-
1, 5, 7
2 relation
12(u1)(u7) – 3(u5) = u4 – u5 = u9 Accepted

12(u1)(u9) - 3(u5)2 = u8 – u5 = u3
Fails to produce multi-
1, 9, 5 12(u9)(u5) - 3(u1)2 = u0 – u3 = u7 All are rejected
relation
12(u5)(u1) - 3(u9)2 = u0 – u3 = u7
2
12(u1)(u3) – 3(u9) = u6 – u3 = u3 Rejected
2
12(u3)(u9) – 3(u1) = u4 – u3 = u1 Accepted Can produce a multi-
1, 3, 9
2 relation.
12(u1)(u9) – 3(u3) = u8 – u7 = u1 Accepted
2
12(u1)(u3) – 3(u7) = u6 – u7 = u9 Accepted

22
 1, 3, 7 2 Can produce a multi-
12(u3)(u7) – 3(u1) = u2 – u3 = u9 Accepted
relation.
2
12(u1)(u7) – 3(u3) = u4 – u7 = u7 Rejected
2
12(u3)(u5) – 3(u9) = u0 – u3 = u7 Rejected
2
12(u5)(u9) – 3(u3) = u0 – u7 = u3 Rejected Fails to produce multi-
3, 5, 9
2 relation
12(u3)(u9) – 3(u5) = u4 – u5 = u9 Accepted

Here, u3, and u7 cannot produce a square number.

While one is different and equal two digits unit:

up, uq, ur uk of Rf Accept/Reject Remarks

2
12u1(x)u1(y) – 3{u3(z)} = u5 Accepted
2
12u1(x)u3(z) – 3{u1(y)} = u3 Rejected Fails to produce multi-
1, 1, 3
2 relation
12u1(y)u3(z) – 3{u1(x)} = u3 Rejected

12u1(x)u1(y) – 3{u5(z)}2=u7
Fails to produce multi-
1, 1, 5 12u1(x)u5(z) – 3{u1(y)}2=u7 All rejected
relation
12u1(y)u5(z) – 3{u1(x)} =u72

12u1(x)u1(y) – 3{u7(z)}2=u5

1, 1, 7 12u1(x)u7(z) – 3{u1(y)}2=u1 All accepted Can produce a multi-relation.

12u1(y)u7(z) – 3{u1(x)}2=u1

12u1(x)u1(y) – 3{u9(z)}2=u9

1, 1, 9 12u1(x)u9(z) – 3{u1(y)}2=u5 All accepted Can produce a multi-relation.

12u1(y)u9(z) – 3{u1(x)}2=u5

23
 12u3(x)u3(y) – 3{u1(z)}2=u5

3, 3, 1 12u3(x)u1(z) – 3{u3(y)}2=u9 All accepted Can produce a multi-relation.

12u1(y)u3(x) – 3{u3(x)}2=u9

12u3(x)u3(y) – 3{u5(z)}2=u3
Fails to produce multi-
3, 3, 5 12u3(x)u5(z) – 3{u3(y)}2=u3 All rejected
relation
12u7(x)u3(z) – 3{u5(x)}2=u3

12u1(x)u1(y) – 3{u7(z)}2=u1

3, 3, 7 12u3(x)u7(z) – 3{u5(y)}2=u7 All accepted Can produce a multi-relation.

12u7(y)u3(z) – 3{u3(x)}2=u5
2
12u3(x)u3(y) – 3{u9(z)} = u5 Accepted
2
12u3(x)u9(z) – 3{u3(y)} = u7 Rejected Fails to produce multi-
3, 3, 9
2 relation
12u3(y)u9(z) – 3{u3(x)} = u7 Rejected
2
12u5(x)u5(y) – 3{u1(z)} = u7 Rejected
2
12u5(x)u1(z) – 3{u5(y)} = u5 Accepted
5, 5, 1 Can produce a multi-relation.
2
12u5(y)u1(z) – 3{u5(x)} = u5 Accepted
2
12u5(x)u5(y) – 3{u3(z)} = u3 Rejected
2
5, 5, 3 12u5(x)u3(z) – 3{u5(y)} = u5 Accepted
Can produce a multi-relation.
2
12u5(y)u3(z) – 3{u5(x)} = u5 Accepted
2
12u5(x)u5(y) – 3{u7(z)} = u3 Rejected

5, 5, 7 2
12u5(x)u7(z) – 3{u5(y)} = u5 Accepted Can produce a multi-relation.

24
 2
12u5(y)u7(z) – 3{u5(x)} = u5 Accepted
2
12u5(x)u5(y) – 3{u9(z)} = u7 Rejected
2
12u5(x)u9(z) – 3{u5(y)} = u5 Accepted
5, 5, 9 Can produce a multi-relation.
2
12u5(y)u9(z) – 3{u5(x)} = u5 Accepted
2
12u7(x)u7(y) – 3{u1(z)} = u5 Accepted
2
12u7(x)u1(z) – 3{u5(y)} = u7 Rejected Fails to produce multi-
7, 7, 1
2 relation
12u7(y)u1(z) – 3{u7(x)} = u7 Rejected

12u7(x)u7(y) – 3{u3(z)}2=u1

7, 7, 3 12u7(x)u3(z) – 3{u7(y)}2=u5 All accepted Can produce a multi-relation.

12u3(y)u7(z) – 3{u7(x)}2=u5

12u7(x)u7(y) – 3{u5(z)}2=u3
Fails to produce multi-
7, 7, 5 12u7(x)u5(z) – 3{u7(y)}2=u3 All rejected
relation
12u5(y)u7(z) – 3{u7(z)}2=u3

12u7(x)u7(y) – 3{u9(z)}2=u5

7, 7, 9 12u7(x)u9(z) – 3{u7(y)}2=u7 All accepted Can produce a multi-relation.

12u9(y)u7(z) – 3{u7(x)}2=u7

12u9(x)u9(y) – 3{u1(z)}2=u9

9, 9, 1 12u9(x)u1(z) – 3{u9(y)}2=u5 All accepted Can produce a multi-relation.

12u1(y)u9(z) – 3{u9(x)}2=u5

9, 9, 3 12u9(x)u9(y) – 3{u3(z)}2=u5 All accepted Can produce a multi-relation.

25
 12u9(x)u3(z) – 3{u9(y)}2=u1

12u3(y)u9(z) – 3{u9(x)}2=u1

12u9(x)u9(y) – 3{u7(z)}2 = u5 Accepted

12u9(x)u7(z) – 3{u9(y)}2 = u3 Rejected Fails to produce multi-

9, 9, 7
relation
12u9(y)u7(z) – 3{u9(x)}2 = u3 Rejected

12u9(x)u9(y) – 3{u5(z)}2=u7
Fails to produce multi-
9, 9, 5 12u9(x)u5(z) – 3{u9(y)}2=u7 All rejected
relation
12u5(y)u9(z) – 3{u9(x)}2=u7

All the units are equal:

Here all are accepted.

By the common factor (up,up,ur), it is to be ignored.
N = 5.5 uk (K ≠ 5) fails to fabricate any relation as because Rf is in the form of 5. uk
(K ≠ 5) . It is not a square integer.
Every group of three factors will follow the same rule of unit digits for IRNk,

k > 3.

up, uq, ur uk of Rf Accept/Reject Remarks

12u1(x)u1(y) – 3{u1(z)}2=u9

1,1,1 12u1(x)u1(z) – 3{u1(y)}2=u9 All accepted Can produce a multi-relation.

12u1(z)u1(z) – 3{u1(x)}2=u9

12u3(x)u3(y) – 3{u3(z)}2=u1
3,3,3 All accepted Can produce a multi-relation.
12u3(x)u3(z) – 3{u3(y)} =u1
2

26
 12u3(y)u3(z) – 3{u3(x)}2=u1

12u5(x)u5(y) – 3{u5(z)}2=u5

5,5,5 12u5(x)u5(z) – 3{u5(y)}2=u5 All accepted Can produce a multi-relation.

12u5(y)u5(z) – 3{u5(x)}2=u5

12u7(x)u7(y) – 3{u7(z)}2=u1

7,7,7 12u7(x)u7(z) – 3{u7(y)}2=u1 All accepted Can produce a multi-relation.

12u7(y)u7(z) – 3{u7(x)}2=u1

12u9(x)u9(y) – 3{u9(z)}2=u9

9,9,9 12u9(x)u9(z) – 3{u9(y)}2=u9 All accepted Can produce a multi-relation.

12u9(y)u9(z) – 3{u9(x)}2=u9

2.4 Ideal Ramanujan Number Form on Functional

There are three categories are given below,

1. f( x,k) = {{2x)-(2x-k)}{(2x)2+(2x-k)2 +2x(2x-k)}

=k(12x2-6kx+k2)
Here k is an odd prime number including one or product of multi prime numbers & <2x.
Apply the values and Calculate in above equation,

f(1,1) = 1(12(1)2-6(1)(1)+12)
=1(12-6+1)
=7
f(2,1) = 1(12(2)2-6(1)(2)+12)
=1(48-12+1)
=37
f(2,3) = 3(12(2)2-6(3)(2)+32)
=3(48-36+1)

27
 =3(21)
=63
f(3,1) = 1(12(3)2-6(1)(3)+12)
=1(108-18+1)
=91
f(3,3) = 3(12(3)2-6(3)(3)+32)
=3(108-54+9)
=3(63)
=189
f(3,5) = 5(12(3)2-6(5)(3)+52)
=5(108-90+25)
=5(43)
=215

f(4,1) = 1(12(4)2-6(1)(4)+12)
=1(192-24+1)
=169
f(4,3) = 3(12(4)2-6(3)(4)+32)
=3(192-72+9)
=3(129)
=387
f(4,5) = 5(12(4)2-6(5)(4)+52)
=5(192-120+25)
=5(97)
=485
f(4,7) = 7(12(4)2-6(7)(4)+72)
=7(192-168+49)
=7(73)
=511
f(5,1) = 1(12(5)2-6(1)(5)+12)
=1(300-30+1)

28
 =271

f(5,3) = 3(12(5)2-6(5)(3)+32)
=3(300-90+9)
=3(219)
=657
f(5,5) = 5(12(5)2-6(5)(5)+52)
=5(300-150+25)
=5(175)
=875
f(5,7) = 7(12(5)2-6(7)(5)+72)
=7(300-210+49)
=7(139)
=973

f(6,1) = 1(12(6)2-6(1)(6)+12)
=1(432-36+1)
=1(397)
=397
f(6,3) = 3(12(6)2-6(6)(3)+32)
=3(432-108+9)
=3(333)
=999

f(6,5) = 5(12(6)2-6(5)(6)+52)
=5(432-180+25)
=5(277)
=1385
f(6,7) = 7(12(6)2-6(7)(6)+72)
=7(432-252+49)
=7(229)

29
 =1603

f(6,11) = 11(12(6)2-6(11)(6)+112)
=11(432-396+121)
=11(157)
=1727
f(7,1) = 1(12(7)2-6(1)(7)+12)
=1(588-42+1)
=1(547)
=547
f(7,3) = 3(12(7)2-6(7)(3)+32)
=3(588-126+9)
=3(471)
=1413

f(7,5) = 5(12(7)2-6(5)(7)+52)
=5(588-210+25)
=5(403)
=2015
f(7,7) = 7(12(7)2-6(7)(7)+72)
=7(588-294+49)
=7(343)
=2401
f(7,11) = 11(12(7)2-6(11)(7)+112)
=11(588-462+121)
=11(247)
=2717
f(7,13) = 13(12(7)2-6(13)(7)+132)
=13(588-546+169)
=13(211)

30
 =2743

f(8,1) = 1(12(8)2-6(1)(8)+12)
=1(768-48+1)
=721
f(8,7) = 7(12(8)2-6(7)(8)+72)
=7(768-336+49)
=7(481)
=3367
f(17,1) =1(12(17)2-6(1)(17)+12)
=3468-102+1
=3367
f(20,7) =7(12(20)2-6(7)(20)+72)
=7(4800-840+49)
=28063
And so on.

Calculated values are substituted in the following table,

x= f(x,1) f(x,3) f(x,5) f(x,7) f(x,11) f(x,13) f(x,15) f(x,17) f(x,19)

1 7
2 37 63
3 91* 189 215
4 169 387 485 511
5 271 657 875 973
6 397 999 1385 1603 1727
7 547 1413 2015 2401 2717 2743
8 721* 1899 2765 3367* 3971 4069 4095
9 919 2457 3635 4501 5489 5707 5805 5831

31
 10 1141 3087 4625 5803 7271 7657 7875 7973 7999
11 1387 3789 5735 7273 9317 9919 10305 10523 10621
12 1687 4563 6965 8911 11627 12493 13095 13481 13699
13 1951 5409 8315 10717 14201 15379 16245 16847 17233
14 2269 6327 9785 12691 17039 18577 19755 20621 21223
15 2611 7317 11375 14833 20141 22087 23625 24803 25669
16 2977 8379 13085 17143 23507 25909 27855 29393 30571
17 3367* 9513 14915 19621 27137 30043 32445 34391 35929
18 3781 10719 16865 22267 31031 34489 37395 39797 41743
19 4219 11997 18935 25081 35189 39247 42705 45611 48013
20 4681 13347 21125 28063* 39611 44317 48375 51833 54739

Now, f(x,k)will always produce an expression like,

f(x,k) = (odd integer)3 – (even integer)3

f(3, 1) = 91 = 7.13 = 33 + 43 = 63 + (– 5)3

f(8, 1) = 721 = 7.103 = 163 + (– 15)3 = 93 + (– 2)3

f(8 , 7) = 3367 = 7x13x37=163+(-9)3 = 153+(-2)3 = 343+(-33)3

f(17, 1) = 3367 = 7.13.37 = 163 + (– 9)3 = 343 + (– 33)3 = 153 + (– 2)3

f(20, 7) = 28063 = 7.19.211 = 313 + (– 12)3 = 403 + (– 33)3

2. g(x,k) = {(2x+k)-(2x)}{(2x)2 + (2x+k)2 + 2x(2x+k)}

= k(12x2+6kx+k2)
Here k is an odd prime number including one or product of multi prime numbers.

g(1, 1) =1[12(1)2+6(1)(1)+12]
=1[12+6+1]
=1[19]

32
 =19

g(1, 3) =3[12(1)2+6(3)(1)+32]

=3[12+18+9]
=3[39]
=117

g(1, 5) =5[12(1)2+6(5)(1)+52]
=5[12+30+25]
=5[67]
=335

g(1, 7) =7[12(1)2+6(7)(1)+72]
=7[12+42+49]
=7[103]
=721

g(1, 11) =11[12(1)2+6(11)(1)+112]

=11[12+66+121]
=11[199]
=2189

g(1, 13) =13[12(1)2+6(13)(1)+132]

=13[12+78+169]
=13[259]
=3367

g(1, 15) =15[12(1)2+6(15)(1)+152]

=15[12+90+225]
=15[327]
=4905

g(1, 17) =17[12(1)2+6(17)(1)+172]

=17[12+102+289]

33
 =17[403]
=6851

g(1, 19) =19[12(1)2+6(19)(1)+192]

=19[12+114+361]
=19[487]
=9253

g(2, 1) =1[12(2)2+6(1)(2)+12]
=1[48+12+1]
=1[61]
=61

g(2, 3) =3[12(2)2+6(3)(2)+32]

=3[48+36+9]
=3[93]
=279

g(2, 5) =5[12(2)2+6(5)(2)+52]
=5[48+60+25]
=5[133]
=665

g(2, 7) =7[12(2)2+6(7)(2)+72]
=7[48+84+49]
=7[181]
=1267

g(2, 11) =11[12(2)2+6(11)(2)+112]

=11[48+132+121]
=11[301]
=3311

g(2, 13) =13[12(2)2+6(13)(2)+132]

34
 =13[48+156+169]
=13[373]
=4849

g(2, 15) =15[12(2)2+6(15)(2)+152]

=15[48+180+225]
=15[453]
=6795

g(2, 17) =17[12(2)2+6(17)(2)+172]

=17[48+204+289]
=17[541]
=9197

g(2, 19) =19[12(2)2+6(19)(2)+192]

=19[48+228+361]
=19[637]
=12103

g(3, 1) =1[12(3)2+6(1)(3)+12]
=1[108+18+1]
=1[127]
=127

g(3, 3) =3[12(3)2+6(3)(3)+32]

=3[108+54+9]
=3[171]
=513

g(3, 5) =5[12(3)2+6(5)(3)+52]
=5[108+90+25]
=5[2233]
=1115

35
g(3, 7) =7[12(3)2+6(7)(3)+72]
=7[108+126+49]
=7[283]
=1981

g(3, 11) =11[12(3)2+6(11)(3)+112]

=11[108+198+121]
=11[421]
=4697

g(3, 13) =13[12(3)2+6(13)(3)+132]

=13[108+234+169]
=13[511]
=6643

g(3, 15) =15[12(3)2+6(15)(3)+152]

=15[108+270+225]
=15[603]
=9045

g(3, 17) =17[12(3)2+6(17)(3)+172]

=17[108+306+289]
=17[703]
=11951

g(3, 19) =19[12(3)2+6(19)(3)+192]

=19[108+342+361]
=19[811]
=15409

g(4,1) =1[12(4)2+6(1)(4)+12]

=192+24+1
=217

36
 g(9,1) =1[12(9)2+6(1)(9)+12]
=972+54+1
=1027

g(20,1) =1[12(20)2+6(1)(20)+12]
=4800+120+1
=4921

Furthermore so on.
Additional calculated values are in the given table,

x= g(x, 1) g(x, 3) g(x, 5) g(x, 7) g(x, 11) g(x, 13) g(x, 15) g(x, 17) g(x, 19)
1 19 117 335 721 2189 3367* 4905 6851 9253
2 61 279 665 1267 3311 4849 6795 9197 12103
3 127 513 1115 1981 4697 6643 9045 11951 15409
4 217* 819 1685 2863 6347 8749 11655 15113 19171
5 331 1197 2375 3913 8261 11167 14625 18683 23389
6 469 1647 3185 5131 10439 13897 17955 22661 28063
7 631 2169 4115 6517 12881 16939 21645 27047 33193
8 817 2763 5165 8071 15587 20293 25695 31841 38779
9 1027* 3429 6335 9793 18557 23959 30105 37043 44821
10 1261 4167 7625 11683 21791 27937 34875 42653 51319
11 1519 4977 9035 13741 25289 32227 40005 48671 58273
12 1801 5859 10565 15967 29051 36829 45495 55097 65683
13 2107 6813 12215 18361 33077 41743 51345 61931 73549
14 2437 7839 13985 20923 37367 46969 57555 69173 81871
15 2791 8937 15875 23653 41921 52507 64125 76823 90649
16 3169 10107 17885 26551 46739 58357 71055 84881 99883
17 3571 11349 20015 29617 51821 64519 78345 93347 109573
18 3997 12663 22265 32851 57167 70993 85995 102221 119719

37
 19 4447 14049 24635 36253 62777 77779 94005 111503 130321
20 4921* 15507 27125 39823 68651 84877 102375 121193 141379

g(x,k) will always produce an expression like

g(x,k) = (even integer)3 – (odd integer)3

X* are able of producing additional wings.

g(1,13) = 3367 = 7x13x37 = 163+(-9)3 = 153+(-2)3 = 343+(-33)3

g(4, 1) = 217 = 7.31 = 63 + 13 = 93 + (– 8)3

g(9, 1) = 1027 = 13.79 = 103 + 33 = 193 + (– 18)3

g(20, 1) = 4921 = 7.19.37 = 173 + 23 = 413 + (– 40)3

3. h(x,k) = {(k-2x)+(2x)}{{k-2x)2+(2x)2-2x(k-2x)}
= k(12x2-6kx+k2)
Now k is an odd prime number or product of multi prime numbers > 2x

Apply the values and calculate in above equation,

h(1,3) =3[12(1)2-6(3)(1)+(3)2]
=3[12-18+9]
=3[3]
=9

h(1,29) =29[12(1)2-6(29)(1)+(29)2]
=29[12-174+841]
=29[679]
=19691

38
h(2,7) =7[12(2)2-6(7)(2)+(7)2]

=7[48-84+49]
=7[13]
=91

h(2,29) =29[12(2)2-6(29)(2)+(29)2]
=29[48-348+841]
=29[541]
=15689

h(3,7) =7[12(3)2-6(3)(7)+(7)2]

=7[108-126+49]
=7[31]
=217

h(3,29) =29[12(3)2-6(29)(3)+(29)2]
=29[108-522+841]
=29[427]
=12383

h(4,29) =29[12(4)2-6(29)(4)+(29)2]
=29[192-696+841]
=29[337]
=9773

h(5,13)=13[12(5)2-6(13)(5)+(13)2]
=13[300-390+169]
=13[79]
=1027

39
 h(5,19)=19[12(5)2-6(19)(5)+192]

=19[300-570+361]

=19[91]
=1729

h(5,29) =29[12(5)2-6(29)(5)+(29)2]
=29[300-870+841]
=29[271]
=7859

h(6,13)= 13[12(6)2-6(13)(6)+(13)2]
=13[432-468+169]
=13[13]
=1729

h(6,29) =29[12(6)2-6(29)(6)+(29)2]
=29[432-1044+841]
=29[229]
=6641

h(7,29) =29[12(7)2-6(29)(7)+(29)2]
=29[588-1218+841]
=29[211]
=6119

h(8,29) =29[12(8)2-6(29)(8)+(29)2]
=29[768-1392+841]
=29[217]
=6293

40
h(9,29) =29[12(9)2-6(29)(9)+(29)2]
=29[972-1566+841]
=29[247]
=7163

h(10,29) =29[12(10)2-6(29)(10)+(29)2]
=29[120-1740+841]
=29[301]
=8729

h(11,29) =29[12(11)2-6(29)(11)+(29)2]
=29[1452-1914+841]
=29[379]
=10991

h(12,29) =29[12(12)2-6(29)(12)+(29)2]
=29[1728-2088+841]
=29[481]
=13949

h(13,29) =29[12(13)2-6(29)(13)+(29)2]
=29[2028-2262+841]
=29[607]
=17603

h(14,29) =29[12(14)2-6(29)(14)+(29)2]
=29[2352-2436+841]
=29[757]
=21953

And so on, Putting more values on the below table,

41
 x= h(x, 3) h(x, 5) h(x, 7) h(x, 11) h(x, 13) h(x, 17) h(x, 19) h(x, 23) h(x, 29)
1 9 35 133 737 1339 3383 4921 9269 19691
2 65 91* 407 793 2261 3439 6923 15689
3 217* 341 559 1547 2413 5129 12383
4 539 637 1241 1843 3887 9773
5 1001 1027* 1343 1729* 3197 7859
6 1729* 1853 2071 3059 6641
7 2771 2869 3473 6119
8 4097 4123 4439 6293
9 5833 5957 7163
10 8027 8729
11 10649 10991
12 13949
13 17603
14 21953

Produce an expression like,

h(x,k) = (even integer)3 + (odd integer)3

h(2,7) = 91 =7x13 = (6)3+(-5)3 = 43 + 33

h(3,7) =217=7 x 31 = 63 + 13 = 93 + (– 8)3

h(5,13) = 1027 = 13x79 = 103+33 = 193 +(-18)3

h(5,19) = 1729 = 7x13x19 = 103+93 = 123+13

42
 3 3 3 3
h(6, 13) = 1729 = 7.13.19 = 12 + 1 = 10 + 9

Above the expression more wings, may be positive expression or negative

expression for f(x,k)& g(x,k) but for h(x,k) all are bound to be of positive expression.

CHAPTER – 3
Generalization of Magic Squares and
Dot Products of 3rd Order Magic Squares

3.1 Introduction

A magic square is a square range of natural numbers so that the total of the numbers in
every row, column, or diagonal is the similar.

43
 The semi magic square is a square matrix, here [8] the total of all entries in both column
or row yields the same number. This number is called the magic constant. The semi magic
squares both main diagonals addition up to the magic constant. The natural magic square of
order n is a matrix of range n × n such that its entries consist of all integers from one to n².

The case of magical constant is,

n(n2 + 1)
2

A pandiagonal magic square is a magic square such that the addition of all entries in all
wrecked diagonals equals the magic constant. The symmetric magic square is a natural magic
square of arrange n such that the addition of equally elements of every pair of dual equals n2 + 1.

3.2 The magical constant

By the above definitions of the constant [7] is known as the magic constant or
magic number.
The magic squares are given 3 x 3 orders.
Ex: 1

Create magic square with r = 45

14 19 12

13 15 17

18 11 16

Ex: 2

x = 54 and all numbers even.

16 26 12

44
 14 18 22

24 10 20

Ex: 3

r = 72 and all elements divisible by 4.

20 40 12

16 24 32

36 8 28

3.3 Rows and columns Dot product of third order magic square

Preposition:1

If R1, R2, R3& C1, C2, C3 are [7] the rows and columns of a 3rd order magic square in
their consecutive order respectively, then

(i) R1 . R2 = R2 . R3,
(ii) R1 . R1 = R3 . R3,
(iii) C1 . C2 = C2 . C3,
(iv) C1 . C1 = C3 . C3,
(v) R1 . C1 = R2 . C2 = R3 . C3,
(vi) R1 . C2 = R1 . C3 = R2 . C1 = R2 . C3 = R3 . C1 = R3 . C2.

Proof:

Let us,

45
 a–y a+y–x a+x
A= a+y+x a a–y–x
a–x a–y+x a+y

Put, a=5, y=1, x= -3

5-1 5+1+3 5-3

5+1-3 5 5-1+3
5+3 5-1-3 5+1

4 9 2
3 5 7
8 1 6

Then,
(i) R1 . R2 = (a – y) (a + y + x) + (a + y – x) a + (a + x) (a – y – x)
=a2+ay+ax-ay-y2-xy+a2+ay-ax+a2-ay-ax+ax-xy-x2
=3a2-2xy-y2-x2
= 3a2 – (x + y)2
Put a=5, x=-3, y=1
R1 . R2 = 3(5)2-(-3+1)2
=75-4
=71

And

R2 . R3 = (a – x) (a + y + x) + (a – y + x) a + (a + y) (a – y – x)

= 3a2 – (x + y)2
=3(5)2-(-3+1)2
=71

46
 R2 . R3 = R1 . R2

Hence proved (i)

(ii) R1 . R1 = (a – y)2+ (a + y – x)2+ (a + x)2

= 3a2 + x2 + y2 + (x – y)2
=3(5)2+(-3)2+12+(-3-1)2
=75+9+1+16
=101

R3 . R3 = (a – x)2+ (a – y + x)2+ (a + y)2

= 3a2 + x2 + y2 + (x – y)2
=3(5)2+(-3)2+12+(-3-1)2
=101
R1 . R1 = R3 . R3,

Hence (ii) proof

(iii) C1 . C2 = (a – y) (a + y – x) + (a + y + x) a + (a – x) (a – y + x)
= 3a2 – (x – y)2
= 3(5)2-(-3-1)2
=75-16
=59

C2 . C3 = (a + x) (a + y – x) + (a – y – x) a + (a + y) (a – y + x)
= 3a2 – (x – y)2
=3(5)2-(-3-1)2
=75-16
=59
C1 . C2=C2.C3
Therefore (iii) proofed

(iv) C1 . C1 = (a – y)2+ (a + y + x)2+ (a – x)2

= 3a2 + x2 + y2 + (x + y)2

47
 =3(5)2+(-3)2+12+(-3+1)2
=75+9+1+4
=89

C3 . C3 = (a + x)2+ (a – y – x)2+ (a + y)2

= 3a2 + x2 + y2 + (x + y)2
=3(5)2+(-3)2+12+(-3+1)2
=89
C1 . C1= C3 . C3

Therefore Proofed (iv)

(v) R1 . C1 = (a – y)2+ (a + y – x) (a + y + x) + (a + x) (a – x)
= 3a2 – 2x2 + 2y2
=3(5)2-2(-3)2+2(1)2
=75-18+2
=59

R2 . C2 = (a + y – x) (a + y + x) + a2+(a – y + x) (a – y – x)
= 3a2 – 2x2 + 2y2
=3(5)2-2(-3)2+2(1)2
=59

R3 . C3 = (a – x) (a + x) + (a – y + x) (a – y – x) + (a + y)2
= 3a2 – 2x2 + 2y2
=3(5)2-2(-3)2+2(1)2
=59
R1 . C1 = R2 . C2 = R3 . C3
Hence proof (v)

(vi) R1 . C2 = (a – y) (a + y – x) + (a + y – x) a + (a + x) (a – y + x)
= 3a2 + x2 – y2
= 3(5)5+(-3)2-(1)2
= 75+9-1

48
 =83
R1 . C3 = (a – y) (a + x) + (a + y – x) (a – y – x) + (a + x) (a + y)
= 3a2 + x2 – y2
=3(5)5+(-3)2-(1)2
=83

R2 . C1 = (a + y + x) (a – y) + a (a + y + x) + (a – y – x) (a – x)
= 3a2 + x2 – y2
=3(5)5+(-3)2-(1)
=83

R2 . C3 = (a + y + x) (a + x) + a (a – y – x) + (a – y – x) (a + y)
= 3a2 + x2 – y2
=3(5)5+(-3)2-(1)2
=83

R3 . C1 = (a – x) (a – y) + (a – y + x) (a + y + x) + (a + y) (a – x)
= 3a2 + x2 – y2
=3(5)5+(-3)2-(1)2
=83

R3 . C2 = (a – x) (a + y – x) + (a – y + x) a + (a + y) (a – y + x)
= 3a2 + x2 – y2
=3(5)5+(-3)2-(1)2
=83

Hence, R1 . C2 =R1 . C3 = R2 . C1 = R2 . C3 = R3 . C1 = R3 . C2.

Preposition:2

For a 3rd order magic square R1 . R2 . R3 = C1 .C2 . C3

Proof:

Let us take the 3rdorder magic square A given by

49
 a–y a+y–x a+x
A= a+y+x a a–y–x
a–x a–y+x a+y

Put, a=5, y=1, x= -3

5-1 5+1+3 5-3

5+1-3 5 5-1+3
5+3 5-1-3 5+1

4 9 2
3 5 7
8 1 6
Then,

R1 .R2 . R3 = (a – y) (a + y + x) (a – x) + (a + y – x) a (a – y + x) + (a + x) (a – y – x) (a + y)
= 3a (a2 – x2 – y2)
=3(5) (52-(-3)2-12)
=15(25-9-1)
=15(15)
=625

C1 .C2 . C3 = (a – y) (a + y – x) (a + x) + (a + y + x) a (a – y – x) + (a – x) (a – y + x) (a + y)
= 3a (a2 – x2 – y2)
= 3(5) (52-(-3)2-12)
= 625
Hence, R1 . R2 . R3 = C1 .C2 . C3

3.4 The 4x4 magic square matrix R4

50
 An obtained a magic square [5] only having the knowledge of summation and
multiplication of integers with help of the 4×4 matrix.

The 4x4 matrix of cubes are semi-magic, its 4 rows and 4 columns having the same
magic sum,

Illustration
Put up a magic [15] square by leasing S1 = {A, B, C, D} and S2 = {P, Q, R, S} and
allowing for S1 + S2.

A+P D+S C+Q B+R

C+R B+Q A+S D+P

B+S C+P D+R A+Q

D+Q A+R B+P C+S

Here,
“If A+D = B+C and P+R=Q+S the severe middle four in the first square also
convince the agreed circumstance”. “The extreme middle four” is not distinct but that most
probably are four middle squares then the hypotheses, A+D=B+C and P+R=Q+S are not
required.

Ex:1

Create the 4 x4 matrix and find to calculate {A, B, C, D} and {P, Q, R, S} this number
{11, 9, 10, 8} and {18, 23, 12, 7}.

Solution:

51
Taking A=11, B=9, C=10, D=8, P=18, Q=23, R=12, S=7.

Here,

A+D=B+C → 11+8=9+10
P+R=Q+S → 18+12=23+7
The conditions are satisfied, applied values on the below table,

11+18 8+7 10+23 9+12

10+12 9+23 11+7 8+18

9+7 10+18 8+12 11+23

8+23 11+12 9+18 10+7

29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

Summation of the numbers of any row is 98

29 15 33 21

22 32 18 26

52
 16 28 20 34

31 23 27 17

Calculation of the numbers of any column is also 98

29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

The sum of diagonal is also 98

29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

Addition of the corner number is also 98

53
 29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

Sum of identical difference highlight number on the boxes is also 98

29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

Sum of identical difference best part number on the boxes is also 98

29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

54
Add the central squares is 98

29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

Sum of the identical corner 4 boxes is also 98

29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

Sum of identical boxes is also 98 in 2 way,

29 15 33 21

22 32 18 26

16 28 20 34

31 23 27 17

55
3.5 Birthday Magic Square

Now introduce the model birthday to know improved all the way through magic square.
It will develop mathematical wisdom and make certain on the increase concentration.

Rule:1

Solution

P Q R S

S+1 R-1 Q-3 P+3

Q-2 P+2 S+2 R-2

R+1 S-1 P+1 Q-1

Put P=23, Q=11, R=19, S=88

23 11 19 88

89 18 8 26

9 25 90 17

20 87 24 10

(i) Sum of the numbers of any column is 141

𝐶1⇒ P + S + 1 + Q - 2 + R + 1 = P + Q + R+ S
23+88+1+11-2+19+1 =23+11+19+88
141=141

𝐶2⇒ Q + R - 1 + P + 2 + S - 1= P + Q + R + S

56
 11+19-1+23+2+88-1=23+11+19+88
141=141

𝐶3⇒ R + Q - 3 + S + 2 + P + 1 = P + Q + R + S
19+11-3+88+2+23+1=23+11+19+88
141=141

𝐶4⇒ S + P + 3 + R - 2 + Q - 1 = P + Q + R + S
88+23+3+19-2+11-1=23+11+19+88
141=141

(ii) Sum of the numbers of any row is 141

𝑅1 ⇒ P + Q + R + S
R1=>23+11+19+88
=141

𝑅2⇒ S + 1 + R - 1 + Q - 3 + P + 3 = P + Q + R + S
88+19-1+11-3+23+3=23+11+19+88
141=141

𝑅3⇒ Q - 2 + P + 2 + S + 2 + R - 2 = P + Q + R + S
11-2+23+2+88+2+19-2= 23+11+19+88
141=141

R4 ⇒ R + 1 + S - 1 + P + 1 + Q - 1 = P + Q + R + S
19+1+88-1+23+1+11-1=23+11+19+88
141=141

(iii) Sum of numbers of any diagonals is 141

𝐷1= P + R - 1 + S + 2 + Q - 1 = P + Q + R + S
23+19-1+88+2+11-1=23+11+19+88
141=141

𝐷2= R + 1 + P + 2 + Q- 3 + S = P + Q + R + S

57
 19+1+23+2+11-3+88=23+11+19+88
141=141

(iv) The sum of the corner number is 141

P+S+R+1+Q–1=P+Q+R+S
23+88+19+1+11-1=23+11+19+88
141=141

(v) Sum of the corner square is 141

P+Q+S+1+R-1=P+Q+R+S
23+11+88+1+19-1=23+11+19+88
141=141

R+ S + Q - 3 + P + 3 = P + Q + R + S
19+88+11-3+23+3 =23+11+19+88
141=141

Q-2+P+2+R+1+S-1=P+Q+R+S
11-2+23+2+19+1+88-1=23+11+19+88
141=141

S+ 2 + R - 2 + P + 1 + Q - 1 = P+ Q + R + S
88+2+19-2+23+1+11-1=23+11+19+88
141=141

(vi) Sum of the middle square is 141

R-1+Q-3+P+2+S+2=P+Q+R+S
19-1+11-3+23+2+88+2=23+11+19+88
141=141

Rule: (2)

Similarly one can find a different type of formula table

58
 P Q R S

R+3 S-3 P+3 Q-3

S-2 R-2 Q+2 P+2

Q-1 P+5 S-5 R+1

Solution:

23 11 19 88

22 85 26 08

86 17 13 25

10 28 83 20

Rule: (3)

P Q R S

R-1 S+1 P-1 Q+1

S+1 R+1 Q-1 P-1

Q P-2 S+2 R

Solution:

23 11 19 88

18 89 22 12

59
 89 20 10 22

11 21 90 19

3.6 Generate the 5X5 magic square matrix R5

The general construction of 5x5 magic square, namely

D+Q E+S A+P B+R C+T

E+R A+T B+Q C+S D+P

A+S B+P C+R D+T E+Q

B+T C+Q D+S E+P A+R

C+P D+R E+T A+Q B+S

There are no limitations on [15] the parameters in the 1st square, however in the 2nd, the
condition A+B+D+E=4C must be satisfied.

Example:1
Make 5x5 magic square matrix with equal sums of 75.
Taking
A=2, B=7, C=12, D=17, E=22, P=1, Q=2, R=3, S=4, T=5 respectively.
Here,
A+B+D+E = 4C
2+7+17+22 = 4x12
48 = 48
Therefore the conditions are satisfied. Then applied the values in table,

60
 17+2 22+4 2+1 7+3 12+5

22+3 2+5 7+2 12+4 17+1

2+4 7+1 12+3 17+5 22+2

7+5 12+2 17+4 22+1 2+3

12+1 17+3 22+5 2+2 7+4

19 26 3 10 17

25 7 9 16 18

6 8 15 22 24

12 14 21 23 5

13 20 27 4 11

Example:2

Construct 7X7 magic square the summation of rows and columns is 175

Solution

9 17 25 33 41 49 1
26 10 2 43 42 34 18
36 44 3 11 19 27 35
4 12 20 28 29 37 45
21 22 30 38 46 5 13
31 39 47 6 14 15 23
48 7 8 16 24 32 40

Example:3

Create 8X8 magic square the total of rows and columns are310.

61
Solution

47 20 21 42 39 78 29 34

22 41 48 19 30 33 40 27

44 23 18 45 36 31 26 37
17 46 43 27 25 38 35 32
63 4 5 58 55 12 13 50
6 57 64 3 14 49 56 11

60 7 2 61 52 15 10 53

1 62 59 8 9 54 51 16

62
 CHAPTER – 4
An Ideal Approach for Taxicab and Cabtaxi Number
4.1 Introduction
The great mathematician Srinivasan Ramanujan and Fermat are told the
same statements. Two of them were,

1. Find two cube numbers of which the sum is equal to two other cube numbers.
2. Find two cube numbers of which the sum is a cube.

Now, can be written as algebraically method [10]

x3+ y3= z3+ w3 ………… (1)
x3+ y3= z3 …………. (2)

The (1) solutions by Frenicle are,

1729 = 93+ 103= 13+ 123
4104 = 93+ 153= 23+ 163
13832=23+243=183+203
………………………………..

Fermat himself worked on numbers which are additions of two cubes in more than two
ways. For solving x3= y3+ z3+ w3 by Viete's formulae. It is possible to assemble the integer
expressible as a addition of two cubes in n different ways.

4.2 1729 is called a Taxicab Number

The number about 1729 was at the present frequently called the “Taxicab problem.

The parametric solutions of (1)

This below equation gives only a small fraction of the solutions.

Putting,
m = 3; n =0; a = 1, and b = 3,

63
 If, m2+ mn + n2 = 3a2b
(3)2+(3)(0)+(0)2 = 3(1)2(3)
9=9
Then
(m + ab2)3+ (bn + a)3= (bm + a)3+ (n + ab2)3
[3+1(3)2]3+[3(0)+1]3 = [3(3)+1]3+[0+(1)(3)2]3
The equation yields 123+ 13= 103+ 93= 1729.

4.3 The taxicab number

The sum of two cubes in n different ways of the smallest number expressible is called the
Taxicab Number.
The solution of the equation x3+y3=u3+v3=a3+b3

But, the proof is of little use in finding the numbers; the Taxicab(n) exists for all positive
integer n.
Insignificantly,
Taxicab(1)=2=13+13

Taxicab(2)=1729=13+123=93+103

Taxicab(3)=87539319=2283+4233
=4363+1673
=2553+4143
=6063+(-513) 3

Taxicab(4)=6963472309248=54363+189483
=24213+190833
=133223+166303
=102003+180723
=422283+(-40884) 3

Wilson discovered the fifth taxicab Number,

64
Taxicab(5)=48988659276962496=387873+3657573
= 1078393+3627533
=2214243+3365883
=2052923+3429523
=2315183+3319543.
=6223163+(-576920) 3
=(-681184) 3+7147003

Taxicab(6) ≤24153319581254312065344=289062063+5821623
=288948033+30641733
=85192813+286574873
=174924963+265904523
=270932083+162180683
=262243663+182899223
=491629643+(-45576680) 3
=564613003+(-53813536) 3
Taxicab(7)≤24885189317885898975235988544=18472821223+26486609663
=26856356523+17667420963
=587983623+29195268063
=29583751033+3094814733
=4595311283+29157349483
=28944061873+8604473813
=27364140083+16380248683
And so on …

4.4 Generalizations of Taxicab Numbers:

Taxicab numbers are defining for the higher powers than three as well as for more
representations. General, Taxicab(k,j,n) is the least number it can be [4] expressed as the addition
of j kth powers in n different ways.
Example:

65
 The Taxicab (4,2,2) is the least number that is a sum of two fourth powers in two
different ways.
The following Taxicab numbers can be simply computed
Taxicab(4,2,2)=635318657=594+1584=1334+1344,
Taxicab(2,3,2)=62=12+52+62=22+32+72,
Taxicab(3,3,2)=1009=13+23+103=243+93+63,
Taxicab(4,3,2)=6578=94+24+14=74+34+84,
Taxicab(5,3,2)=1375298099=245+285+675=545+625+35,
Taxicab(6,3,2)=160426514=226+196+36=156+106+236,
The generalizing to superior powers it is not recognized, if n way additions for higher
powers exist. Further generalizing is obtained by allowing mutually positive and negative
expressions.

4.5 Cabtaxi numbers:

Can generalize the problem by allowing additions of positive or negative cubes, are
called Cabtaxi numbers.
The given equation gives only a division of the 3-way formula:
If, m2+ mn + n2= 3a2b,
then
[(m + n)c + ab2]3+[-(m + n)b - ac2]3= (-mc + ab2)3+ (mb-ac2)3
= (-nc+ab2)3+ (nb-ac2)3

The cabtaxi(n) exists for every part of the positive integer n, the proof of small exercise
in finding the number.
Immaterially,

Cabtaxi(1) =1 = 13+03

Cabtaxi(2)=91=43+33
=63+(-5)3

Cabtaxi(3)=728=83+63

66
 =93+(-1)3
=(-10)3+123

Cabtaxi(4) =2741256 =1083+1143

=(-14) 3+1403
=168v+(-126) 3
=(-183) 3+2073

Cabtaxi(5) =6017193 =1163+1663

=573+1803
=1853+(-68) 3
=(-146) 3+2093
=2463+(-207) 3

Cabtaxi (6)=1412774811=9633+8043
=(-357) 3+11343
=11553+(-504) 3
=(-805) 3+12463
=(-2004)3+21153
=47463+(-4725) 3

Cabtaxi(7)=11302198488=16083+19263

=19393+15893
= (-714) 3+22653
=23103+(-1008) 3
= (-1610) 3+24923
=42303+(-4008) 3
= (-9450) 3+94923

Cabtaxi(8)=137513849003496=442983+369843
=365473+445973
=500583+229443
=521643+(-16422) 3

67
 =531303+(-23184) 3
= (-37030) 3+573163
=972903+(-92184) 3
=(-217350) 3+2183163

Cabtaxi(9) = 424910390480793000 =6452103+5386803

=5323153+6495653
=7524093+(-101409) 3
=(-239190) 3+7597803
=7738503+(-337680) 3
=(-539350) 3+8348203
=14170503+(-1342680) 3
=31798203+(-3165750) 3
=59600103+(-5956020) 3

Cabtaxi(10) ≤ 933528127886302221000=83877303+70028403
=69200953+84443453
=97733303+(-84560) 3
=97813173=(-1318317) 3
=(-3109470) 3+98771403
=100600503+(-4389840) 3
=(-7011550) 3+108526603
=184216503+(-17454840) 3
=(-41154750) 3+413376603
=774801303+(-77428260) 3
[Cab taxi(4), Cab taxi(5), Cab taxi(6), Cab taxi(7)were found by Randall L.Rathbun in the
beginning of the 1990s, Cabtaxi(8) Discovered by Daniel J.Bernstein in 1998.]

4.6 Principal versions of Taxicab and Cabtaxi number:

The production with splitting factors generates the addition of cubes of non-prime
integers:
“The prime version of Taxicab numbers” the smallest 2-way solutions are [10]

68
 6058655748=613+18233 =10493+16993 …….(1)
6507811154=18613+3973 =18673+313 .…….(2)

The prime version of “cabtaxi numbers” thesmallest 2-way solutions is

62540982 = 3973- 313= 18673 - 18613 ……….(3)
105161238 = 1933+ 4613= 7093 – 6313………..(4)
The answer (3) is a different collection of (2)
The “easier" inquiry:
Searching for directly in 3-way solution using by 6 cubed primes, in further 3-way
solution using at least 4 cubed primes, from of differently,
68913 = 403+ 173= 413- 23= 893 -863
The supplemental observation:
The unsolved problems are our 3-way, but solved for a long time if only co-prime pairs
are used instead of primes. More than a few 3-way and 4-way solutions with using additions of
two co-prime cubes are known.
Paul Vojta was found in the smallest 3-way solution are below,
15170835645=5173+24683=7093+24563=17333+21523
The solutions 3-way, 4-way and 5-way are using additions or differences of two co prime
cubes are known. It is uncomplicated to find the least 3-way solution:
3367 = 153 - 23= 163- 93= 343- 333.

69
 CHAPTER – 5
K3 Surface of the Arithmetic Geometry

5.1 Introduction

The surface of intermediate type, that is neither geometrically rational nor ruled, nor of
common type, the k3 surface has an accessible arithmetic theory. Here included at the end two
admittedly optimistic conjectures on uniform boundedness of Brauer groups for pattern polarized
k3 surfaces over number fields. In these notes following treated the topics are,

Geometry of k3 Surface
The geometry of k3 surfaces are topological properties, including the lattice structure of
H2(X, Z) and simple connectivity, K3 surface of the period position, by the Torelli theorem and
subjectivity of the period chart.

Picard groups

The geometric Picard group Pic(𝑋) of a projective K3 surface of a number field k,

X/k is a free Z-module of rank 1 ≤ ρ(𝑋)≤ 20. D etermining, ρ(𝑋) for the certain K3 surface
is a complicated task.

Brauer groups

The Galois module structure of Pic(𝑋) Let compute an important piece of the Brauer
groups Br(X) = H2(Xet, Gm) of a locally solvable K3 surface X, the class of consisting of Br(X)
that are killed by means of passage to an algebraic closure, modulo Brauer classes classes from
the ground field.

5.2 Geometry of k3 Surface

Definition:

A n algebraic K3 surface is a smooth [13] projective 2-dimensional variety over a

field k such that ωx ≃Ϭx and H1 (X, Ϭx ) = 0. The polarized K3 surface is a brace (x, h), Here

70
X is an algebraic K3 surface and h ∈ H2 (x, 𝕫) is a plentiful division. The degree of a
polarized K3 surface is the self-intersection h2.

Example

Let X be a smooth complete intersection of type (d1 …….. , dr ) in ℙ𝑛𝑘

Some possibilities for X in these leaves are given:

(1) H e r e , n = 3 and (d1 ) = (4), that is X is a s m o o t h quartick surface inℙ3𝑘 .

(2) N o w , n = 4 and (d1 , d2 ) = (2, 3), i.e., X is a smooth complete intersection of a

quadric andk a cubic inℙ4𝑘 .

(3) At this point, n = 5 and (d1 , d2 , d3 ) = (2, 2, 2), i.e., X is a s m o o t h

c o m p l e t ke i n t e r s e c t i o n of three quadrics in ℙ5𝑘.

5.3 The Euler’s characteristic

By definition, If X is an algebraic K3 surface, it have h0 (X, ϬX ) = 1 and h1 (X,

ϬX ) = 0. The duality then gives h2 (X, ϬX) = h0 (X, ϬX) = 1, so X a numerical K3

surface = χ(X, ϬX) = 2.

5 . 4 Linear, algebraic, and numerical uniformity

Allow, X be a smooth surface over a field k, can write Div X for its group of Weil
divisors. The intersection pairing on X is denoted by (,) X: Div X × Div X → Z. There are
three b a s i c e q u i v a l e n c e relatives [13] one can put on Div X:

(1) Linear correspondence:

C, D ∈ Div X are linearly equivalent if C= D + div (f) for some f ∈ k(X)
(the meaning grassland of X).
(2) Algebraic equivalence:

71
 C , D ∈ Div X are algebraically equivalent if there is a connected curve T
, two closed points 0 and 1 ∈ T , and a divisor E in X × T , f l a t o v e r T , such
that E|X ×{0} − E|X ×{1} = C − D.
(3) Numerical equivalence:
Numerical equivalent are C, D ∈ Div X, if (C, E) X = (D, E) X for all,

E ∈ Div X.

These relationships obey the following chain of command:

The Linear equivalence ⇒ T h e Algebraic equivalence ⇒ Numerical

equivalence.

5.5 Complex K3 surfaces.

More than k = C, there is a conception of K3 surfaces as complex manifolds that

includes geometric K3 surfaces over C, while almost complex K3 surfaces are not
projective. This more flexible theorem is proof important result for K3 surfaces.

Definition

A complex K3 surface is a compact connected 2-dimensional complex

1
X Manifold X such that ωx = Ω2𝑥 ≃ ϬX and H (X,ϬX ) = 0

5.6 Complex K3 surfaces of the singular co-homology.

Denoted X a complex k3 surface, e(.) is the topological Euler’s characteristic

of a space, and ci(X) is the ith Chern category of X for i=1 and 2. Can show that,
χ(X, ϬX ) = 2.
Noether’s formula state that
1
χ(X, ϬX ) = 2(c1(X)2 + c2(X))

Here,
c1(X)2 =0, and c2(X)=24
The singular co-homology groups of X,

72
 H0(X, Z) ≅Z because X is connected, and
H4(X, Z) ≅Z because X is oriented.

5.7 Differential geometry of complex K3 surfaces.

Definition:

Let Hz be a free abelian group of finite rank. An integral Hodge structure of weight n on Hz
is a decomposition, called the Hodge decomposition,

Hc = Hz⊗ 𝑧 C = ⊕ Hp,q.

Proposition:

Let X is a complex K3 surface. The Hodge diamond of X is given by

h0,0 1

h1,0 h0,1 0 0

h2,0 h1,1 h0,2 = 1 20 1

h2,1 h1,2 0 0

h2,2 1

Proof

Here, H1 (X, Z) = H3 (X, Z) = 0 and, the Hodge d e c o m p o s i t i o n functional to the

complexification of these groups for k = 1 and 3. Now, get the disappearance of the second
0,0 = h0 (X, Ϭ ) = 1, and from ω 2,0 =1. Serre
and fourth rows. Contain, h X x ≃ ϬX and h

duality and ωx ≃ ϬX collectively, h0,2 = h0,0 = h2,2. S i n c e , b2 = h2,0+ h1,1+ h0,2 =

73
22. Acquire h1,1 = 20. Finall y, the hp,q “outside” this diamond vanish by Serre duality and
dimension reasons.

The Hodge–Riemann relationships declare that,

(i) (ωx , ωx) = 0;

(ii) (ωx , ωx ) >0;
(iii) V=H2,0 (X) ⱷ H0,2 (X) is orthogonal to H1,1(X)

5.8 Picard Numbers of K3 surfaces

Good reduction

Definition: A ssent to R be a Dedekind sphere of influence, position K = Frac R, and

permit p ⊆ R be a nonzero prime ultimate. Give permission X be a horizontal appropriate
k-variety. Let X has good reduction at p if X has a downy correct Rp-model. That is, there
exists a even suitable morphism χ → Spec Rp, such that χ ×Rp K ≃X as K -schemes.

Absolute Frobenius

Over Z a finite field Fq, Let Fz:Z→Z be the Absolute Frobenius map:

The identity map on this point, and x→xp on the structure sheaf; it is not a
morphism of Fq-schemes. Set ϕz=𝐹𝑧𝑟 ; the map ϕz x 1: Z x𝐹 q → Z x𝐹 q induces a
linear transformation ϕ2𝑥 : H𝑒𝑡
2 2
( 𝑍,Ql) → H𝑒𝑡 ( 𝑍,Ql).

5.9 Upper bounds

Putting everything together:

Example

74
 The polynomial ring F3 [x, y, z, w], provide weights 1, 1, 1 and 3, respectively, to the
variables x, y, z and w, and allow PF3 (1, 1, 1, 3) = Proj F3 [x, y, z, w] be the corresponding
weighted projective plane. A polynomial p5(x, y, z) ∈ F3[x, y, z]5 so that t h e hyper surface X
prearranged by

w2 = 2y 2 (x2 + 2xy + 2y2 )2 + (2x + z) p5(x, y, z)

is smooth, hence a K3 surface .

Example,

P5(x, y, z) = x5+ x4 y + x3 yz + x2 y3+ x2 y2 z + 2x2 z 3+ xy4+ 2xy3 z + xy2 z 2

+ y5 + 2y 4 z + 2y3 z 2 + 2z 5 .

The projection π:

F3 P(1, 1, 1, 3) → ProjF3[x, y, z] restricts to a twice cover morphism π:X→𝑃𝐹3

2
, the
vanishing of t he ri ght hand si de of branched along,
N1 N2 N3 N4 N5 N6 N7 N8 N9 N10
.
7 79 703 6607 60427 532711 4792690 43068511 387466417 3486842479
Applying d e s c r i b e d above the procedure, the characteristic
polynomial ψ3 (x) to determine this information. The sign of the functional equation for ψ3 (x) is
̃ (x) = 3−22
negative-a positive sign gives increase to roots of absolute value≠3. Setting, ψ
ψ3 (3x).

C a n o b t a i n a factorization into irreducible factors as follows:

1
𝜓̃(x) = 3(x-1)(x + 1)(3x20+3x19+5x18+5x17+6x16+2x15+2x14-3x13-4x12-8x11-

6x10-8x9-4x8-3x7+2x6+2x5+6x4+5x3+5x2+3x+3).
The r o o t s of the degree 20 factor of ψ(x) are not i n t e g r a l , so they are not roots of
unity. Terminate that ρ(𝑥 ) ≤ 2.

75
5.10 Further techniques

The discriminate of the Neron-Severi lattice for some k3 surfaces by

exhibiting unambiguous generators.

Example:

A K3 surface X over Q with good diminution at p= 3 and 5, such that ρ(𝑥3) = 4 and
ρ(𝑥5) = 14.

Show that ρ(𝑥)=1 using simply information at these two primes. Allow X be the subschema

of P(1, 1, 1, 3) = Proj Z(15)[x, y, z, w] given by 𝜔2 = f6(x, y, z).

H ere

f6 (x, y, z) ≡ 2x6 + x4 y2 + 2x3 y2 z + x2 y2 z 2+ x2 yz 3 + 2x2 z 4+ xy 4 z + xy3 z 2 +

xy2 z 3 + 2xz 5 + 2y6 + y4 z 2 + y3 z 3 mod 3.

f6 (x, y, z) ≡ y6+ x4 y2+ 3x2 y4+ 2x5 z + 3xz 5+ z 6 mod 5.

Put X = χQ . Counting the lements of XF3 (F3n ) in for n = 1, . . . , 10.

Now get,

̃ 3 (x) = 1(x-1)2(x2+x+1)
ϕ 3

= (3x18 + 5x17 + 7x16 + 10x15 + 11x14 + 11x13 + 11x12 + 10x11 + 9x10+ 9x9 + 9x8 +

10x7 + 11x6 + 11x5 + 11x4 + 10x3 + 7x2 + 5x + 1).

5.11 Ramanujan’s links with 1729

Now studying Euler’s Diophantine equation,

76
 X3+ Y3 = Z3+ W3
Eg,

(1) The identity published in 1913,

(6A2- 4AB + 4B2)3 = (3A2+5AB - 5B2)3+(4A2-4AB+6B2)3+(5A2- 5AB - 3B2)3

Putting,
A=12, B=1
(6(12)2 – 4(12) (1)+4(1)2)3 = (3(12)2 + 5(12)(1) - 5(1)2)3 + (4(12)2 - 4(12)(1) + 6(1)2)3
+(5(12)2 - 5(12)(1) - 3(1)2)3
(864-48+4)3 = (432+60-5)3 + (576-48+6)3 + (720-60-3)3
(820)3 = (487)3 + (534)3 + (657)3
551368000 = 115501303 + 152273304 + 283593393
551368000 = 551368000

(1) Correspondingly, The identity of this second notebook,

(M7-3M4+(1+P)+M(3(1+P)2-1))3+(2M6-3M3(1+2P)+(1+3P+3P2))3

+(M6(1+3P+3P2))3=(M7-3M4P+M(3P2-1))3

The offered a family of equivalent solutions to Euler’s common explanation:

If
𝛼 2+ 𝛽𝛼 + 𝛽 2= 3λγ2,

Then,
(𝛼+ λ2γ )3+ (λ 𝛽 + γ )3= (λ𝛼 + γ )3+ (𝛽 + λ2γ )3

While quite a few further formulations correspondent to Euler’s solution have been
discovered other formulations equivalent to be the simplest consider to all.

The equation,
X3+ Y3= Z3+ W3

77
 gives a cubic surface, this is a rational elliptic surface.

5.12 Elliptic Curves

Can be written the sum of two rational cubes d is the rational number, for example, by
Ramanujan’s period, condition d = 1, then this is equivalent to the exponent 3 case of [11] Fermat’s
last theorem and was proven by Euler. The equation was identified to have no solutions were
values of d.
For example,

Sylvester conjectured that if p ≡ 5 (mod 18) and q ≡ 11 (mod 18) are primes, subsequently
the equation has no solutions while d = p, 2p, 4p2, 4q, q2, 2q2.

Currently be on familiar terms that the equation E: X3+ Y3= 1 is an elliptic curve with j-invariant 0,
and for cube-free d, Ed: X3+ Y3= d is the cubic bend of E by d. Since Ed is torsion free for all
integral d > 2, Elliptic curves in families of cubic twists is really one ranks of this question.

In particular, parameterized solutions to X3+ Y3= Z3+ W3 award us families of elliptic

curves with rank at least two.

Let
P1= (x1(T),y1(T)) = (6T2- 4T + 4, -3T2- 5T + 5), and
P2= (x2(T),y2(T)) = (4T2- 4T + 6, 5T2- 5T - 3) and

Then
k(T) = 63(3T2-3T+1)(T2+T+1)(T2-3T+3)
Then
x1(T)3+y1(T)3=k(T)=x2(T)3+y2(T)3.

5.13 The K3-Surfaces

78
 An elliptic surface is X3+Y3= k(T), which turns out to be a K3 surface. By André Weil in
1958 defined the k3 surface, have become fundamental objects in string theory, moonshine,
arithmetic geometry, and number theory.

Theorem

The smooth minimal surface associated with the equation X3+Y3=k(T) is an elliptic k3-
surface with picard integer 18 over 𝑄.

Proof of theorem:

Background

In every position P=(x(T),y(T))in Ek(T) (Q(T)), In define an element ϕp of MorQ(C,E), Here

E/Q is specified by X3+Y3= k(T) as in the introduction, by

ϕp(T,S)=(x(T)/S,y(T)/S).

Followed by the map

λ: Ek(T)(Q(T))→H0(C, Ω1𝑐/𝑄 ) is given by λ(p)= ϕ∗𝑝 ωE.

Rank at least two

Show that the rank is at least 2. That image to check the differentials is linearly
independent. Compute that,
5S(6T + 5)
ϕ∗𝑝1ωE = dT and
4(3T2−2𝑇+2)2

5S(2T − 1)
ϕ∗𝑝2ωE = dT,
4(2𝑇2+2𝑇+3)2

Rank at the Most Two

79
 To show that rank is at most two, reduce the curve modulo a prime p. Over a function field
Fp(T), it is known that the rank is at most the order of vanishing of the L- function, and so can get
an upper bound on the rank of the reduced curve by computing its L-function in Magma.

The prime of good reduction p = 17, the L-function factors as

(17T - 1)2(17T + 1)2(83521T4+ 34T2+ 1),
Over Fp(T) that the rank is at most 2. On Computing ranks of the elliptic curves for more
details get the function field in this manner.

Since, reducing mod p cannot reduce the rank, this shows that the rank over Q(T)is
at most 2.

The k3 Surfaces

The K3 surface is a smooth minimal complete surface that is regular and has trivial
canonical bundle. For examples of K3 surfaces include intersections of three quadrics in P5,
intersections of a quadric and a cubic in P4, and non-singular degree 4 surfaces in P3.

80
 CONCLUSION
Discussed the first chapter was basic concepts of number theory with the related
definition, Ramanujan numbers explained with formula based, indicated of Ramanujan note
books, and applications of the number theory.
Explained was clearly shown that there cannot existed whichever number could be
expressed as sum of two numbers both are in power form of equal even exponents greater than
two or more ways. The least number was 1729, and the characteristic of a number to produced
such type of relational discussed in the second chapter.

In the second stage discussed was evidently revealed that there cannot existed any
number which could subsisted articulated as addition of two statistics mutually are in influenced
appearances of identical smooth exponents larger than in two or more ways. Odd all expounded
three is the least amount. The smallest number was 1729, and the characteristic of a number to
manufacture such form of qualified.

Discussed the 3rd chapter different ordered of n was n x n matrix contained

integer that each rows and columns inserted up to the same valued. Defined the Eigen values and
the dot products of third ordered magic squares used some of the properties. Shown that, ,
(i) R1 . C2 =R1 . C3 = R2 . C1 = R2 . C3 = R3 . C1 = R3 . C2.

(ii) R1 . R2 . R3 = C1 .C2 . C3
In consulted the fourth chapter, “The smallest number expressed the calculation of two
cubes at the different ways”. The number was called Taxicab(2)=1729=93+103=13+123,
Taxicab(n) being the smallest number expressible in n ways as a sum of two cubes and it could
generalized the problem by difference of cubes, Cabtaxi(n) was the smallest number expressible
in n ways as a addition or difference of two cubes.
The fifth period was discussed reveals that studying Euler’s Diophantine equation
a2+b2=c2+d2 it turned absent that worked anticipated profound structures and phenomena which
have became fundamental objects in arithmetic geometry and number theory. In discovered a k3
surface with Picard number 18 could be there used to obtain infinitely many cubic twists over Q
with rank ≥2.

81
 REFERENCES

1. Lokenath Debnath “Srinivasan Ramanujan (1887-1920) and the theory of partition of

number and statistical mechanics a centennial tribute” vol.10, No.4, PP.(625-640)
(1987).
2. Jonathan Sondow, John W.Nicholson & Tony D.Noe “Ramanujan prime Bound, Runs,
Twins & Gaps Jonrual of integer sequence” vol.14, Article 11.6.2, (2011)
3. Vigyan prasar “Dream 2047, A prime on prime numbers” vol.14, No.7, ISSN: 0972-
169x.
4. Cristian S.Calude, Elena Calude, Michael J.Dinneen, “What is the value of taxicab(6)?”,
Journal of universal computer science, vol.9, No.10,(2003).
5. Deo Brat ojha, B.L.kaul, “Generalization of 4ҳ4 magic square”, International journal of
applied engineering research, Dindugul, Vol.1, No.4, 2011.
6. Debajit das, “Mytery of Ramanujan number”, International journal of scientific &
Engineering Research, PaperID I044951-vol.5, Issue 4, April 2014.
7. Sreeranjini K.S, V.Madhukar Mallaya, “Eigen values and dot products of third order
magic squares”, IJMMS, vol.8, No.1, PP.21-27, June 2012.
8. Saleem sh.Al-Ashhab, “The problem of counting semi pandiagonal magic squares”,
Proceedings of the international multiconference of engineers and computer scientists
2016 vol. II, IMECS 2016, March 16-18, 2016,Hong kong.
9. A.J.Hildebrand, Math 453: “Elementary number theory definition and theorems”
Version 5-4-2011..
82
10. Christian Boyer “New Upper Bounds for Taxicab and Cabtaxi Numbers” Journal of
integer sequences, vol.11, Article 08.1.6, 2008.
11. Ken ono and sarah Trebat- Leder “The 1729 K3 Surface” Ono and Trebat- Leder Res.
Number Theory (2016) DOI 10.1007/s40993-016-0058-2
12. Dicson L.E; History of the theory of numbers, vol.II: Diophantine analysis, Dover
publications, Mineola (2005)
13. Anthony Varilly Alvarado “Arithmetic of k3 surfaces
14. Matthew Curtis and Gurudeo Anand Tularam “The importance of Numbers and the
Need to Study Primes: The Prime Questions” Journal of Mathematics and Statistics
Vol.7, No.4, PP. 262-269, 2011, ISSN 1549-3644.
15. Bruce C.Berndt, “Ramanujan note book” spring-verlag, New York, 1985.
16. S.A1-Ashhad, “Magic square 5x5,” the international journal of applied science and
computations, 2008, Vol.15, No. 1, PP.53-64.
17. S. A1-Ashhab “Magic square of order six,” Research open journal of information
science and application, 2013, Vol.1, No.1, PP. 01-19.
18. Oliver couto “Taxicab Equations for power two, three, four &five” International
Mathematical Forum, Vol.9, No.12, PP.561-577, 2014.
19. C.K.Neeradha, & Dr.V.Madhukar Mallayya “General properties of strongly magic
squares” International Journal of Scientific and innovative mathematical research
(IJSIMR) vol.4, issue 8, PP.7-14, August 2016.
20. Meenu Sahni and D.B.Ojha “Magic Square and Cryptography” Journal of global
Research in computer Science, vol.3, No.12, Dec 2012.

83