Various patterns and anomalous behaviors

from the sine function

Alexandre Bali
October 30, 2018

Abstract
In this paper, we will present a bunch of sets which tend to reveal
somewhat strange patterns from the sine function, and we’ll specifi-
cally study those who don’t really fit in any of those.

1 Motivation
We wanted to test the boundaries of trigonometric functions and check
how sure they could be for cryptographic purposes. Our main idea
was that if we use sin n or something similar as an encryption key
for a very large n, it would be hard to find back the actual value n.
Obviously, we thought this would be a very bad idea with the power of
current algorithms, but we tried to exploit the sine function as much
as possible and we stumbled upon a few interesting patterns, and we
therefore studied the repartition of the numbers which don’t fit to
see anything interesting and show more and more anomalies as such,
studying them and so on. This paper therefore compiles all of our
current results in this search for a secure way of using trigonometric
functions.

1
2 Results
Let (σn ) be a sequence defined by the relation σn+1 = sin σn . We also
define Σ the map

Σ : N → N
a0 7→ min{n | |an | ≤ 1/a0 }

As we graphed the function, we first conjectured that Σ(n) was a

Θ(n2 ) function. We then found the simplest approximative formula
for Σ(n) should be n 7→ 3n2 . In fact, p it is extremely common for
n ∈ N∗ to respect the relation bn − Σ(n)/3b= 0. However, some
values of n don’t actually fit in this pattern. These anomalous values
have been computed up to 3217 :

1, 3, 6, 19, 22, 25, 44, 66, 88, 110, 132, 245, 267, 289, 311, 333, 355, 377, 399,
421, 644, 666, 688, 710, 732, 754, 1021, 1043, 1065, 1087, 1109, 1376, 1398,
1420, 1442, 1464, 1753, 1775, 1797, 2108, 2130, 2152, 2463, 2485, 2507,
2818, 2840, 2862, 3173, 3195, 3217 . . .

We will call this sequence (τn ), starting from τ0 = 1. We define κa,b

for a < b as a set
b
[
κa,b = {n | σn+1 − σn = σn − σn−1 , a ≤ n ≤ b} = {k}
k=a

The areas previously underlined are those sort of clusters for which
κa,b sets try to capture. It also seems that those clusters elements,
as they get large enough, always differ by 22. A similar pattern is
that, between the ending number and the first of two consecutive
clusters, there seems to be a difference 311 at some point as well.
(More recreatively, 311/22 is oddly close to the imaginary part of the
first nontrivial zero of the Riemann ζ function. We’re pretty sure
it’s simply coincidental, but we thought that could be an interesting
thing to share). From these conjectures, we found larger values in the
sequence (but beware, they’re maybe not all consecutive) :

3173, 3195, 3217, 3528, 3550, 3572, 3883, 3905, 3927, 4238,
4260, 4282, 4593, 4615, 4948, 4970, 4992, 5303, 5303, 5325,
5347, 5658, 5680, 5702, 6013, 6035, 6368, 6390, . . .

The number in bold shows a little flaw in the pattern, since there is
a slightly larger gap there, and it also seems that there is a more or

2
less lengthy range without any cluster, even if the pattern is clear.
It is therefore unknown whether there are finitely or infinitely many
elements of the sequence (σn ) who can’t be underlined as such and
who don’t fit in this “22-311” pattern, but if there are infinitely many,
this might give us a bit of hope for finding interesting numbers to use
for trigonometric cryptography purposes if we base ourselves on the
Σ function. Let the set Υ defined as
  jnk 1 

Υ := n  n − π <
π n

We can show that for all υ ∈ Υ, there exists n ∈ N∗ such that τn ∈ S.

We believe it is also currently possible to show that |Υ| = ∞. The
first elements of Υ have been computed :

1, 3, 22, 44, 355, 710, 1065, 1420, 1775, 2130, 2485, 2840, 3195 . . .

We could conjecture that |{k ∈ κa,b | k ∈ Υ, a + 1 = b}| = ∞. If so,

this may show an interesting security flaw if we try to use Σ, since that
even if computing it usually requires a quite long algorithm, this weird
pattern for which the elements υ ∈ Υ seem overall to respect, which
we could call the “22-311” conjecture, could lead to easily figure out
any other element of the neighboring clusters of υ, since this would
mean that there is a good chance that υ ± 22 are also part of the
(τn ) sequence, and maybe so do υ ± 22` + 311k for small enough
integer values of ` and k, hence getting us to very large elements of
the sequence. This is why finding out if there are infinitely many
elements of the (τn ) sequence who don’t fit in any cluster (or at least
relatively large ones) nor in some “22-311” pattern would give us a
very secure set of numbers that we could use for a Σ-based system.