Fibonacci sequence- advanced realations

  • Thread starter Thread starter Rocketboy123
  • Start date Start date
  • Tags Tags
    advanced Sequence
Rocketboy123
Messages
1
Reaction score
0
My main interest is usually physics, however I have become interested in the Fibonacci sequence. I looked at the sequence in detail and found a few interesting patterns. The main pattern was a relationship of the way that the digits of numbers compounded, the exact pattern was: 7,5,5,4,5,5... (that repeated). An easier way to explain it is that there are 7 single digit numbers, 5 double digit numbers, five triple digit numbers, 4 quadruple digit numbers etc. I was wondering if this was a mere coincidence (which is rare with Fibonacci numbers)or if it was relevant, and hopefully not pre-discovered (I thought I discovered Pascal's Triangle until i learned Blaise had beaten me by a couple hundred years...).
 
Physics news on Phys.org
Well the Pascal triangle was known well before Pascal was born.
 
I strongly doubt there is a repeating pattern in that sequence you mention, which btw starts like this 7,5,5,4,5,5,5,4,5,5,5,5,4,5,5,5,5,4,5,5,5,4,5,5,5,5,4,..

The sequence reflects the fact that the ratio between successive fibonaccis quickly approach the golden ratio \varphi=(1+√5)/2, so that (log10\varphi)-1= 4.784.. becomes the average number in the sequence. Any repeating pattern depends on that last number being rational, which, uhm.. lacking something better to say, is unlikely.
 
Last edited:


In general, Rocketboy123,

You might want to familiarize yourself with the properties of Lucas Sequences (not "Lucas Numbers"). It will save you many headaches later on.

- AC
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top