Random commentary about Machine Learning, BigData, Spark, Deep Learning, C++, STL, Boost, Perl, Python, Algorithms, Problem Solving and Web Search
7 bouquet's of 13 roses and 3 chocolates eachrowan
yep 7 (13, 3). correct.
The formal solution should be:91 # 21 (mod x) (where # must be read congruency)so that: 91-21 = k x => 70/k=xnow we sould find a k, divisor of 70 such as:91 mod x = 0 and 21 mod x = 0k=10 e x=7 are out solution