Rosario

Possible nor exist inverse of m, in n if gcd(m,n)!=1

5x5=25 25%6=1 and 5^-1 mod 6= 5

2x4=8 2x5=10 it would be 2 4 0 2 4 there is no 1

2×1=2 2×2=4 2×3=6 what is 2^-1 mod 6? It seems not exist

event hadle for errors is not the way to go... the way is return a value from a function

I prefer always to write a<b /\ b<c than b>a /\ b<c

@UnrelatedString yes I have seen the book, have precedence deference operator & and * on aritmetc operators

The C definition for consider false ==0 and true !=0, is ok for golfing, instead array of bool and boleans not

in C int *a,*b; than *a+*b==(*a)+(*b) or *a+*b==*(a+(*b))

in C int *a,*b; than *a+*b==(*a)+(*b) or *a+*b==(*a+(*b))

Dependency of alcol can not be if one not drink alcohol for 1 or 2 week

Yes i comvine myself in reduce alchool

": (1) DNA methylation" before alcohol has to travel through membrane of cell and nuclear membrane

sostanza cancerogena e mutagena dico... se era vero mi sa che molti dovevamo essere gia morti

inabile a trovare in internet lo studio fatto su animali o persone che conferma che l'alcool è cancerogeno. lo dicono, ma dove è lo studio?

questo lo hanno trovato nella pioggia "Composti del Cadmio"

how is alcool cancerogenic? because is a dna broken substance or other?

mio zio diceva bevi... certo non senza cibo subito dopo

Happy new new year

Buon Natale

above a=b dont mens a is true or b is true

in pratice ↔ is as you = only there is (a=b) = a->b and b->a

a^(¬bVb) ↔ a

even use axiom ¬(¬avb) ↔ a^¬b

i defined ↔ as "(a↔b) ↔ (a→b) ˄ (b→a)"

for example this x→(y→z) = x→((x→y)→z) = y→(x→z) is this for me (x→(y→z)) ↔ (x→((x→y)→z)) ↔ (y→(x→z)) where "(a↔b) ↔ (a→b) ˄ (b→a)"

if we can write "f->g" and "g->f", than the last 2 go in axioms set, and we can write "(f->g) and (g->f)" and "(f->g) or (g->f)" and "f<->g" that will be all "derivati dagli assiomi" and will use for build other string

i don't understand f=(f->g)->(g->f)->f=(f->g)->(g->f)->g=g because = for me is defined only in the sets not in the logic...

followed form axiom = derivati dagli assiomi, in pratica possiamo scrivere nel foglio di carta tutti gli insiemi di lettere o stringhe ricavate dagli assiomi

@l4m2 if we can write "f->g" and "g->f" or in equilvalent way "f->g" and "g->f" are followed from the axioms, than we can write too "(f->g) and (g->f)" and "f<->g" not "f=g"

possible symbols without a meaning

@l4m2 for me your = is <-> ; there was i time where i wrote all logic axioms and math axioms

@lyxal no

I see a problem here for ⌹. It seems a⌹b would find the solution of linear sys coefficients in b matrix with result a array so linear system bx=a. If the solution of bx=a exist and is only 1, all ok. What it would return if the system has no solution? What would return if the system has infinite solutions?

If 1 means there is room X available, 0 it is not available, ∨/ means if return 1, there is at last one free room. If return 0, there is no room available

@Adám if the array is one bolean array it would return the or of all

∨/ a b c would be a ∨ (b ∨ c)

I'm not one expert...i from apl like the way right to left to read the line

Apl as c++ is too much complex one has to reduce construct to use to few for make all simple... C or x86 assembly are not so complex

Is matrix upper triangular?

in page "https://en.wikipedia.org/w/index.php?title=APL_syntax_and_symbols&diff=prev&oldid=1270300238" for matrix identity is showed "∘.=⍨∘⍳" here NARS APL it seems ok even "∘.=⍨⍳"

x[⍸x=0]←y[⍸x=0]

Pheraps im ot...

For(i=0;i<n;++i)if(a[i]==0)a[i]=b[i] this as it be C

at last for me... if in x[i] there is 0, then x[i]=y[i]

@RubenVerg the best way is the more easy to think, one loop