×
![]()
| Položaj | Domena | Stran | Dejanja |
|---|---|---|---|
| 1 | www.reddit.com | /r/Collatz/comments/... | |
|
Celoten URL
Naslov
Доказательство для 3n + 1 или гипотезы Коллатца
Nazadnje posodobljeno
N/A
Page Authority
N/A
Promet:
N/A
Povratne povezave:
N/A
Družabne delnice:
N/A
Čas nalaganja:
N/A
Predogled izrezka:
Основную формулу 3n + 1 можно упростить до (( 3 \* n) + 1 ) / 2. Я меняю это на свою формулу ((( n - 1 ) / 2) + 1 ) + n. Оба они дают одинаковые ... |
|||
| 2 | ru.wikipedia.org | /wiki/%D0%93%D0%B8%D... | |
|
Naslov
Гипотеза Коллатца
Nazadnje posodobljeno
N/A
Page Authority
N/A
Promet:
N/A
Povratne povezave:
N/A
Družabne delnice:
N/A
Čas nalaganja:
N/A
Predogled izrezka:
Гипотеза Ко́ллатца — одна из нерешённых проблем математики |
|||
| 3 | habr.com | /ru/articles/839352/ | |
|
Celoten URL
Naslov
Дилемма 3n+1 на Java. Кэшируем рекурсию
Nazadnje posodobljeno
N/A
Page Authority
N/A
Promet:
N/A
Povratne povezave:
N/A
Družabne delnice:
N/A
Čas nalaganja:
N/A
Predogled izrezka:
28 авг. 2024 г. — Берём любое натуральное число n |
|||
| 4 | www.symbolab.com | /popular-algebra/alg... | |
|
Naslov
expand (3n(3n+1))/((3n-1)(3n+2))
Nazadnje posodobljeno
N/A
Page Authority
N/A
Promet:
N/A
Povratne povezave:
N/A
Družabne delnice:
N/A
Čas nalaganja:
N/A
Predogled izrezka:
Detailed step by step solution for expand (3n(3n+1))/((3n-1)(3n+2 )) |
|||
| 5 | www.quora.com | /Why-does-the-sum-fr... | |
|
Naslov
Why does the sum from n=1 to n of 1/ ((3n-2) (3n+1)) = n
Nazadnje posodobljeno
N/A
Page Authority
N/A
Promet:
N/A
Povratne povezave:
N/A
Družabne delnice:
N/A
Čas nalaganja:
N/A
Predogled izrezka:
Why does the sum from n=1 to n of 1/ ((3n-2) (3n+1)) = n/ (3n+1)? |
|||
| 6 | www.johndcook.com | /blog/2011/06/01/col... | |
|
Naslov
Collatz 3n + 1 conjecture possibly solved
Nazadnje posodobljeno
N/A
Page Authority
N/A
Promet:
N/A
Povratne povezave:
N/A
Družabne delnice:
N/A
Čas nalaganja:
N/A
Predogled izrezka:
1 июн. 2011 г. — If n is odd, multiply n by 3 and add 1 . In 1937, Lothar Collatz asked whether this procedure always stops for every positive starting value of n ... |
|||
| 7 | la.mathworks.com | /matlabcentral/cody/... | |
|
Celoten URL
Naslov
3n + 1 Problem (a.k.a The Collatz Conjecture)
Nazadnje posodobljeno
N/A
Page Authority
N/A
Promet:
N/A
Povratne povezave:
N/A
Družabne delnice:
N/A
Čas nalaganja:
N/A
Predogled izrezka:
10 июл. 2026 г. — If n is even, divide by 2. If n is odd, multiply by 3 and add 1 . Repeat this process with the new value of n, terminating when n = 1 . For ... |
|||
| 8 | onlinejudge.org | /external/1/100.pdf | |
|
Celoten URL
Naslov
100 The 3n + 1 problem
Nazadnje posodobljeno
N/A
Page Authority
N/A
Promet:
N/A
Povratne povezave:
N/A
Družabne delnice:
N/A
Čas nalaganja:
N/A
Predogled izrezka:
In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs. Consider the following algorithm |
|||