veganism.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
Veganism Social is a welcoming space on the internet for vegans to connect and engage with the broader decentralized social media community.

Administered by:

Server stats:

296
active users

#arithmetic

0 posts0 participants0 posts today

@ConditionalCoder
The phrase you may be looking for is "non-associative".
Also, note the difference between the binary operation of subtraction and the unary property of negativeness for which we use same symbol.

(+15) - (+5) - (+1) = (+9)
(+15) + (-5) + (-1) = (+9)

(+15) - ( (+5) - (+1) ) = (+11)
(+15) - ( (+5) + (-1) ) = (+11)

Another fun example of non-associativity is in exponentiation. :-)
en.wikipedia.org/wiki/Associat
#maths #arithmetic #algebra #mathematics

en.wikipedia.orgAssociative property - Wikipedia

🎉 Ah, the classic tale of the programmer who saw the light and returned to the glorious '90s to worship at the altar of #C. 🚀 After 20 years of #Rails, our hero ditches modern convenience for C's sweet embrace, because who needs progress when you can dive into the abyss of #pointer #arithmetic and null pointer dereferences? 😂
kmx.io/blog/why-stopped-everyt #programming #nostalgia #programming #developer #tech #humor #HackerNews #ngated

www.kmx.iokmx.io blog : Why I stopped everything and started writing C againWelcome to kmx.io

#decompwlj ➡️ It's a decomposition of positive integers. The weight is the smallest such that in the Euclidean division of a number by its weight, the remainder is the jump (first difference, gap). The quotient will be the level. So to decompose a(n), we need a(n+1) with a(n+1)>a(n) (strictly increasing sequence), the decomposition is possible if a(n+1)<3/2×a(n) and we have the unique decomposition a(n) = weight × level + jump.

We see the fundamental theorem of arithmetic and the sieve of Eratosthenes in the decomposition into weight × level + jump of natural numbers. For natural numbers, the weight is the smallest prime factor of (n-1) and the level is the largest proper divisor of (n-1). Natural numbers classified by level are the (primes + 1) and natural numbers classified by weight are the (composites +1).

For prime numbers, this decomposition led to a new classification of primes. Primes classified by weight follow Legendre conjecture and i conjecture that primes classified by level rarefy. I think this conjecture is very important for the distribution of primes.

It's easy to see and prove that lesser of twin primes (>3) have a weight of 3. So the twin primes conjecture can be rewritten: there are infinitely many primes that have a weight of 3.

I am not mathematician so i decompose sequences to promote my vision of numbers. By doing these decompositions, i apply a kind of sieve on each sequences.

➡️ oeis.org/wiki/Decomposition_in

@beforewisdom
Australian actually, but I have taught both the U.K. and N.S.W. curricucula. Some of the terminology is different, but of course all the rules are exactly the same (as they are everywhere).

Interesting that you mention #arithmetic as what I've found is the students who say they hate #Maths are the students who actually are lacking in their arithmetic skills! (so OF COURSE they are struggling with the harder stuff). Once they're up to speed with that they don't hate #math anymore!