Scribd
Upload
186 views

Problems Number Theory

Here are some problems in number theory composed by the author. The problems cover a range of topics including perfect cubes, perfect powers, Euler's totient function, Fermat numbers, orders of elements, and perfect numbers. Notations used include sets of natural numbers, integers, prime numbers, divisibility, and greatest common divisors. References are provided for some problems that were previously posted online.

Uploaded by

zhazzu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
186 views

Problems Number Theory

Here are some problems in number theory composed by the author. The problems cover a range of topics including perfect cubes, perfect powers, Euler's totient function, Fermat numbers, orders of elements, and perfect numbers. Notations used include sets of natural numbers, integers, prime numbers, divisibility, and greatest common divisors. References are provided for some problems that were previously posted online.

Uploaded by

zhazzu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Some Own Problems In Number Theory

Mathmdmb
March 31, 2011
Here are some problems composed by me.And the problems or their solutions
have not been approved by someone else.So if any fault occurs,I shall take the
whole responsibility.In this case,please inform me.Among the problems,many
were posted by me in AoPS.So,I thank the mathlinkers who psted replies and
solutions there.A notable fact is, I put the problems not in order to difficulty,just
randomly-which I thought to be interesting.

Notations

I have used notaions which are used as usual.If not stated in a problem,then the
variables are to be assumed positive integers.Otherwise they are stated.Here the
notations are:
N = {1, 2, ...., n, ...} the set of all natural numbers or positive integers or
positive whole numbers.
Z = {......, 2, 1, 0, 1, 2, .....} the set of all integers(all positive,negative,including
non-negative 0).
N0 = {0, 1, 2, .....} the set of all non-negative integers.
a A a is an element of A.
p prime.
a|b a divides b,i.e. b gives remainder 0 upon division by a.There is another
.
notation on this-b..a means b is divisible by a.But we shall use the widely used
first notation here.
a 6 |b a does not divide b.
a|b c a divides both a and c.
gcd(a, b) = g g is the greatest common divisor of a and b.In other words,g
is the largest positive integer such that g|a b.
(m) the number of positive integers less or equal to m and co-prime to
m.It is called Eulers Totient Function or Eulers Phi Function,shortly
phi of m.
n, k :for all n,there exists k such that.
bxc greatest integer function.bxc is the largest integer less or equal to x.

Problems

Problem 1:
Prove that there exist no (n, m) N so that n + 3m and n2 + 3m2 both are
perfect cubes.Find all such (m, n) if (m, n) Z.
Problem 2:
Find all primes p such that 11p + 10p is a perfect power.(A positive integer is
called perfect power if it can be expressed as mk for some natural k > 1.).
Problem 3:
In a single person game,Alex plays maintaining the following rules:
She is asked to consider the set of all natural numbers less than n on a board.Then
she starts from 1 and whenever she gets an integer co-prime to n,she writes 1 on
the board,otherwise she writes 0.That is she will write a binary sequence with
either 1 or 0.
She denotes the number of 10 s in this binary sequence of n by 1 (n) and the
number of 00 s by 0 (n).
Now,she wins if she can choose an n having at least 2 prime factors in the first
choice such that 1 (n)|n.Prove the following:
? 1 :There exist infinitely many n such that she can win in the first move.
? 2 :If she chooses
an n having
Qn
Qn more than 3 prime factors,she cant never win.
i
? 3 :If n = i=1 pai ,then i=1 pai i 1 |0 (n).
? 4 :Find all such n such that she can win.
Problem 4:
n
m
n
Let Fn = 22 + 1 be the n th Fermat number.Prove that 22 +2 |FnFm 1
1m,n .
Problem 5:
Prove that for a > 2, aa1 1 is never square-free.A number is called squarefree if it has no square factor i.e. for no x, it is divisible by x2 .
Problem 6:
5
5
Show that aa3 b+b
3 +1 is a perfect cube for an infinite (a, b) whenever it is an integer.
Problem 7:
Prove that for all odd p 6 |c, ordpk (c) = ordp (c).pk1 .If x is the smallest integer
such that ax 1 (mod m),then x is called the order of a modulo m.And we
write it,ordm (a) = x.
Problem 8:
Show that for all prime p 2 (mod 3),there exists a complete set of residue
class of p such that the sum of its elements is divisible by p2 .
Problem 9:
For all n N0 ,prove that 81|10n+1 10 9n.
Problem 10:
Find all n such that n|2n! 1.
Problem 11:
Find all n such that (a).n|2n + 1, (b).n| 3n + 1.
Problem 12:
A number is called a perfect number if the sum of its proper divisors(i.e.
divisors less than the original number) is equal to the initial number.Determine
2

all perfect numbers having p factors(if there exists).


Problem 13:
Prove that,a number having only one prime factor cant be perfect.
Problem 14:
Find all (a, b) such that ab|a3 + b3 .
Problem 15:
Solve in positive integers:a7 + b7 = 823543(ac)1995 .
Problem 16:
Find all n such that (a).n2 27n + 182,(b).n2 27n + 183 is a perfect square.
Problem 17:
Find all (a, b) N0 such that 7a + 11b is a perfect square.
Problem 18:
Consider a complete set of residues modulo p.show that we can partition this set
into two subsets with equal number of elements such that the sum of elements
in each set is divisible by p.
Problem 19:
Let ai , m be positive integers such
Qn that ai + m is a prime for all 1 i n.Take
the number N such that N = i=1 pai i .Let S be the number of ways to express
N as a product of m positive integers.Prove that mn |S.
Problem 20:
n+k
n
> b m
.
Prove that n, k : b m
nc
n+kc
Problem 21:
Find all (a, b, c, d) Z such that abc d = 1, bcd a = 2.

References

[1] Amir Hossein Parvardi(amparvardi in AoPS),Lifting The Exponent Lemma


(LTE).
AoPS topic # 393335, Lifting The Exponent Lemma (Containing PDF file),
posted by amparvardi. http://www.artofproblemsolving.com/Forum/viewtopic.php?t=393335
Santiago Cuellar, Jose Alejandro Samper, A nice and tricky lemma (lift- ing the
exponent), Mathematical Reflections 3 2007.

Problem 1AoPS topic # 356847,n + 3 perf ectcube,posted by mathmdmb.


http://www.artofproblemsolving.com/Forum/viewtopic.php?f=57t=356847hilit=both+perfect+cub
Problem 2AoPS topic # 36224,perf ectpower,posted by mathmdmb.
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=57t=362224hilit=perfect+power
Problem 5AoPS topic # 393335,Lif tingT heExponentLemma,posted by amparvardi.
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=721t=393335start=20
Problem 7AoPS topic # 374822,CW M O2011,posted by chaotici ak.
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=57t=374822hilit=CWMO+2010
P roblem8-AoP Sblog#85314,The Law Of Nature-Number Theory, postedbymathmdmb.
http://www.artofproblemsolving.com/Forum/blog.php?u=85314
P roblem16-AoP Stopic#356079,Find all n, postedbymathmdmb.
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=57t=356079hilit=find+all+n
P roblem17-AoP Stopic#304361,Problem 202, postedinN umberT heoryM arathonbymathmdmb.
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=151t=304361start=720

You might also like