@phamminhthach94: két là 1 loài cá chung thủy đấy các bạn, chăm con rất tốt luôn. Mà có cái k tốt là k biết kế hoạch hóa gia đình thôi 😂😂😂 #xuhuong #cacanhthuysinh #cacanh #caket #yeucacanh

Cá cảnh Minh Thạch
Cá cảnh Minh Thạch
Open In TikTok:
Region: VN
Thursday 11 June 2026 01:56:47 GMT
29661
883
59
131

Music

Download

Comments

hongduymaytinhcamera
Hồng Duy Máy Tính ,Camera :
Muốn muôi chung loại này với các loại khác dc k bạn
2026-06-30 15:19:12
0
phucbaohihi
song ngư hihi :
con cá màu trắg kia cưg xỉu 🥰 mê
2026-06-29 07:58:08
0
chuyenchiket
Đào Dương Thúy Hằng :
cặp này nhìn cưng quá
2026-06-11 10:49:33
1
_wuanming
𝑾𝒖𝒂𝒏𝒈 𝑴𝒊𝒏𝒈 :
Bạn cho cá con ăn gì vậy ạ
2026-06-30 15:53:06
0
cy.xanh55
Silent :
Mua ở đâu bạn nhỉ
2026-06-17 11:03:54
0
uyenhp9x
Túuuu UyÊnnnn 🥰 :
Muốn mua shop ơi
2026-06-30 20:15:23
0
_ngaaz_
Nga. ? :
Xin giá 1 đôi trống mái b ơi
2026-06-29 07:56:21
0
truongamday
1992 :
Bạn có bán cá này không
2026-06-19 13:11:39
0
raubap153
Rau Bap :
cá này giá sao a
2026-06-19 09:18:41
0
nguyenvantinh211003
T Ì N H :
nghe nói nó nhai thức ăn cho con nó ăn nữa hả bn
2026-06-17 12:44:15
0
thanhvan1950
thanhvan1950 :
Chán vãi , đẻ phát ớn , đang nuôi con nó đã đẻ tiếp rồi
2026-06-14 14:24:58
0
10tranthuy91
Bỉ Ngạn91 :
M từng nuôi em này,mỗi lần con cái sinh sản là con đực đứng ngoài canh giữ ổ ,ko cho con khác vào.cưng lắm luôn
2026-06-17 11:39:41
0
anhtq89
AnhTQ89 :
Giờ muốn nuôi 1 cặp thì cần bể kích thước tối thiểu bao nhiêu bác? E kết nuôi két mà nhà chật quá rồi
2026-06-17 07:46:58
0
quynhanhtran2603
Quỳnh Anh Trần :
Lần đầu nuôi t thấy bảo tụi nó chăm con tốt lắm nên ko tách ra, nuôi con lớn rồi mà tụi nó ăn gần hết luôn
2026-06-12 05:01:13
0
supo.supo22
Supo Supo :
cá này nuôi kiểu ko bắt cặp đc ko ạh ,em muốn nuôi ko đẻ á
2026-06-13 06:59:22
0
c.mc.lan
Đức Mộc Lan :
nó cũng khá khó tính nhé ,chồng mà làm nó không hài lòng là toang ngay😂😂😂
2026-06-11 11:16:14
0
xdog52
kg occac :
trắng đực panda cái à
2026-06-30 15:44:22
0
quynhmin021017
𝒬𝓊𝓎̀𝓃𝒽 ℳ𝒾𝓃 🌻 :
Mình nuôi 1 cặp hồng két sz 8-10cm mà hơn tuần r vẫn nản vẫn hay giật mình, sợ người 😌
2026-07-01 15:12:40
0
bigunuriviu
BigUnu rì viu :
hic, hôm trước cá con bơi ra ngoài được rồi, đi làm 1 ngày về ko còn thấy em nào nữa
2026-07-08 02:32:45
0
bocube25
Bơ 🧈 :
Bán em 2 con cá con đi
2026-06-19 17:01:04
0
tinhnh88
NHT :
Nhìn cặp này con nào trống con nào mái vậy bạn
2026-06-24 01:45:42
0
nguyen_van_hien_1989
LoveYou :
1 cặp cá bao nhiêu vậy
2026-06-24 06:26:30
0
gianglt95
Giang LT :
cặp két t đẻ 2 lứa cái xong chia tay hay sao mà cắn nhau gần chết! 😂
2026-06-17 08:52:08
0
minh.huy3561
Minh Huy :
Em nuôi toàn ăn con thôi😂😂😂
2026-06-11 02:02:12
0
To see more videos from user @phamminhthach94, please go to the Tikwm homepage.

Other Videos

Graham's number is a giant number that is the upper limit for solving a certain problem in Ramsey's theory. It is some very large power of the triple, which is written using Knuth notation. Named after Ronald Graham. It became known to the general public after Martin Gardner described it in his column 3. Graham's number is related to the following problem in Ramsey's theory: Consider n {\ displaystyle n} -dimensional hypercube and connect all pairs of vertices to obtain a complete graph with 2 n {\ displaystyle 2 ^ {n}} vertices. Paint each edge of this graph either red or blue. At what is the smallest value n {\ displaystyle n} does each such coloring necessarily contain a single-color complete subgraph with four vertices, all of which lie in the same plane? Graham and Rothschild proved in 1971 that this problem has a solution. N ∗ {\ displaystyle N ^ {*}}, and showed that 6 ≤ N ∗ ≤ N {\ displaystyle 6\ leqslant N ^ {*}\ leqslant N}, where N {\ displaystyle N} is a specific, precisely defined, very large number. In Knuth's arrow notation language, it can be written as N = F 7 ( 12 ) {\ displaystyle N = F ^ {7} (12)}, where F ( n ) = 2 ↑ n 3 {\ displaystyle F (n) = 2\ uparrow ^ {n} 3}. This number is referred to as the "Little Graham number." The lower bound was improved by Exu in 2003 and Barkley in 2008, which showed that N ∗ {\ displaystyle N ^ {*}} should be at least 13. Then the upper limit was improved to 2 ↑ 3 6 {\ displaystyle 2\ uparrow ^ {3} 6} and then up to 2 ↑ ↑ 2 ↑ ↑ 2 ↑ ↑ 9 {\ displaystyle 2\ uparrow\ uparrow 2\ uparrow 2\ uparrow\ uparrow 9}. Thus, 13 ≤ N ∗ ≤ 2 ↑ ↑ 2 ↑ ↑ 2 ↑ ↑ 9 {\ displaystyle 13\ leqslant N ^ {*}\ leqslant 2\ uparrow\ #fyp #based #larping #israel " width="135" height="240">
Graham's number is a giant number that is the upper limit for solving a certain problem in Ramsey's theory. It is some very large power of the triple, which is written using Knuth notation. Named after Ronald Graham. It became known to the general public after Martin Gardner described it in his column "Mathematical Games" in Scientific American in November 1977, where it was said: "In an unpublished proof, Graham recently set a boundary so large that it holds the record as the largest number ever used in a serious mathematical proof." In 1980, the Guinness Book of World Records echoed Gardner's claims, further fueling public interest in this number. The Graham number is an unimaginable number of times larger than other well-known large numbers such as the googol, the googolplex, and even larger than the Skews number and the Moser number. The entire observable universe is too small to accommodate the ordinary decimal notation of the Graham number (it is assumed that the notation of each digit occupies at least the Planck volume). Even the power towers of the view a b c ÷ ÷ ÷ {\ displaystyle a ^ {b ^ {c ^ {\ cdot ^ {\ cdot ^ {\ cdot}}}}}} are useless for this purpose (in the same sense), although this number can be written using recursive formulas such as Knuth's notation or equivalent, which was done by Graham. The last 500 digits of Graham's number are ...02425950695064738395657479136519351798334535362521 43003540126026771622672160419810652263169355188780 38814483140652526168785095552646051071172000997092 91249544378887496062882911725063001303622931916080 25459461494578871427832350829242102091825896753560 43086993801689249889268099510169055919951195027887 17830837018340236474548882222161573228010132974509 27344594504343300901096928025352751833289884461508 94042482650181938515625357963996189939679054966380 03222348723967018485186439059104575627262464195387. In modern mathematical proofs, numbers even larger than Graham's number are sometimes found, for example, in the work with Friedmann's finite form in Kraskal's theorem - the so-called TREE (3). Content 1 Graham's problem 2 Determination of the Graham number 2.1 Scale of Graham number 3 See also 4 Literature 5 References Graham problem Example: 2 colors and a 3-dimensional cube containing one single-color 4-vertex coplanar complete subgraph. The subgraph is shown below the cube. This cube will not contain such a subgraph if, for example, the bottom edge of the present subgraph is replaced by blue - which proves by a counterexample that N * > 3. Graham's number is related to the following problem in Ramsey's theory: Consider n {\ displaystyle n} -dimensional hypercube and connect all pairs of vertices to obtain a complete graph with 2 n {\ displaystyle 2 ^ {n}} vertices. Paint each edge of this graph either red or blue. At what is the smallest value n {\ displaystyle n} does each such coloring necessarily contain a single-color complete subgraph with four vertices, all of which lie in the same plane? Graham and Rothschild proved in 1971 that this problem has a solution. N ∗ {\ displaystyle N ^ {*}}, and showed that 6 ≤ N ∗ ≤ N {\ displaystyle 6\ leqslant N ^ {*}\ leqslant N}, where N {\ displaystyle N} is a specific, precisely defined, very large number. In Knuth's arrow notation language, it can be written as N = F 7 ( 12 ) {\ displaystyle N = F ^ {7} (12)}, where F ( n ) = 2 ↑ n 3 {\ displaystyle F (n) = 2\ uparrow ^ {n} 3}. This number is referred to as the "Little Graham number." The lower bound was improved by Exu in 2003 and Barkley in 2008, which showed that N ∗ {\ displaystyle N ^ {*}} should be at least 13. Then the upper limit was improved to 2 ↑ 3 6 {\ displaystyle 2\ uparrow ^ {3} 6} and then up to 2 ↑ ↑ 2 ↑ ↑ 2 ↑ ↑ 9 {\ displaystyle 2\ uparrow\ uparrow 2\ uparrow 2\ uparrow\ uparrow 9}. Thus, 13 ≤ N ∗ ≤ 2 ↑ ↑ 2 ↑ ↑ 2 ↑ ↑ 9 {\ displaystyle 13\ leqslant N ^ {*}\ leqslant 2\ uparrow\ #fyp #based #larping #israel

About