135 views

Uploaded by Ashwin Gokhale

Greatest Integer Function Rules

- Challenging Problems in Sequences and Series- Special Hl Level Sums
- Improper Integrals
- Affinity Geometry
- Calculus Challenge Problems
- Domain and Range Pictionary Game
- Student Solution's Manual for Elementary Number Theory with Application by Thomas Koshy
- ArcTan, ArcCos, ArcSin
- C Sharp Tutorial
- A 4-7 - Greatest Integer Function
- Trogonometric Problems With Solutions
- Affine Geometry
- 3D Shapes Book
- Math Worksheet-Domain and Range
- Inequalities Through Problems by Hojoo Lee
- M408L Exam 3
- Tensor Analysis on Manifolds
- Challenge Set #1
- inequalities in maths solved
- Open Problems in Topology by Jan Van Mill
- Problems in Calculus

You are on page 1of 5

Denition. For a real number x, denote by x the largest integer less than or

equal to x.

A couple of trivial facts about x:

x is the unique integer satisfying x 1 < x x.

x = x if and only if x is an integer.

Any real number x can be written as x = x + , where 0 < 1.

Some basic properties, with proofs left to the reader:

Proposition 1. For x a real number and n and integer:

1. x + n = x + n.

2. x =

_

x if x = x,

x 1 if x = x.

3. x/n = x /n if n 1.

4. 2x = x +

_

x +

1

2

_

. More generally,

nx =

n1

k=0

_

x +

k

n

_

.

The Legendre formula gives the factorization of n! into primes:

Theorem 1 (Legendre Formula). For n a positive integer,

n! =

pprime,pn

p

(p)

where

(p) =

k=1

_

n

p

k

_

.

Note that the sum for (p) is nite, and that (p) is the highest power of p that

divides n!.

Proof. Among the rst n positive integers, those divisible by p are p, 2p, . . . , tp,

where t is the largest integer such that tp n; in other words, t is the largest

integer less than or equal to n/p, so t = n/p. Thus there are exactly n/p

multiples of p occurring in the product that denes n!, and they are

p, 2p, 3p, . . . ,

_

n

p

_

p.

With the same reasoning, the numbers between 1 and n which are divisible by

p

2

are

p

2

, 2p

2

, . . . ,

_

n

p

2

_

p

2

and there are

_

n/p

2

_

of these. Generally,

_

n/p

k

_

are divisible by p

k

and so the

total number of times p divides n! is

(p) =

k=1

_

n

p

k

_

.

All of this material can be found in a good book on number theory, for

example Burton, Elementary Number Theory. A deeper treatment is in Apostol,

Introduction to Analytic Number Theory.

Exercises

1. Prove the statements in Proposition 1.

2. If 0 < y < 1, what are the possible values of x x y?

Solution. Always 1 is possible, and also 0 unless x is an integer.

3. Let {x} = x x denote the fractional part of x. What are the possible

values of {x} + {x}?

Solution. 0 if x is an integer, 1 otherwise.

4. Prove that 2x 2 x is either 0 or 1.

5. Prove that 2x + 2y x + y + x + y.

6. For an integer n 0, prove that n/2 n/2 = n.

7. For an integer n 1, the number of digits (in base ten) of n is 1 +

log

10

(n).

Problems

1. How many zeros does the number 1000! end with?

Solution. One must nd out how many factors of 10 are in 1000!. There

will be more factors of 2 than 5, so compute the number of factors of ve:

_

1000

5

_

+

_

1000

25

_

+

_

1000

125

_

+

_

1000

625

_

= 200 + 40 + 8 + 1 = 249.

There are 249 zeros at the end of 1000!.

2. If n is a positive integer, prove that

_

n +

n + 1

_

=

_

4n + 2

_

.

Solution. First, (

n+

n + 1)

2

= 2n+2

n

2

+ n+1. Now, n

2

< n

2

+n <

(n + 1/2)

2

so that n <

n

2

+ n < n + 1/2. Then,

4n + 1 <

n +

n + 1 <

4n + 2.

Squares are always odd or divisible by 4, so 4n+2 is never a square. Then

_

4n + 1

_

=

_

4n + 2

_

and so

_

n +

n + 1

_

=

_

4n + 2

_

.

3. Determine all positive integers n such that

n divides n.

Solution. When n = k

2

, n = k(k +1), or n = k(k +2) = (k +1)

2

1.

4. If n is a positive integer, prove that

_

8n + 13

25

_

_

n 12

_

n17

25

_

3

_

is independent of n.

Solution. Bring the rst term inside, get a common denominator. Check

that its periodic mod 25, then check for n = 0, . . . , 24.

5. Prove that

n

k=1

_

k

2

_

=

_

n

2

4

_

.

Solution. Easy to do in two cases, n even or n odd, using 1 + + m =

m(m+1)

2

.

6. A sequence of real numbers is dened by the nonlinear rst order recur-

rence

u

n+1

= u

n

(u

2

n

3).

(a) If u

0

= 5/2, give a simple formula for u

n

.

(b) If u

0

= 4, how many digits (in base ten) does u

10

have?

Solution. Prove by induction that if u

0

=

d

2

+1

d

then u

n

=

d

23

n

+1

d

3

n . In par-

ticular, for u

0

= 5/2, u

n

=

4

3

n

+1

2

3

n . For part (b), there are

_

3

10

log

10

(2 +

3)

_

+

1 digits. (MIT 18.S34 F07).

7. Which positive integers can be written in the form n +

n + 1/2 for

some positive integer n?

Solution. Looks like all but the squares. Havent proved it yet. (MIT

18.S34 F07).

8. Prove that the sequence

__

(

2)

n

__

n=0

contains innitely many odd num-

bers.

Solution. (

2)

n

is even (a power of 2) when n is even. When n = 2k+1 is

odd, (

2)

n

= 2

k

2. Now

_

2

k

2

_

is odd exactly when the k

th

binary digit

of

2 is 1. Since

many 1s. (Original, inspired by the Graham-Pollak sequence).

9. Determine whether the improper integral

_

0

(1)

x

2

dx

converges or diverges, where is the greatest integer function.

Solution. It converges. For

n x <

n + 1, we have x

2

= n, so that

_

0

(1)

x

2

dx =

n=0

(1)

n

(

n + 1

n).

Since the series is alternating and its terms approach zero, it converges.

Source: Youngstown State Calculus Competition, 2005.

10. Let {x} denote the distance between the real number x and the nearest

integer. For each positive integer n, evaluate

F

n

=

6n1

m=1

min

__

m

6n

_

,

_

m

3n

__

.

(Here min(a, b) denotes the minimum of a and b.)

Solution. Putnam 1997 B1

11. Let a, b, c, d be real numbers such that na + nb = nc + nd for all

positive integers n. Prove that at least one of a + b, a c, a d is an

integer.

Solution. (MIT 18.S34 F07)

12. Dene a sequence a

1

< a

2

< of positive integers as follows. Pick

a

1

= 1. Once a

1

, . . . , a

n

have been chosen, let a

n+1

be the least positive

integer not already chosen and not of the form a

i

+ i for 1 i n. Thus

a

1

+ 1 = 2 is not allowed, so a

2

= 3. Now a

2

+ 2 = 5 is not allowed, so

a

3

= 4. Then a

3

+ 3 = 7 is not allowed, so a

4

= 6, etc. The sequence

begins:

1, 3, 4, 6, 8, 9, 11, 12, 14, 16, 17, 19, . . .

Find a simple formula for a

n

. Your formula should enable you, for in-

stance, to compute a

1000000

.

Solution. (MIT 18.S34 F07)

13. For a positive real number , dene

S() = {n : n = 1, 2, 3, . . . } .

Prove that {1, 2, 3, . . . } cannot be expressed as the disjoint union of three

sets S(), S(), and S().

Solution. Very hard! (Putnam 1995 B6)

- Challenging Problems in Sequences and Series- Special Hl Level SumsUploaded bysriramaniyer
- Improper IntegralsUploaded byhyd arnes
- Affinity GeometryUploaded bysvsreerama
- Calculus Challenge ProblemsUploaded byMichelle Hsieh
- Domain and Range Pictionary GameUploaded byjomalleyiv
- Student Solution's Manual for Elementary Number Theory with Application by Thomas KoshyUploaded byJeremy John S
- ArcTan, ArcCos, ArcSinUploaded bybluebird1969
- C Sharp TutorialUploaded bydanielle leigh
- A 4-7 - Greatest Integer FunctionUploaded byrcarteaga
- Trogonometric Problems With SolutionsUploaded byFernandoDiaz
- Affine GeometryUploaded bybadrun_bbest7130
- 3D Shapes BookUploaded bykristyhelms
- Math Worksheet-Domain and RangeUploaded byEducareLab
- Inequalities Through Problems by Hojoo LeeUploaded bySM200
- M408L Exam 3Uploaded byNathan Thai
- Tensor Analysis on ManifoldsUploaded byTint Tiger
- Challenge Set #1Uploaded byAllison Cuttler
- inequalities in maths solvedUploaded byVinay Punjabi
- Open Problems in Topology by Jan Van MillUploaded byjiro74
- Problems in CalculusUploaded byJefrey Gamban
- The Differences Between Affine Space and Vector SpaceUploaded byconmec.crpl
- Lipschutz-SchaumsTheoryAndProblemsOfSetTheoryUploaded byantoscri
- Romanian Problem BookUploaded bySM200
- Euclid.SpacesUploaded bygeorgallidesmarcos
- Louis H. Kauffman- Knot Theory Notes - Detecting Links With The Jones PolynonmialUploaded byOkomm
- 27714489 Difficult IntegralUploaded byJiri Cepak
- Basic Hypergeometric SeriesUploaded byrgkelly62
- Solved Problems in Improper IntegralsUploaded byTarniceru Iuliana
- Pointset TopologyUploaded bytbrackman99
- Notes-2012 Manifold w ExcerUploaded byhammoudeh13

- Hospital Management System Database Design is Uploaded in This PageUploaded byAsad Raza
- ODI Integration With OBIEEUploaded byprakashrbv
- The HOLY TRINITY in Destruction of Sodom and GomorraUploaded byRans M Ney
- ESOL Learner Materials- Level 2, Unit 1Uploaded byOlga Tiu
- TILLEMANS BIBLIOUploaded byvasubandhu
- Essbase Error Message Reference 11.1.2.3Uploaded bysuchai
- Lannon 1-34Uploaded byNun your biz
- An etude on speech synthesis with instruments: An additive synthesis approachUploaded byCamilo Ignacio Leal Molina
- Exam ReviewUploaded byEdurne De Vicente Pereira
- Dll Week 1 Quarter 1 English 9Uploaded byFelix Ray Dumagan
- The Life of Captain Cipriani by C. L. R. James IntroUploaded byDuke University Press
- Kyle InterviewUploaded bySabahheta Kurtovic
- Tshoot Chapter 3 Ccnp 6Uploaded byWaleed Naser
- scada system.pdfUploaded bygliz
- ChildhoodUploaded bycheekymice
- BI Design best practicesUploaded byraj_sristi
- Kumpulan Judul Skripsi Pendidikan Bahasa Inggras LengkapUploaded byDendi Tri Utama
- Full Final Exam Form 4 2006Uploaded byNor Faridah Yahya
- isfa600_v2r3.pdfUploaded byFutebol Coerente
- Alexandru Gica - Rational Points on Elliptic Curves.pdfUploaded byPulseczar Alexander
- Quran HadithUploaded byUmer Masood
- Anuradha PuraUploaded byopel1
- Complete Spanish Transcript - (September 5 2017)Uploaded byMihalis Eleftheriou
- _PART-1_IUPAC Nomenclature of Saturated Hydrocarbons _AlkaneUploaded bySankar Kumarasamy
- Scrivener Editorial Workflow eBookUploaded byJeremy Thomson
- Rich Automata Solns-copyUploaded byAsha
- The Dongan Ancestry: roots of the Limerick EarldomUploaded bySteven S. Green
- DataBase SpecificationUploaded byk2sh
- discussion forum week 11Uploaded byapi-201648540
- Investigating Diversity in Family Lifestyle, Introduction (Day 1)Uploaded byShannon Duncan