User contributions for Hakerh400

07:5707:57, 8 June 2025 diff hist +1,136‎ List of ideas ‎ →‎Mathematics: Add a new section, refactor one idea, add two new ideas

12:2612:26, 3 May 2025 diff hist −1‎ m Try to Take ‎No edit summary
12:2212:22, 3 May 2025 diff hist 0‎ m Try to Take ‎No edit summary
12:1612:16, 3 May 2025 diff hist +3,125‎ Try to Take ‎ Add operations and implement goldbach

14:5614:56, 20 March 2025 diff hist +4‎ Ash ‎No edit summary
14:5514:55, 20 March 2025 diff hist +10‎ User:Hakerh400 ‎ * Ash current
14:5414:54, 20 March 2025 diff hist +10‎ Language list ‎ +Ash
14:5414:54, 20 March 2025 diff hist +2,209‎ N Ash ‎ Created page with "__NOTOC__ {{infobox proglang |name=Ash |paradigms=Imperative |author=User:Hakerh400 |year=2025 |class=Turing complete |majorimpl=Implemented |files=<code>.txt</code> }} '''Ash''' is an esolang invented by User:Hakerh400 in 2025. == Overview == Memory is represented as a tape infinite in both directions. The tape is divided into cells. Each cell contains a bit. Initially, every bit is random, e..."
14:4914:49, 20 March 2025 diff hist −36‎ AGG ‎ Remove uncertified claims

17:2917:29, 19 March 2025 diff hist −1‎ m User:Hakerh400/Types of exceptions ‎No edit summary current
17:2817:28, 19 March 2025 diff hist +61‎ User:Hakerh400 ‎ →‎Articles
17:2717:27, 19 March 2025 diff hist +3,548‎ N User:Hakerh400/Types of exceptions ‎ Created page with "__NOTOC__ In this article we discuss various types of exceptions and how they can be used in some practical situations. === Hard exception === Hard exception is used to terminate the program immediately. It cannot be caught in any way. It is used when a fatal error occurs, such as a failed assertion or an invalid value of some invariant. In Haskell it is called <code>error</code>. This type of exception can be used in the following situations: * A part of the program..."

18:5418:54, 17 March 2025 diff hist +87‎ User:Hakerh400 ‎ →‎Articles
18:5418:54, 17 March 2025 diff hist +2,323‎ N User:Hakerh400/Flexible dependencies in Haskell ‎ Created page with "It is well known that in Haskell there is no easy way to put functions that depend on each other into seperate files. The reason is because Haskell does not allow circular imports (like in Node.js) or header files (like in C). GHC supports <code>hs-boot</code> file that in some sense acts as a header file and allows mutually dependent functions to be in separate files, but it is seems excessively complicated for such a basic functionality and requires extra setup and mai..." current

16:0816:08, 12 March 2025 diff hist +43‎ User:Hakerh400/Pair sum ‎No edit summary current
16:0716:07, 12 March 2025 diff hist +11‎ User:Hakerh400/Pair sum ‎No edit summary
16:0516:05, 12 March 2025 diff hist +8‎ User:Hakerh400/Pair sum ‎ →‎External resources
16:0516:05, 12 March 2025 diff hist +133‎ User:Hakerh400/Pair sum ‎No edit summary
16:0416:04, 12 March 2025 diff hist +39‎ User:Hakerh400 ‎ →‎Number sequences
16:0416:04, 12 March 2025 diff hist +2,852‎ N User:Hakerh400/Pair sum ‎ Created page with "The sequence begins with: 1, 7, 23, 19, 34, 31, 29, 34, 39, 40, 35, 38, 43, 51, 47, 50, 45, 52, 56, ... === How it is formed === Let <code>f</code> be a function that takes a natural number and returns the number formed by the concatenation of the sums of consecutive digits in base <code>10</code>. For example, consider the number <code>3571</code>. Calculate the sums <code>3 + 5 = 8</code>, <code>5 + 7 = 12</code>, <code>7 + 1 = 8</code>. Concatenate the sums: <code..."

17:4617:46, 11 March 2025 diff hist +2‎ m User:Hakerh400/Rectangle with rational side length ‎No edit summary current
17:4417:44, 11 March 2025 diff hist 0‎ User:Hakerh400/Rectangle with rational side length ‎No edit summary
17:4017:40, 11 March 2025 diff hist +95‎ User:Hakerh400/Rectangle with rational side length ‎No edit summary
17:3417:34, 11 March 2025 diff hist +1‎ m User:Hakerh400/Rectangle with rational side length ‎ →‎Proof
17:3117:31, 11 March 2025 diff hist +3‎ User:Hakerh400/Rectangle with rational side length ‎ →‎Statement
17:2917:29, 11 March 2025 diff hist +93‎ User:Hakerh400 ‎ →‎Proofs
17:2917:29, 11 March 2025 diff hist +9,846‎ N User:Hakerh400/Rectangle with rational side length ‎ Created page with "=== Statement === Any rectangle that is tiled with finitely many rectangles that have at least one rational side, also has at least one rational side. === Proof === We perform strong induction on the number of small rectangles. Suppose the big rectangle is tiled with '''<code>n</code>''' small rectangles.<br> <font style="color:white;margin-left:50px">.</font>If '''<code>n = 1</code>''', the small rectangle is equal to the big rectangle, so the condition is trivially..."

Navigation menu