@yu.geng.tian: Feeding tilapia, high-density farming, how about this density?#aquaponics #Agricultural #Tilapia#greenhouse #RAS

AgriPulseTech
AgriPulseTech
Open In TikTok:
Region: US
Friday 31 July 2026 04:50:15 GMT
29272
1210
62
96

Music

Download

Comments

kangmus362
Khoirul Mustofa :
What system is being used for this tilapia farming?
2026-08-10 05:29:07
0
junioroneydantas
Junio Dantas :
Como funciona seu sistema de filtragem?
2026-09-02 00:28:59
0
jl75908
JL :
What’s the density ?
2026-07-31 12:15:44
0
meni5272
Meni5272 :
Hello is it a RAS ? Can you cultivate Yellowtail fish in that system ?
2026-08-12 18:49:23
0
naimurrahman86
Naimur Rahman :
This system always need electricity right?
2026-08-13 08:55:17
0
bungala42
Bungala :
How many meters is it from the up to bottom
2026-08-09 13:44:21
1
nathikhoza68
Nathi :
Which country are you located from? 🤔
2026-08-22 12:42:31
0
pang.pangpang_
HAHA HIHI :
Hello, I would like to ask, for this density, how many LPM is needed for aeration? And what is the minimum target for dissolved oxygen? Can I contact you for further development of my pond?
2026-08-03 12:03:24
0
kaisarnilafarm
KAISAR NILA FARM :
i love these, which country?
2026-08-03 12:15:23
0
zachresels
zachresels :
oh my goodness! I love these
2026-07-31 21:43:49
0
suhendra.hendra846
Suhendra Hendra :
spil harga pakan ya bg,biar kita semua tau
2026-08-13 04:24:02
0
sadailton.amaro
sAdailton Amaro :
quantas tilápia pô metros cúbicos
2026-07-31 21:53:13
0
lalu.gina
EL LIBRA 🕊🕊🕊 :
nice🥰🥰🥰
2026-07-31 06:08:34
0
bangsamaudin
Bang Sam_Gass_Poll. :
keren,semoga sukses dan lancar usahanya.
2026-08-12 01:53:22
0
barok6827
Hudin Mubarok :
masyaalloh
2026-08-08 12:58:59
0
gunungnilafarm
🐟 :
nian jossss jisssss iki
2026-08-02 02:35:05
0
zeelley96
Sahabat Timnas Indonesia :
subhanallah
2026-07-31 11:24:59
0
emmeobinhan
🌺🌺🅱️ình 🅰️n💐🌺💞💐bán nhà :
👍👍 giỏi
2026-07-31 11:28:33
0
dkmodernfishfarm
DK Modern Fish Farm :
2026-08-02 00:22:11
0
mohammadarif4237
🇧🇩اشب الدين اشب الدين🇸🇦 :
2026-08-26 11:13:59
0
yudi51865
yudi :
not bioflok
2026-08-22 15:23:45
0
mohammadarif4237
🇧🇩اشب الدين اشب الدين🇸🇦 :
2026-08-26 11:15:35
0
my.thi.kh.treo.l
máy thổi khí treo lơ lửng :
Máy thổi khí treo khí nén
2026-08-02 07:34:20
0
tuso811
tuso81 :
👍
2026-08-27 12:29:38
0
jgarxwen
Jgar Xwen :
❤️❤️❤️
2026-07-31 10:06:33
0
To see more videos from user @yu.geng.tian, please go to the Tikwm homepage.

Other Videos

Graham’s Number is among the most extraordinary quantities ever encountered in mathematics, not because it represents a physical quantity, but because of the way it emerges from abstract reasoning and the sheer scale it achieves through recursive definition. It first captured public imagination in 1977 when Martin Gardner highlighted it in his Scientific American column, calling it the largest number ever used in a serious mathematical proof at the time. The number originated in work by mathematician Ronald Graham on a problem in Ramsey theory—a field that explores how order inevitably appears within sufficiently large structures, even when those structures are arranged randomly. The specific problem involves coloring the edges of high‑dimensional hypercubes. Imagine an n‑dimensional cube where every pair of vertices is connected by an edge, and each edge is colored either red or blue. The question asks: what is the smallest dimension n such that no matter how the edges are colored, there will always be a set of four vertices lying in the same plane with all six connecting edges the same color? Graham’s Number does not give the answer to this question; rather, it serves as an upper bound—a guarantee that the true answer cannot be larger than this immense value. Later research has shown that the actual number is likely far smaller, possibly even less than 20, but Graham’s bound remains historically significant for its construction and scale. To describe Graham’s Number, standard notation fails completely. Even writing the number of digits in Graham’s Number would require more space than exists in the observable universe. Instead, mathematicians rely on Knuth’s up‑arrow notation, a system designed to express operations far more powerful than exponentiation. In this notation, a single arrow stands for exponentiation ($a \uparrow b = a^b$), two arrows represent tetration (a power tower), three arrows denote an even faster‑growing operation, and so on. Graham’s Number is built through a 64‑step recursion: the first term $g_1$ is defined as $3 \uparrow\uparrow\uparrow\uparrow 3$ (four up arrows between two 3s), which already produces an incomprehensibly large result. Each subsequent term uses the previous one to determine the number of arrows in the next expression: $g_2 = 3 \uparrow^{g_1} 3$, $g_3 = 3 \uparrow^{g_2} 3$, and so forth, continuing until $g_{64}$, which is Graham’s Number. What makes this number especially remarkable is that it is precisely defined and, in principle, computable—though no physical process could ever complete the computation or store the result. Its growth is so explosive that even the intermediate steps quickly surpass any conceivable magnitude tied to the physical world. For example, the number of atoms in the known universe is roughly $10^{80}$, yet this figure becomes negligible when compared to the earliest stages of Graham’s construction. Beyond its mathematical role, Graham’s Number has become a cultural reference point for the limits of human intuition when confronting large finite numbers. It illustrates how combinatorial problems can generate values that defy visualization while remaining rigorously grounded in logic. It appears in popular science discussions as a benchmark for “unimaginably large” and serves as an entry point to explore topics like recursive functions, fast‑growing hierarchies, and the philosophy of mathematical infinity. Though its original upper bound is now considered extremely loose, the number endures as a testament to the power of abstract mathematical reasoning and the surprising ways in which simple rules can lead to staggering complexity. #fyp #ussr #europe #map #communism
Graham’s Number is among the most extraordinary quantities ever encountered in mathematics, not because it represents a physical quantity, but because of the way it emerges from abstract reasoning and the sheer scale it achieves through recursive definition. It first captured public imagination in 1977 when Martin Gardner highlighted it in his Scientific American column, calling it the largest number ever used in a serious mathematical proof at the time. The number originated in work by mathematician Ronald Graham on a problem in Ramsey theory—a field that explores how order inevitably appears within sufficiently large structures, even when those structures are arranged randomly. The specific problem involves coloring the edges of high‑dimensional hypercubes. Imagine an n‑dimensional cube where every pair of vertices is connected by an edge, and each edge is colored either red or blue. The question asks: what is the smallest dimension n such that no matter how the edges are colored, there will always be a set of four vertices lying in the same plane with all six connecting edges the same color? Graham’s Number does not give the answer to this question; rather, it serves as an upper bound—a guarantee that the true answer cannot be larger than this immense value. Later research has shown that the actual number is likely far smaller, possibly even less than 20, but Graham’s bound remains historically significant for its construction and scale. To describe Graham’s Number, standard notation fails completely. Even writing the number of digits in Graham’s Number would require more space than exists in the observable universe. Instead, mathematicians rely on Knuth’s up‑arrow notation, a system designed to express operations far more powerful than exponentiation. In this notation, a single arrow stands for exponentiation ($a \uparrow b = a^b$), two arrows represent tetration (a power tower), three arrows denote an even faster‑growing operation, and so on. Graham’s Number is built through a 64‑step recursion: the first term $g_1$ is defined as $3 \uparrow\uparrow\uparrow\uparrow 3$ (four up arrows between two 3s), which already produces an incomprehensibly large result. Each subsequent term uses the previous one to determine the number of arrows in the next expression: $g_2 = 3 \uparrow^{g_1} 3$, $g_3 = 3 \uparrow^{g_2} 3$, and so forth, continuing until $g_{64}$, which is Graham’s Number. What makes this number especially remarkable is that it is precisely defined and, in principle, computable—though no physical process could ever complete the computation or store the result. Its growth is so explosive that even the intermediate steps quickly surpass any conceivable magnitude tied to the physical world. For example, the number of atoms in the known universe is roughly $10^{80}$, yet this figure becomes negligible when compared to the earliest stages of Graham’s construction. Beyond its mathematical role, Graham’s Number has become a cultural reference point for the limits of human intuition when confronting large finite numbers. It illustrates how combinatorial problems can generate values that defy visualization while remaining rigorously grounded in logic. It appears in popular science discussions as a benchmark for “unimaginably large” and serves as an entry point to explore topics like recursive functions, fast‑growing hierarchies, and the philosophy of mathematical infinity. Though its original upper bound is now considered extremely loose, the number endures as a testament to the power of abstract mathematical reasoning and the surprising ways in which simple rules can lead to staggering complexity. #fyp #ussr #europe #map #communism

About