where a and b are non-negative integers. How do I find out for which a this inequality has at least one solution for b? I want to use mathematical reasoning rather than testing.
Another, simpler, approach: pick an arbitrary b and describe the set Ab of all a's which satisfy the inequality. Then figure out which a's don't belong to any Ab.
P.S. Is there a penalty for having more posts in the thread than the OP?
I am far from sure I understand what the real question is because it is obvious that you can never answer a question about an infinitie number of pairs of numbers by testing every pair. However, the question seems to be to determine some sort of description of or limits on n(b) where n(b) is the number of possible values of a such that a<b<a+108, given that a and b are both non-negative integers.
0≤a<b⟹0≤a<b2.b=0⟹b2=0⟹a<0, which is a contradiction.∴n(0)=0.b≥1⟹b2≥1⟹0≤a<b2⟹n(b)≤b2−1.
I admit that I have not worked this out, but I believe that working with the other constraint, namely
0<b2<a+108⟹−108<(b−104)(b+104)<a≥0,
may also lead to bounds on n(b). Let us know how far you get that way.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.