Inspired by this problem
The problem is about a quadratic function modulo 53, and it asks for which function values you can compose this function multiple times to get a result of 18.
What's interesting, is that the solutions come in pairs whose sum is always 51, and actually ∀a,b∈(Z/53Z)(a+b=51⇒f(a)=f(b)) with the ring of integers modulo 53 Z/53Z.
Is this a consequence of mod 53 or always true for quadratic equations?
This is the graph that shows for each value what the function gives and where you would continue and it is really symmetric and I think beautiful (except for a few links that break the patterns)
Proof
So this is a proof for this particular polynomial
(51−n)2+2(51−n)+3
=n2−104n+2706
≡(n2(mod53))+(−104n(mod53))+(2706(mod53))
≡n2+2n+3(mod53)
and for some prime p
((p−2)−n)2+2((p−2)−n)+3
=n2−2pn+2n+p2−2p+3
≡(n2(modp))+(−2pn+2n(modp))+(p2−2p+3(modp))≡(n2(modp))+(2n(modp))+(3(modp))
≡n2+2n+3(modp)
In general
For a general quadratic polynomial an2+bn+c(modp) with a,b,c∈N,p∈P,a=0
a((p−2)−n)2+b((p−2)−n)+c
=((a)n2+(4a−2ap−b)n+(ap2+bp−4ap+c−2b+4a))
≡(an2(modp))+(4an−2apn−bn(modp))+(ap2−4ap+bp+4a−2b+c(modp))
≡(an2(modp))+(4an−bn(modp))+(4a−2b+c(modp))
≡((an2)+(4an−bn)+(4a−2b+c))(modp)
For this to be congruent to the original polynomial, we require
a≡a(modp)
4a−b≡b(modp)
4a−2b+c≡c(modp)
The first condition is always true, the other two are equivalent and can be rewritten as
2a≡b(modp)
So c actually has no influence and we have only one condition on the coefficients (and p must be prime).
Degree 4
Let's try to do the same thing with a polynomial of degree 4 (because 3 doesn't work well), so an4+bn3+cn2+dn+e with a,b,c,d,e∈N,p∈P,a=0
a(p−2−n)4+b(p−2−n)3+c(p−2−n)2+d(p−2−n)+e
=(stuff)⋅p+an4+8an3−bn3+24an2−6bn2+cn2+32an−12bn+4cn−dn+16a−8b+4c−2d+e
≡((a)n4+(8a−b)n3+(24a−6b+c)n2+(32a−12b+4c−d)n+(16a−8b+4c−2d+e))(modp)
By equating coefficients, we get
a≡a(modp)
8a−b≡b(modp)
24a−6b+c≡c(modp)
32a−12b+4c−d≡d(modp)
16a−8b+4c−2d+e≡(modp)
Again, the first congruence is trivial and the second and third are equivalent. By pluging the second into the fourth and fifth, we find that they are also equivalent. So, we end up with two congruences
4a−b≡0(modp)
−2b+2c−d≡0(modp)
If we want we can pick some numbers, maybe a=1 to have a normalized polynomial, then b has to be 4. For c and d, we can pick 5 and 2 and since e is without any restriction, let's make it nice and take e=3. This gives the polynomial
f(n)=n4+4n3+5n2+2n+3
and if we try we see that it really follows our rule
∀a,b∈(Z/53Z)(a+b=51⇒f(a)=f(b))
#NumberTheory
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.