# "*": "https://raw.githubusercontent.com/wefindx/schema/master/intent/oo-item.yaml" # "base:title": "0oo - (A+xB)/C = y" "og:title": "(A+xB)/C = y" "og:description": "Is there an already is such an algorithm out there, to generically and efficiently find a place where an integer summation series such as A+B+B+B+... becomes exactly divisible by some other integer C." "og:image": "https://avatars0.githubusercontent.com/u/28134655" "og:url": "/intent/139001/" "base:css": "/static/css/bootstrap.min.9c25540d6272.css" "base:extra-css": "/static/css/base.57997aeac1df.css" "base:favicon": "/static/favicon.acaa334f0136.ico" "base:body_class": "" "layout:logo": "/static/0oo.8d2a8bbef612.svg" "layout:index": "/" "layout:menu": "/menu/" "layout:categories": "/intents/" "layout:ideas": "/methods/" "layout:projects": "/projects/" "layout:users": "/users/" "layout:about": "/about/" "layout:help": "/help/" "layout:bug_report": "https://github.com/wefindx/0oo" "layout:login": "/accounts/login/" "layout:light-off": "/darken/?darken=true" "layout:set-monolingual": "/mulang/?mulang=false" "layout:lang": "Language" "layout:set-language-post-action": "/i18n/setlang/" "layout:csrf-token": "xhCfBLeLbyB8sQKMzi9N9hEmBhLcwnbJ48Sgtn59h7wcCbXHVuagi5aWwcsJONN4" "layout:input-next": "/intent/139001/" "layout:languages": [{"code": "ja", "is-active": "false", "name": "日本語"}, {"code": "lt", "is-active": "false", "name": "Lietuviškai"}, {"code": "zh-hans", "is-active": "false", "name": "简体中文"}, {"code": "en", "is-active": "true", "name": "English"}, {"code": "ru", "is-active": "false", "name": "Русский"}, {"code": "oo", "is-active": "false", "name": "O;o,"}] # "item:title": "(A+xB)/C = y" "item:votes": +1 "item:add-vote": "#addnote" "item:intent": "/intent/139001/?l=en" "item:base-administration": false "item:body": | Is there an already is such an algorithm out there, to generically and efficiently find a place where an integer summation series such as A+B+B+B+... becomes exactly divisible by some other integer C. "item:permalink": "/intent/139001/?l=en" "item:source-date": "" "item:owner": "Mindey" "item:ownerlink": "/user/147/Mindey" "item:created": "2022-04-29T17:01:15.050371" "item:intent:child:add": "/admin/hlog/intent/add/?parent=139001" # "item:method:items": "item:method:add": "/admin/hlog/method/add/?parent=139001" "item:comment:add": "/intents/addnote?parent=139001" "item:comment:add:csrf_token": "xhCfBLeLbyB8sQKMzi9N9hEmBhLcwnbJ48Sgtn59h7wcCbXHVuagi5aWwcsJONN4" "item:comment:form": |
  • Mark if the comment raises new questions.
  • Mark if the comment contributes potential solutions.
  • Mark if the comment contributes facts for reasoning.
  • Please, log in. # "item:comment:items": - "id": "r-275001" "text": | I think, [notexactly] from Halfbakery has a point: "Unless I'm misunderstanding the problem statement, this seems like a trivial variant of the least common multiple problem, which can be solved by several algorithms [link]. (A+xB)/C = y seems to me to be equivalent to y = [LCM](https://en.wikipedia.org/wiki/Least_common_multiple)(A - C, B)." Perhaps the solution is simple, but I had not yet verified this (TBD later). "owner": "Mindey" "ownerlink": "/user/147/Mindey" "permalink": "/intent/139001/?l=en#r-275001" "created": "2022-04-29T17:10:46.946356" "vote": "" "base:js": "/static/js/base.c7357c06cc89.js"