Welcome to Fall’s documentation!

Indices and tables

• Index

• Module Index

• Search Page

Fall main

import this

source.main.setup(*argm)

TO DO

Fall controller

source.fall.Binary_fall(n)

Operator of fall. Fall of 2: 1 number in, 1 out :

source.fall.Collatz(n)

Somthin arround Collatz algorithme

source.fall.Interpreter(x)

Interpreter of Cpt13_triangle.

! buggy wrong variable passing return n+lvl,lvl+1

source.fall.Op_Pythagoras(a, b, c)

Pythagoras Operator: Classical theorem and ‘2.0 pythagoras’ 3 entry, 2 paradigms.

source.fall.Operator_Lambda(n)

Pursuing Operator, seek and name

source.fall.Operator_Phi(n)

Creative Operator, destroyer Definition of fraction by level.

source.fall.Operator_Pi(n)

Stoping Operator

source.fall.Operator_fall(n)

Operator of fall. Fall of numbers: Stable operator of fall

source.fall.Quint(n)

Bounce Operator.

source.fall.check(p, q, r)

Triply redundant operator, Verify a product a.b=c in three different ways.

‘Counter for a.b=c’

source.fall.count_P0(n)

Accept all abstract variables # 1 2 3 4 # 5 6 7 0

source.fall.count_P1(n)

Accept variables from P_0 & P_3 # 0 1 2 3 # 4 5 6 7

source.fall.count_P2(n)

Accept variables from P_0 & P_1 # 1 2 3 8 # 5 6 7 4

source.fall.count_P3(n)

Accept variables from P_0 & P_1 # 1 2 4 5 # 6 7 8 9

source.fall.count_P4(n)

Accept variables from P_0 & P_2 # 0 3 6 9 # 1 2 3 5

source.fall.counter(n)

paradoxical counter, build around bases 9 & 11 shitty name waiting for a better

source.fall.counter_56(n)

a counter/table

source.fall.counter_65(n)

a counter/table

source.fall.cpt13_Triangle(n, lvl)

Abstract operator/counter 001 100 112 011 345 110 count in level of primes OUTPUTS 1* 2* 3*

source.fall.cpt42_Square(n, lvl)

Abstract operator/counter

source.fall.cpt_boolean(a, b, c, x, y, z)

Astute: cpt_boolean(a,b,a-b,1/cpt,y,cpt^2-y^2) see addendum !!

discriminate between two Pythagorean triplets: ex 3 4 5 vs 1 1 2

source.fall.define(b)

Define is a paradox & repetition based function & an interface to other paradoxical functions. 1 entry, 3 equality, 2 paradigms. !! see ‘addendum’ readme

a gifted little liar, frequently interesting Always repeats it’s entry, then print something else. Always has 3 consecutive values equals. Always hides an important information: the 6th value is never returned.

source.fall.infinite_2loop(p)

infinite_2loop is a paradox & repetition based function. Infinite loop by construction, stops with paradigm 1

? if p==24: return 26

source.fall.infinite_3loop(p)

infinite_3loop is a paradox & repetition based function. Infinite loop by construction, stops with paradigm 2

? if p==23: return 27

source.fall.is_prime(n)

Primality test.

source.fall.negation(n)

Returns its opposite, a stupid little liar, sometine intersting

source.fall.quaternary_fall(a, b, c, d)

Operator of fall. Fall of the Square: 4 enters, 1 out

2/2 out “2^2.2/3.5” “6/5”

source.fall.setup(argmn)

This is how we comment

source.fall.sh4d0w(a, b, c)

r = b1 ^ a * b2 ^ b * b3 ^ c

source.fall.signature_15(n)

O moron pay attention, here lies the secret of primes alternative counter with 15 for bascule

source.fall.signature_25(n)

O moron pay attention, here lies the secret of primes alternative counter with 25 for bascule

source.fall.signature_5(n)

O moron pay attention, here lies the secret of primes alternative counter with 5 for bascule

source.fall.spell(n)

Attempt to spell number from the left ? ‘the pb of division by 2’

source.fall.ternary_fall(n, x)

Operator of fall. Fall of the Triangle: 2 enters, 2 new, 3 out See addendum ternary_fall !!!

Preamble counter: “2^2/3”

readjust case np.mod 17+8 show value before np.modification readjust case np.mod 10+n

source.fall.transcendant_fall(a, b, c)

Operator of fall, for trenscendant numbers

Fall models

exception source.rational.RationalException(message)

source.rational.setup(argmn)

Define model

class source.define.Define(define_init=0, define_return=1, define_string='DefineInstance')

Define Class

define(define_init)

Define is a paradox & repetition based function & an interface to other paradoxical functions. 1 entry, 3 equality, 2 paradigms.

a gifted little liar, frequently interesting Always repeats it’s entry, then print something else. Always has 3 consecutive values equals. Always hides an important information: the 6th value is never returned.

exception source.define.DefineException(message)

source.define.setup(argmn)

Fall exceptions 2

exception source.exceptions.Fall_2.B

exception source.exceptions.Fall_2.C

exception source.exceptions.Fall_2.D

source.exceptions.Fall_2.cls

alias of source.exceptions.Fall_2.D

Fall exceptions 3

exception source.exceptions.Fall_3.B

exception source.exceptions.Fall_3.C

exception source.exceptions.Fall_3.D

source.exceptions.Fall_3.cls

alias of source.exceptions.Fall_3.D

Fall exceptions 4

exception source.exceptions.Fall_4.A

exception source.exceptions.Fall_4.B

exception source.exceptions.Fall_4.C

exception source.exceptions.Fall_4.D

source.exceptions.Fall_4.cls

alias of source.exceptions.Fall_4.A