Isnochys Math Problem #5 [HBSI]

avatar

Sorry for taking a break last week, but this week, we continue with FUN!

Let's look at the numbers from 1 to 10.
The smallest number that has all of them as a divisor without any remains is 2520

Now do it for 1 to 50;)
And win some HSBI!

Next week I will guide you through my answer.
It is an older script, I hope I get it right untel then:D

How to send me the answer?
By encrypted memo. Transfer 0.001 HIVE and start the memo with '#'.
If you do not have 0.001 HIVE to spare, just write it in the comment, I will give that change to you.
Also, write a comment, if you did send me an answer, otherwise I cannot give BEER to you!
:)))

Don't forget to witness vote for me!:)

Posted with STEMGeeks

imp waivio vyb hive-engine ctp cent cine pob creativecoin stem
0
0
0.000
15 comments
avatar
Don-1UP-Cheers-Cartel-250px.png

You have received a 1UP from @luizeba!

The following @oneup-cartel family members will soon upvote your post:
@ctp-curator, @cine-curator, @bee-curator, @ccc-curator, @stem-curator, @vyb-curator, @pob-curator
And they will bring !PIZZA 🍕

Learn more about our delegation service to earn daily rewards. Join the family on Discord.

0
0
0.000
Reply
avatar

This is gonna cause some overflow.

0
0
0.000
Reply
avatar

Very close.
Nothing is going to overflow.
Not this !BEER at least

0
0
0.000
Reply
avatar

Thank you for your witness vote!
Have a !BEER on me!
To Opt-Out of my witness beer program just comment !STOP below

0
0
0.000
Reply
avatar

I nearly missed this one,
answer sent 😀
!LOLZ

0
0
0.000
Reply
avatar

No worries, this series is not that strict as my quiz one ;)
!BEER

0
0
0.000
Reply