Scribd
Upload
4 views1 page

Number Theory Assignment Problems

The document is an assignment for a Number Theory course by Dr. Qurat-ul-Ain Azim, dated December 27, 2018. It contains five distinct problems related to number theory, including proving properties of sequences, exploring bijections, and finding unique integers with specific divisibility properties. The problems require mathematical proofs and explorations of integer properties.

Uploaded by

maan khan
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Number Theory Assignment Problems

The document is an assignment for a Number Theory course by Dr. Qurat-ul-Ain Azim, dated December 27, 2018. It contains five distinct problems related to number theory, including proving properties of sequences, exploring bijections, and finding unique integers with specific divisibility properties. The problems require mathematical proofs and explorations of integer properties.

Uploaded by

maan khan
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Number Theory Assignment 1

Dr. Qurat-ul-Ain Azim


December 27, 2018

Problem 1

Prove that all numbers in the sequence


107811 110778111 111077781111
, , ,...
3 3
are perfect cubes.

Problem 2

Does there exist a bijection f : N → N such that for every positive integer n, the sum
f (1) + f (2) + . . . + f (n) is divisible by n?

Problem 3

Find all positive integers n such that there exists a unique integer a such that 0 ≤ a < n!
with the following property:
n!|an + 1.

Problem 4

Find all ordered pairs of positive integers (m, n) such that mn − 1 divides m2 + n2 .

Problem 5

Let n be a positive integer and let f (n) denote the last non-zero digit in the decimal expansion
of n!. For instance, f (5) = 2.
(i) Show that if a1 , a2 , . . . , ak are distinct non-negative integers, then f (5a1 +5a2 +. . .+5ak )
depends only on the sum a1 + a2 + . . . + ak .
(ii) Assuming part (i), we can define g(s) = f (5a1 + 5a2 + . . . + 5ak ), where s = a1 + a2 +
. . . + ak . Find the least positive integer p for which g(s) = g(s + p), for all s ≥ 1, or
else prove that no such p exists.

You might also like