I wonder if this can be done with a map somehow, in a sane way. I needed to be able to check the gcd between numbers, this is built in as GCD, exampleĬhecking from 1.n-1 is tedious however, where Do comes in handy. ![]() It’s not rocket science how to compute the set, but I thought this’d serve as a nice reference, with examples, to basic operations in the Wolfram Language on the Wolfram Cloud. ![]() Īnd I wanted to do it “quickly”, in a math engine, so what better place than on Wolfram’s Development Platform! the set of integers with greatest common divisor (gcd) with equal to, formally. ![]() Iwas reading about group theory recently, for basic cryptography, and wanted a function for computing the set, i.e.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |