Integermania! -
Exquisiteness
-- Definition -- Levels
-- Sets --
Calculator
--
Creating mathematical expressions for Integermania is
easy, but creating beautiful expressions is more difficult. First, we have
to agree on what constitutes an beautiful expression. Although
beauty (in math, we often say "elegance") is in the eye of the beholder, on this site we
have attempted to systematize the "exquisiteness" of a solution to the number
problems. (We have chosen to avoid defining the term "elegance",
instead leaving its connotations of beauty to the subjective realm of
mathematics appreciation it already occupies.)
Let a, b,
c, and d represent required integers. The exquisiteness
of a solution is the highest level operation used in its construction, as
given by the following table of levels of operations, plus a possible surcharge. (The background color coding,
beginning with the royal purple, moving through the rainbow to yellow and then
fading out, is also used in the solutions.) The surcharges are:
- + 0.2 for each unary operation used
- + 2.0 + 2("error") for the existence of rounding in a solution, where
"error" is the difference between the rounded and unrounded values of the
solution (note that rounding will also incur
unary operation surcharges)
We can also define the exquisiteness of an entire set of numbers, according
to the ability in which the smallest positive integers can be created using
values from that set. The exquisiteness of a set of numbers A at level L is
the largest positive integer nL having the property that for every
positive integer less than or equal to nL there exists a solution to the
Integermania problem using set A with exquisiteness level less than
L+1. Notationally, we can write:
Exq(A,L) = nL, or
Exq(A) = {n1,n2,...,nL,...}.
Levels of Exquisiteness (modified as of January,
2007)
| Level 1: The basic
operations and grouping symbols.
|
- Addition: a + b
- Subtraction: a – b
- Opposite: – b (will be surcharged)
- Multiplication: a × b
- Division:

- (Parentheses)
|
| Level 2: Common operations
involving place value.
|
- The decimal point: .a (2.3 will not be surcharged, but
.3 will)
- The bar for a repeating decimal:
(will be surcharged)
- The percent sign: a% (will be surcharged, equivalent to 0.01a)
- Juxtaposition: ab (equivalent to 10a+b)
|
| Level 3: Exponents,
radicals, factorials, and per mille. |
- Exponents: ab
- Radicals:
,
(if the index is assumed, it will be surcharged)
- Factorials: a! (will be surcharged)
- Per mille: a‰ (will be
surchaged, equivalent to 0.001a)
|
| Level 4: Basic algebraic
functions. (All will be surcharged except as noted.)
|
- Logarithms: logba, log a, ln a
(if an explicit base is used, it will not be surcharged.)
- Exponentials: exp a (equivalent to ea, but e is a constant, and
therefore prohibited)
- Trigonometrics: sin a, cos a, tan a, cot a,
sec a, csc a
- Inverse trigonometrics: arcsin a, arccos a, arctan a,
...
- Hyperbolics: sinh a, cosh a, tanh a, coth a,
sech a, csch a
- Inverse hyperbolics: arcsinh a, arccosh a, arctanh a,
...
|
| Level 5: Some arithmetic
operations.
|
- Binomial coefficients: aCb
- Permutations: aPb
- Gamma: Γ(a). When a is a positive integer,
then Γ(a) = (a – 1)! (will be surcharged)
- Greatest common divisors and multiples: gcd(a,b), lcm(a,b)
- Division modulo b: a mod b (the remainder
after dividing a by b)
- Summations:

- Determinants:

- Change of base: ab (the number obtained by using the numeral a in the base b
numeration system)
|
| Level 6: Some basic
sequences and number theory functions. (All will be surcharged.)
|
- Sequence of prime numbers: pa (the ath prime number)
- Fibonacci sequence: fa (the ath term of the Fibonacci sequence)
- Prime Counting Function: π(a),
the number of primes at most a
- Number of divisors of a number: d(a)
- Sum of divisors of a number: σ(a)
- Euler's totient function: φ(a)
- Derivative: a', the derivative of a. When a
is a number, then a' = 0.
|
| Level 7: Other advanced
functions. (All will be surcharged, except as noted. Only those
used so far have been listed here. Others are possible.) |
- Double factorial: n!! = n × (n – 2) ×
(n – 4) × ... × c ,
where c is 1 if n is odd, and c is 2 if n is
even.
- Grad: n grad (1 grad is a hundredth of a right angle,
hence
).
- Kronecker delta: δab
(equal to 1 if a = b, 0 if a ≠ b)
(Will not be surcharged.)
- Lucas sequence: La = La–1 +
La–2 , L1 =
1, L2 = 3
- Triangular numbers: Ta =
a+1C2
- Zeta function:

|
There are many more functions used in mathematics at the level of calculus
and beyond. We cannot possibly list them all, but a good source of
additional possibilities can be found at Wolfram Research's Mathematical
Functions.
|