Download [Part 2]

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

John Wallis wikipedia , lookup

Addition wikipedia , lookup

Georg Cantor's first set theory article wikipedia , lookup

Mathematical proof wikipedia , lookup

Fermat's Last Theorem wikipedia , lookup

Brouwer fixed-point theorem wikipedia , lookup

List of important publications in mathematics wikipedia , lookup

Four color theorem wikipedia , lookup

Algebra wikipedia , lookup

Non-standard calculus wikipedia , lookup

Theorem wikipedia , lookup

Fundamental theorem of calculus wikipedia , lookup

Polynomial wikipedia , lookup

System of polynomial equations wikipedia , lookup

Wiles's proof of Fermat's Last Theorem wikipedia , lookup

Vincent's theorem wikipedia , lookup

Factorization of polynomials over finite fields wikipedia , lookup

Proofs of Fermat's little theorem wikipedia , lookup

Fundamental theorem of algebra wikipedia , lookup

Transcript
628
Dec. 1972
A COUNTING FUNCTION FOR INTEGRAL n-TUPLES
h(h(Pi>
P2K P3) •
F o r n = 4 there a r e 360 polynomials, provided that different compositions yield d i s tinct polynomials,
We are unable to determine the number of counting polynomials of
P ,
except the
case n = 1.
Theorem.
The identical function
fi(pi) = pi
is the only polynomial mapping
1-1
from P onto itself.
Proof.
Suppose g(p) is a counting polynomial of P .
Consider the curve
y = g(x).
It i s c l e a r that after a finite number of ups and downs the curve is monotone increasing (to
+00). Let a be a positive integer such that (1) g(x) is monotone for x > a and (2) g(x) <
g(a) for x < a.
Since g(x) is a counting function of P ,
g(a) == a,
F o r , if g(a) < a,
it has to satisfy
g(a + 1) = a + 1, ••• .
then positive numbers g(l), g(2), •• • , g(a) cannot all be distinct, and if
g(a) > a then the curve must come down beyond a,
contrary to (1). Now, by the Fundamen-
tal Theorem of Algebra we have g(x) = x for all x.
Question.
Are
x ^ V
1
)
the only two polynomials mapping 1 - 1
and
-2
+
(S221)
from P 2 onto P ?
REFERENCES
1. E. A. Maier,
11
Sets N
2.
and
,f
One-One Correspondence Between the set N of Positive Integers and the
Ujf,"
Fibonacci Quarterly, Oct. 1970, pp. 365-371.
P . W. Zehna and R. L. Johnson, Elements of Set Theory, Allyn and Bacon, I n c . , Boston, 1962, p. 108.
[Continued from p. 584.]
REFERENCES
1. H. W. Gould, "Equal Products of Generalized Binomial Coefficients," Fibonacci Quarterly, Vol. 9, No. 4 (1971), pp. 337-346.
2. H. W. Gould, D. C. Rine, and W. L. Scharff, "Algorithm and Computer P r o g r a m for
the Determination of Equal Products of Generalized Binomial Coefficients, Tf to be published.
3. V. E. Hoggatt, J r . ,
and Walter Hansell, "The Hidden Hexagon S q u a r e s , " Fibonacci
Quarterly, Vol. 9, No. 2 (1971), pp. 120, 133.
4. V. E. Hoggatt, J r . , and G. L. Alexanderson, "A Property of Multinomial Coefficients,"
Fibonacci Quarterly, Vol. 9, No. 4 (1971), pp. 351-356, 420-421.
5. V. E. Hoggatt, J r . , and A. P . Hillman, "Proof of Gould1 s Conjecture on Greatest Common D i v i s o r s . " Fibonacci Ouarterlv. Vol. 10, No. 6 (1972), pp. 565-568.