I had encountered a strange behavior while trying to implement Tupper Formula.
Is this a bug or SMath shouldn't calculate modular of such a long number?
Sorry for very big picture but don't know how to show it in here else.
Build 0.99.7666 on Linux, same result with previous old builds by the way.

Regards

tupper.sm (4 KiB) downloaded 23 time(s).

SMath doesn't have exact integer arithmetics. Numbers are handled as floats with finite precision. You will find that k+1=k evaluates to true. If you want to do exact integer arithmetics, Unfortunately, you can't even use CAS plugins like maxima or maple because any input is handled by SMath first before conveying it to the plugin. This includes downgrading of numeric constants to IEEE 754 floats.

Maxima has a mechanism of using string input to circumvent this but this will look extremly ugly in the SMath sheet.

tupper_kr.sm (4 KiB) downloaded 23 time(s).

Wrote

Is this a bug or SMath shouldn't calculate modular of such a long number?

"modular" ... you mean 'mod'
Write ... mod(k,1.23456789)
Write ... mod(k,123456789.987654321)

Wrote

SMath doesn't have exact integer arithmetics. Numbers are handled as floats with finite precision.

Thanks Martin, I figured so.
This is why there is a question, "bug or not".
Clearly it is not a bug but how SMath works.

Regards

Wrote

This is why there is a question, "bug or not".

Nothing new here. I posted the attached long time ago, no answer.
Too big numbers chokes Smath.

Critical error.sm (2 KiB) downloaded 20 time(s).