bwakout
 
 
˗ˏˋ ★ ˎˊ˗ Playing bingo with God ˗ˏˋ ★ ˎˊ˗
För närvarande Offline
1 registrerad VAC-avstängning | Info
1 registrerad spelavstängning | Info
2241 dag(ar) sedan senaste avstängning
Favoritgrupp
Coiso Gaming - Offentlig grupp
7
Medlemmar
0
Spelar
0
Online
0
I chatt
Skärmbildsmonter
youtube.com/watch?v=tYzMYcUty6s
1
Workshop-monter
Cyber Pain Wallpaper // wallhaven.cc/w/oxqye5
135 betyg
Skapad av - bwakout
𝙄𝙉𝙁𝙊
⠄⣾⣿⡇⢸⣿⣿⣿⠄⠈⣿⣿⣿⣿⠈⣿⡇⢹⣿⣿⣿⡇⡇⢸⣿⣿⡇⣿⣿⣿
⢠⣿⣿⡇⢸⣿⣿⣿⡇⠄⢹⣿⣿⣿⡀⣿⣧⢸⣿⣿⣿⠁⡇⢸⣿⣿⠁⣿⣿⣿
⢸⣿⣿⡇⠸⣿⣿⣿⣿⡄⠈⢿⣿⣿⡇⢸⣿⡀⣿⣿⡿⠸⡇⣸⣿⣿⠄⣿⣿⣿
⢸⣿⡿⠷⠄⠿⠿⠿⠟⠓⠰⠘⠿⣿⣿⡈⣿⡇⢹⡟⠰⠦⠁⠈⠉⠋⠄⠻⢿⣿
⢨⡑⠶⡏⠛⠐⠋⠓⠲⠶⣭⣤⣴⣦⣭⣥⣮⣾⣬⣴⡮⠝⠒⠂⠂⠘⠉⠿⠖⣬
⠈⠉⠄⡀⠄⣀⣀⣀⣀⠈⢛⣿⣿⣿⣿⣿⣿⣿⣿⣟⠁⣀⣤⣤⣠⡀⠄⡀⠈⠁
⠄⠠⣾⡀⣾⣿⣧⣼⣿⡿⢠⣿⣿⣿⣿⣿⣿⣿⣿⣧⣼⣿⣧⣼⣿⣿⢀⣿⡇⠄
⡀⠄⠻⣷⡘⢿⣿⣿⡿⢣⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣜⢿⣿⣿⡿⢃⣾⠟⢁⠈
⢃⢻⣶⣬⣿⣶⣬⣥⣶⣿⣿⣿⣿⣿⣿⢿⣿⣿⣿⣿⣿⣷⣶⣶⣾⣿⣷⣾⣾⢣
⡄⠈⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠘
⣿⡐⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢠⢃
⣿⣷⡀⠈⠻⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⠿⢿⣿⣿⣿⣿⣿⣿⣿⡿⠋⢀⠆⣼
⣿⣿⣷⡀⠄⠈⠛⢿⣿⣿⣿⣿⣷⣶⣶⣶⣶⣶⣿⣿⣿⣿⣿⠿⠋⠠⠂⢀⣾⣿
⣿⣿⣿⣧⠄⠄⢵⢠⣈⠛⠿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢋⡁⢰⠏⠄⠄⣼⣿⣿
⢻⣿⣿⣿⡄⢢⠨⠄⣯⠄⠄⣌⣉⠛⠻⠟⠛⢋⣉⣤⠄⢸⡇⣨⣤⠄⢸⣿⣿⣿
Senaste aktiviteterna
188 timmar totalt
spelades senast den 5 sep
25 timmar totalt
spelades senast den 5 sep
1,5 timmar totalt
spelades senast den 18 aug
Kommentarer
artyan22 28 aug @ 10:54 
playing with cheats
Kaentos 27 nov, 2022 @ 10:21 
<3
Kaentos 10 mar, 2022 @ 8:49 
I can't ♥♥♥♥♥♥♥ take it any more. Among Us has singlehandedly ruined my life. The other day my teacher was teaching us Greek Mythology and he mentioned a pegasus and I immediately thought 'Pegasus? more like Mega Sus!!!!' and I've never wanted to kms more. I can't look at a vent without breaking down and ♥♥♥♥♥♥♥ crying. I can't eat pasta without thinking 'IMPASTA??? THATS PRETTY SUS!!!!' ♥♥♥♥ 4 by Kanye West. The lyrics ruined me. A Mongoose, or the 25th island of greece. The scientific name for pig. I can't ♥♥♥♥♥♥♥ take it anymore.

Please ♥♥♥♥♥♥♥ end my suffering.
bwakout 29 mar, 2020 @ 12:28 
The proof starts from the Peano Postulates, which define the natural
numbers N. N is the smallest set satisfying these postulates:

P1. 1 is in N.
P2. If x is in N, then its "successor" x' is in N.
P3. There is no x such that x' = 1.
P4. If x isn't 1, then there is a y in N such that y' = x.
P5. If S is a subset of N, 1 is in S, and the implication
(x in S => x' in S) holds, then S = N.

Then you have to define addition recursively:
Def: Let a and b be in N. If b = 1, then define a + b = a'
(using P1 and P2). If b isn't 1, then let c' = b, with c in N
(using P4), and define a + b = (a + c)'.

Then you have to define 2:
Def: 2 = 1'

2 is in N by P1, P2, and the definition of 2.

Theorem: 1 + 1 = 2

Proof: Use the first part of the definition of + with a = b = 1.
Then 1 + 1 = 1' = 2 Q.E.D.
Kaentos 28 mar, 2020 @ 17:18 
1+1 = 2 but 2 + 2 = 4
tell me why
Kaentos 23 feb, 2020 @ 11:54 
█▀▀▄░█░█▀▀░░█▀█░░█▀█░█░
█░░█░█░▀▀█░░█▀▀█░█░█░█░
▀▀▀░░▀░▀▀▀░░▀▀▀▀░▀▀▀░▀░