@mannandcobakeshop: I was in a tough position in 2020 as there was a letter from the city waiting outside my door and had 1 week to decide whether I wanted to close down my home business (not legal in British Columbia) or take the next steps and open a storefront. Luckily I was able to delay it a little bit due to Covid, finish my degree, and start this journey in 2022. It’s been 3 tough and incredible years and I’m glad I took the risk. Remember to follow your dreams 🫶🏽 #mannandcobakeshop #surreycakes #surreybakery #jujharmann #surrey

mannandcobakeshop
mannandcobakeshop
Open In TikTok:
Region: CA
Friday 02 January 2026 01:40:09 GMT
123723
6441
103
253

Music

Download

Comments

gmoneyyhoneyyyy
G$ :
This genuinely made me so happy ✨
2026-01-02 02:56:13
150
bubbles88e
Bubbles :
you can have home businesses in BC, it all depends what and how your doing it.
2026-01-02 11:06:39
10
chamaar67
chamaar :
do you do bday cakes ?
2026-01-02 20:10:46
1
jnk0917
JNK1709 :
The best cakes! 🎂
2026-01-02 04:47:10
13
travel_adventures19
travel_adventures19 🇨🇦🇵🇹 :
Is that your dad in the first video ? He looks so proud of you 🥰❤
2026-01-04 07:19:40
4
idontknow1201
Ky :
I saw you at the swrbot gala , so happy you won!!! ✨✨
2026-02-26 16:19:37
1
theyfwwhadennn1
theyfwwhadennn1 :
Just do you know I think you are the best me and my mom used to watch you on is it cake ALL the time and we were always rooting for you❤️🇨🇦
2026-01-03 08:08:16
1
jaydobs1
Jay dobs :
My son and I loved u on “is it cake” and we always say we’re going to visit “jujars bakery” sometime. We live in Vancouver island
2026-01-03 21:23:08
2
amberdigitalbossmom
✨️Amberhustlesonline💰💻 :
HEYYYYY I MY SON AND I JUST WATCHED U ON THE CAKE SHOW!!! U R OUR FAVORITE ❤❤❤
2026-01-02 17:38:07
11
curlydaze_17
proffessional drake hater :
This is awesome! So proud of you stranger ❤️😁
2026-01-03 17:40:48
3
jessxng17
jxd17 :
You were my favvvvvv! I’m so happy for you! Defffff deserved all the blessings! 🩵
2026-01-03 07:18:23
1
blahblahblahhhbah
blahblahblahhhbah :
Bought a cake from you guys 2 days ago for my daughter's birthday and we all loved it!
2026-01-03 06:03:15
1
shareenywheeny
Sharin :
Thanks for making my sangeet dessert spread it was soo delicious and looking forward to ordering more from you esp cakes 😍😍
2026-01-03 01:18:21
3
nimikp
Nimi :
we love your cupcakes! always order them for events :)
2026-01-03 05:18:47
2
moonlight.ange
angela ♡ :
WE LOVE U!!!
2026-01-03 09:30:48
2
agnesraj29
Ranjana 🇨🇦 🇨🇦🇨🇦 :
been following your growth and achievements from the start
2026-01-02 07:37:42
23
the_real_reece
Reece :
If you were open tomorrow I for sure would come by to grab some treats
2026-01-03 03:55:45
1
stevenedmund77
Steven Edmund :
Congratulations, great work , high level of skill 🙏
2026-01-04 15:52:36
1
browntaurus
thecommentatorofsecret :
congratulations
2026-01-06 23:33:58
1
aadhiakr
_Medusa_ :
So happy for u ❤️
2026-01-02 06:10:39
4
flossyzeus
KlutzyCreature🇨🇦 :
you look like a wonderful person, I'm glad you have success 🥰
2026-01-04 04:51:08
2
jattdontcare22
… :
Bro random question but did you ever do bhangra?
2026-01-02 11:59:03
1
xiao8ao
Xiao Mao :
Cute
2026-01-04 01:24:02
1
noorkdhil
noor :
Incredible 🤩🤩🤩
2026-01-03 21:27:44
1
sweetdee.2020
sweetdee.2020 :
Hey!! Nice work!!!
2026-01-03 20:53:14
1
To see more videos from user @mannandcobakeshop, please go to the Tikwm homepage.

Other Videos

I failed my posting streak guys :( Sorry fellas #edit #xyzbca #fcc #fyp #dontflop Graham's number is a very large number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. But even the number of digits in this digital representation of Graham's number would itself be a number so large that its digital representation cannot be represented in the observable universe. Nor even can the number of digits of that number—and so forth, for a number of times far exceeding the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical universe-scale power towers of the form  a b c ⋅ ⋅ ⋅ {\displaystyle a^{b^{c^{\cdot ^{\cdot ^{\cdot }}}}}}, even though Graham's number is indeed a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or equivalent, as was done by Ronald Graham, the number's namesake. As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, the sequence of which grows faster than any computable sequence. Though too large to ever be computed in full, the sequence of digits of Graham's number can be computed explicitly via simple algorithms; the last 10 digits of Graham's number are ...2464195387.[1] Using Knuth's up-arrow notation, Graham's number is  g 64 {\displaystyle g_{64}},[2] where g n = { 3↑↑↑↑3,	 if  n=1  and 3 ↑ g n − 1 3,	 if  n≥2.  {\displaystyle g_{n}={\begin{cases}3\uparrow \uparrow \uparrow \uparrow 3,&{\text{if }}n=1{\text{ and}}\\3\uparrow ^{g_{n-1}}3,&{\text{if }}n\geq 2.\end{cases}}} Graham's number was used by Graham in conversations with popular science writer Martin Gardner as a simplified explanation of the upper bounds of the problem he was working on. In 1977, Gardner described the number in Scientific American, introducing it to the general public. At the time of its introduction, it was the largest specific positive integer ever to have been used in a published mathematical proof. The number was described in the 1980 Guinness Book of World Records, adding to its popular interest. Other specific integers (such as TREE(3)) known to be far larger than Graham's number have since appeared in many serious mathematical proofs, for example in connection with Harvey Friedman's various finite forms of Kruskal's theorem. Additionally, smaller upper bounds on the Ramsey theory problem from which Graham's number was derived have since been proven to be valid.
I failed my posting streak guys :( Sorry fellas #edit #xyzbca #fcc #fyp #dontflop Graham's number is a very large number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. But even the number of digits in this digital representation of Graham's number would itself be a number so large that its digital representation cannot be represented in the observable universe. Nor even can the number of digits of that number—and so forth, for a number of times far exceeding the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical universe-scale power towers of the form a b c ⋅ ⋅ ⋅ {\displaystyle a^{b^{c^{\cdot ^{\cdot ^{\cdot }}}}}}, even though Graham's number is indeed a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or equivalent, as was done by Ronald Graham, the number's namesake. As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, the sequence of which grows faster than any computable sequence. Though too large to ever be computed in full, the sequence of digits of Graham's number can be computed explicitly via simple algorithms; the last 10 digits of Graham's number are ...2464195387.[1] Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[2] where g n = { 3↑↑↑↑3, if n=1 and 3 ↑ g n − 1 3, if n≥2. {\displaystyle g_{n}={\begin{cases}3\uparrow \uparrow \uparrow \uparrow 3,&{\text{if }}n=1{\text{ and}}\\3\uparrow ^{g_{n-1}}3,&{\text{if }}n\geq 2.\end{cases}}} Graham's number was used by Graham in conversations with popular science writer Martin Gardner as a simplified explanation of the upper bounds of the problem he was working on. In 1977, Gardner described the number in Scientific American, introducing it to the general public. At the time of its introduction, it was the largest specific positive integer ever to have been used in a published mathematical proof. The number was described in the 1980 Guinness Book of World Records, adding to its popular interest. Other specific integers (such as TREE(3)) known to be far larger than Graham's number have since appeared in many serious mathematical proofs, for example in connection with Harvey Friedman's various finite forms of Kruskal's theorem. Additionally, smaller upper bounds on the Ramsey theory problem from which Graham's number was derived have since been proven to be valid.

About