Martin Byrde
 
 
the end is near
Currently Online
1 VAC ban on record | Info
1 game ban on record | Info
2194 day(s) since last ban
Workshop Showcase
Cyber Pain Wallpaper // wallhaven.cc/w/oxqye5
135 ratings
Created by - Martin Byrde
Screenshot Showcase
Favorite Group
Coiso Gaming - Public Group
7
Members
0
In-Game
3
Online
0
In Chat
𝙄𝙉𝙁𝙊
⠄⣾⣿⡇⢸⣿⣿⣿⠄⠈⣿⣿⣿⣿⠈⣿⡇⢹⣿⣿⣿⡇⡇⢸⣿⣿⡇⣿⣿⣿
⢠⣿⣿⡇⢸⣿⣿⣿⡇⠄⢹⣿⣿⣿⡀⣿⣧⢸⣿⣿⣿⠁⡇⢸⣿⣿⠁⣿⣿⣿
⢸⣿⣿⡇⠸⣿⣿⣿⣿⡄⠈⢿⣿⣿⡇⢸⣿⡀⣿⣿⡿⠸⡇⣸⣿⣿⠄⣿⣿⣿
⢸⣿⡿⠷⠄⠿⠿⠿⠟⠓⠰⠘⠿⣿⣿⡈⣿⡇⢹⡟⠰⠦⠁⠈⠉⠋⠄⠻⢿⣿
⢨⡑⠶⡏⠛⠐⠋⠓⠲⠶⣭⣤⣴⣦⣭⣥⣮⣾⣬⣴⡮⠝⠒⠂⠂⠘⠉⠿⠖⣬
⠈⠉⠄⡀⠄⣀⣀⣀⣀⠈⢛⣿⣿⣿⣿⣿⣿⣿⣿⣟⠁⣀⣤⣤⣠⡀⠄⡀⠈⠁
⠄⠠⣾⡀⣾⣿⣧⣼⣿⡿⢠⣿⣿⣿⣿⣿⣿⣿⣿⣧⣼⣿⣧⣼⣿⣿⢀⣿⡇⠄
⡀⠄⠻⣷⡘⢿⣿⣿⡿⢣⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣜⢿⣿⣿⡿⢃⣾⠟⢁⠈
⢃⢻⣶⣬⣿⣶⣬⣥⣶⣿⣿⣿⣿⣿⣿⢿⣿⣿⣿⣿⣿⣷⣶⣶⣾⣿⣷⣾⣾⢣
⡄⠈⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠘
⣿⡐⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢠⢃
⣿⣷⡀⠈⠻⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⠿⢿⣿⣿⣿⣿⣿⣿⣿⡿⠋⢀⠆⣼
⣿⣿⣷⡀⠄⠈⠛⢿⣿⣿⣿⣿⣷⣶⣶⣶⣶⣶⣿⣿⣿⣿⣿⠿⠋⠠⠂⢀⣾⣿
⣿⣿⣿⣧⠄⠄⢵⢠⣈⠛⠿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢋⡁⢰⠏⠄⠄⣼⣿⣿
⢻⣿⣿⣿⡄⢢⠨⠄⣯⠄⠄⣌⣉⠛⠻⠟⠛⢋⣉⣤⠄⢸⡇⣨⣤⠄⢸⣿⣿⣿
Recent Activity
107 hrs on record
last played on 19 Jul
11 hrs on record
last played on 11 Jul
14 hrs on record
last played on 11 Jul
Comments
Kaentos 27 Nov, 2022 @ 10:21am 
<3
Kaentos 10 Mar, 2022 @ 8:49am 
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!!!!' Skit 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.
Martin Byrde 29 Mar, 2020 @ 12:28pm 
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 @ 5:18pm 
1+1 = 2 but 2 + 2 = 4
tell me why
Kaentos 23 Feb, 2020 @ 11:54am 
█▀▀▄░█░█▀▀░░█▀█░░█▀█░█░
█░░█░█░▀▀█░░█▀▀█░█░█░█░
▀▀▀░░▀░▀▀▀░░▀▀▀▀░▀▀▀░▀░