![]() |
![]() |
#56 | |
Romulan Interpreter
Jun 2011
Thailand
915410 Posts |
![]() Quote:
You can compare A217120 and A081264 every time you want, to see if any common terms. Last fiddled with by LaurV on 2020-09-29 at 10:19 |
|
![]() |
![]() |
![]() |
#57 |
"Roman V. Makarchuk"
Aug 2020
Ukraine
428 Posts |
![]()
А чи не вкинути нам трішки гівна у вентилятор?))
My life means nothing in the Great Equation! (Thodin, Astral-B Pair) This was fun! So, lets continue) Factors of Fibonacci numbers. If p is prime, F(p)=П(k*p±1), F(p) - Fibonacci number, k - some integer numbers. In general, for any n=(p1^k1)*(p2^k2)*(p3^k3)... F(n)=П(k*p1±1)*(k2*p2±1)(k3*p3±1)... This easy proven by induction (from very start of Fibonacci sequence) Outcome from this simple, and may be unknown rule is huge. This is tini part of my current and i guess new knowlege, if I don't throw up this math bullshit, this lead us to the Symbolic factorization of numbers)))))))) |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
I found the primality test, there seems to be no composite numbers that pass the test | sweety439 | sweety439 | 7 | 2020-02-11 19:49 |
+/- 6 Primality Test | a1call | Miscellaneous Math | 29 | 2018-12-24 01:42 |
Modifying the Lucas Lehmer Primality Test into a fast test of nothing | Trilo | Miscellaneous Math | 25 | 2018-03-11 23:20 |
there is another way to test the primality of a no | shawn | Miscellaneous Math | 5 | 2007-07-17 17:55 |
A primality test for Fermat numbers faster than Pépin's test ? | T.Rex | Math | 0 | 2004-10-26 21:37 |