Mathematical-Reasoning · Unit 20 · Video 2 · Interactive Practice

Functions Without Formulas: Birthdays and Sums of Divisors

IKey Formulas

StatementMeaning
b(Andrew Wiles)=April 11b(\text{Andrew Wiles}) = \text{April } 11Birthday function: the input (a person) goes inside the parentheses, the output (a month and day, an element of the codomain) on the right
s(n)=s(n) = the sum of the distinct natural-number divisors of nn, e.g. s(6)=1+2+3+6=12s(6) = 1 + 2 + 3 + 6 = 12Sum of the divisors function, with domain and codomain N\mathbb{N}
pp prime ⇒s(p)=1+p\Rightarrow s(p) = 1 + p;   n>1⇒s(n)≥1+nn > 1 \Rightarrow s(n) \ge 1 + nA prime has exactly the divisors 11 and pp; any n>1n > 1 has at least the two divisors 11 and nn
For each yy in the codomain there exists xx with f(x)=yf(x) = y;   if x1≠x2x_1 \ne x_2, then f(x1)≠f(x2)f(x_1) \ne f(x_2)Two questions to ask of any function; neither is part of the definition

Key Insight: A function needs only a domain, a codomain and a rule giving each input exactly one output, and the rule can be a sentence. Two inputs may share an output, and an element of the codomain may be the output of no input at all.

IIThe Birthday Function: 366 Days, 367 People

Spread birthdays out as far as possible: 366 people can avoid sharing a day, but 367 cannot.

IIIComputing s(n)s(n) from Its Divisors

Each nn has one list of divisors and so one sum; a prime sits exactly on the bound 1+n1 + n.

IVIs mm an Output of ss?

Since s(n)≥1+ns(n) \ge 1 + n for n>1n > 1, deciding whether s(n)=ms(n) = m has a solution takes only finitely many checks.

VQuiz Questions

Problem 1 · Writing a Fact in Function Notation

Given: the birthday function bb, whose domain is the set of all people and whose codomain is the set of the 366366 days of a leap year. The mathematician Emmy Noether was born on March 23, 1882. Which line writes this fact in function notation?

✅ Correct! The input is the person, and the output is a month and day, which is an element of the codomain.
❌ Input and output are swapped. The inputs of bb are people, so the person goes inside the parentheses. A day is not an element of the domain.
❌ The year is not a possible output. The codomain contains only months and days, so "March 23, 1882" is not one of its elements, even though the year is a true fact about her.
❌ A year is not an element of the codomain. The outputs of bb are days of a leap year (a month and a day), so the output here is March 23.
Show solution

Function notation puts an input inside the parentheses and its output on the right. The input of bb is a person, so the input is Emmy Noether. The output is that person's birthday as a month and a day:

b(Emmy Noether)=March 23.b(\text{Emmy Noether}) = \text{March } 23.

The year 1882 is true but does not appear: an output must be an element of the codomain, and the codomain contains only the 366366 months-and-days of a leap year.

Problem 2 · Computing a Value of ss

Given: s(n)s(n) is the sum of the distinct natural-number divisors of nn. Find s(18)s(18).

✅ Correct! The divisors of 1818 are 1,2,3,6,9,181, 2, 3, 6, 9, 18, and they add to 3939.
❌ That formula is for primes. s(p)=1+ps(p) = 1 + p holds only when pp is prime; 18=2⋅918 = 2 \cdot 9 has more divisors than 11 and 1818.
❌ 1818 itself is missing. 1+2+3+6+9=211 + 2 + 3 + 6 + 9 = 21 leaves out the divisor 1818; every nn divides itself, so nn is always in the sum.
❌ A divisor is missing. 1+2+3+9+18=331 + 2 + 3 + 9 + 18 = 33 leaves out 66, which divides 1818 because 18=6⋅318 = 6 \cdot 3.
Show solution

List the natural numbers that divide 1818 by pairing each divisor dd with 18/d18/d:

18=1⋅18=2⋅9=3⋅6,18 = 1 \cdot 18 = 2 \cdot 9 = 3 \cdot 6,

so the divisors are 1,2,3,6,9,181, 2, 3, 6, 9, 18. Adding them,

s(18)=1+2+3+6+9+18=39.s(18) = 1 + 2 + 3 + 6 + 9 + 18 = 39.

Since 1818 is not prime, s(18)s(18) is more than 1+18=191 + 18 = 19, as the bound s(n)≥1+ns(n) \ge 1 + n predicts.

Problem 3 · Thirteen People, Twelve Months

Given: a club has 1313 members. The function mm assigns to each member the month in which that member was born; its domain is the set of the 1313 members and its codomain is the set of the 1212 months. Which statement must be true?

✅ Correct! There are 1313 inputs and only 1212 possible outputs, so two different members x≠yx \ne y must have m(x)=m(y)m(x) = m(y).
❌ Not forced. All 1313 members could be born in January; then the other 1111 months are the output of no input, and mm is still a function.
❌ Shared outputs are allowed. The definition asks only that each input have exactly one output. Two members with the same birth month break nothing; one member with two birth months would.
❌ Not forced. Two members born in January, two in February and one in each of nine other months make 1313 members with two shared months.
Show solution

(b) must hold. Each of the 1313 members has exactly one birth month, one of only 1212 months. If all 1313 outputs were different, the codomain would need at least 1313 elements. So some month is the output for two different members x≠yx \ne y: m(x)=m(y)m(x) = m(y).

(a) can fail: if all 1313 were born in January, no member has a birth month of February.

(c) is false: mm is a function, since each member has exactly one birth month. Two inputs sharing an output is allowed.

(d) can fail: with 22 members born in January, 22 in February, and 11 in each of March through November (2+2+9=132 + 2 + 9 = 13), two months are shared.

Problem 4 · Is 10 an Output of ss?

Given: s(n)s(n) is the sum of the distinct natural-number divisors of nn, for n∈Nn \in \mathbb{N}. Decide: is there a natural number nn with s(n)=10s(n) = 10?

✅ Correct! The bound s(n)≥1+ns(n) \ge 1 + n turns an infinite question into nine checks, and the outputs 1,3,4,7,6,12,8,15,131, 3, 4, 7, 6, 12, 8, 15, 13 miss 1010.
❌ 99 is not prime. Its divisors are 1,3,91, 3, 9, so s(9)=13s(9) = 13; the rule s(p)=1+ps(p) = 1 + p applies only to primes.
❌ That adds every number up to 44. 33 does not divide 44; the divisors of 44 are 1,2,41, 2, 4, so s(4)=7s(4) = 7.
❌ Only finitely many nn need checking. For n>1n > 1 the two divisors 11 and nn give s(n)≥1+ns(n) \ge 1 + n, so s(n)=10s(n) = 10 forces n≤9n \le 9.
Show solution

If n=1n = 1, then s(1)=1≠10s(1) = 1 \ne 10. If n>1n > 1, then 11 and nn are two different divisors of nn, so s(n)≥1+ns(n) \ge 1 + n. Suppose s(n)=10s(n) = 10 with n>1n > 1; then 1+n≤101 + n \le 10, so 2≤n≤92 \le n \le 9.

Checking these:

s(2)=3,s(3)=4,s(4)=7,s(5)=6,s(6)=12,s(2) = 3,\quad s(3) = 4,\quad s(4) = 7,\quad s(5) = 6,\quad s(6) = 12, s(7)=8,s(8)=15,s(9)=13.s(7) = 8,\quad s(8) = 15,\quad s(9) = 13.

None equals 1010, so no natural number nn has s(n)=10s(n) = 10: 1010 is an element of the codomain N\mathbb{N} that is the output of no input.

Solved: 0 / 4