+9488 a. https://www.desmos.com/calculator/v50rjzsxtt
Since a can be any value > 0 , the graph will be different for each possible value of a .
(You can pick a different value for a with the slider.)
b. https://www.desmos.com/calculator/te6iwcz85v
Like the first graph, this graph will be different for each possible value of b .
+118704
Some interesting coding by GingerAle and Heureka: Thanks to both of you :)
It is from this question:
https://web2.0calc.com/questions/modular-math_8
n=3331⋅1247⋅[1247φ(231)−1(mod231)]⏟=modulo inverse 1247 mod 231⏟=1247230−1mod231⏟=1247229mod231⏟=113+1361⋅231⋅[231φ(1247)−1(mod1247)]⏟=modulo inverse 231 mod 1247⏟=2311246−1mod1247⏟=2311245mod1247⏟=637n=3331⋅1247⋅[113]+1361⋅231⋅[637]n=469374541+200267067n=669641608n(modm)=669641608(mod288057)=197140n=197140+k⋅288057k∈Znmin=197140
CODING:
\begin{array}{rcll} n &=& {\color{red}3331} \cdot {\color{green}1247} \cdot \underbrace{ \underbrace{ \underbrace{ \underbrace{ [ {\color{green}1247}^{\varphi({\color{green}231})-1} \pmod {{\color{green}231}} ] }_{=\text{modulo inverse 1247 mod 231} } }_{=1247^{230-1} \mod {231} }}_{=1247^{229} \mod {231}}}_{=113} + {\color{red}1361} \cdot {\color{green}231} \cdot \underbrace{ \underbrace{ \underbrace{ \underbrace{ [ {\color{green}231}^{\varphi({\color{green}1247})-1} \pmod {{\color{green}1247}} ] }_{=\text{modulo inverse 231 mod 1247} } }_{=231^{1246-1} \mod {1247} }}_{=231^{1245} \mod {1247}}}_{=637}\\\\
n &=& {\color{red}3331} \cdot {\color{green}1247} \cdot [ 113] + {\color{red}1361} \cdot {\color{green}231} \cdot [637] \\
n &=& 469374541 + 200267067 \\ n &=& 669641608 \\\\ && n\pmod {m}\\ &=& 669641608 \pmod {288057} \\
&=& 197140 \\\\
n &=& 197140 + k\cdot 288057 \qquad k \in Z\\\\
\mathbf{n_{min}} & \mathbf{=}& \mathbf{197140 }
\end{array}
The first time was when I thought I made a mistake, but I didn’t, so I was wrong in thinking I did. 
