Just make sure that your unfair coin is actually a proper coin. Each flip should be uncorrelated to previous flips. Real coins, even unfair coins, have no memory. If your coin has memory (e.g. brings tail more often after a tail and head more often after a head) then this program will not work properly.

I don't remember where I learned the technique but I think it was from here: https://amakelov.wordpress.com/2013/10/10/arbitrarily-biasing-a-coin-in-2-expected-tosses/

"SIMULATED PROB"?P Lbl 0 1➔I Lbl 1 Do "COIN TOSS"?➔A "COIN TOSS"?➔B LpWhile A=B If A:Then Frac(Intg(Px2^(I))÷2)x2➔D "SIMULATED TOSS:":D◢ Goto 0 IfEnd I+1➔I Goto 1]]>

Try for example:

4 divided by 3

Result = 4/3

Press shift+= and get the result in decimals (= 1.33333333)

Multiply this by 2

Result = 8/3

Press shift+= to get result in decimals

Result = 5.333333333

8 divided by 3 is obviously not 5.33333333, but rather half (2.666666667).

For some reason, while doing the operations above, it multiplies the result (8/3) again before showing it in decimals.

Am I missing something? Is there some way to avoid this? Is it a bug?

Thanks.

]]>The best way to prove this since it doesn't explicitly involve limits is this.

1/9 + 8/9 = 9/9

Now do each division the usual way you learn at school.

0.11111... + 0.88888... = 1

Now start adding the first two numbers. You will be adding ones to eights forever and ever. You will never write anything other than nines.

So:

0.99999... = 1

Bye hey, one could argue that 0.11111... is not equal to 1/9. It is just infinitely close to it but not equal. Well if that is the case, then what is the distance between 0.11111... and 1/9?

Let's calculate it. Start dividing 1 by 9 and before you write down each digit subtract it from the corresponding digit in 0.11111... Well, you're never going to write ant digit other than zero. So the distance is 0.00000... There is no reason to even suspect that there will be a 1 or any other digit at the end of this infinite sequence of zeroes because 1/9 will keep giving you ones to subtract from ones. So the distance is exactly zero, not just close to zero. So 1/9 is exactly 0.1111... so the proof above stands.

(BTW I know that it is impossible to have an infinite sequence of zeroes that ends in 1, but I saw many people thinking that it is OK to write 0.000...01 as if this is a valid number so I just go with it)]]>

You think of two **positive** numbers. No limits in how big they can be as long as you can type them in the calculator. They can be integers, reals, whatever. Just make sure you know which number is the first one, and which one is the second one that you thought of. Eg. the first number can be 190 and the second number can be 42.

Then the program will ask you to give it one of this two numbers. Eg it will ask for the second number, so you will type in 42.

Then the program will make a prediction, either it will say that this is the smallest of the two numbers, or it will say that it is the biggest. It will ask you whether the prediction was correct so that it can keep score.

The "paradox" is that the calculator will have >50% score when you'd expect that there is no way to be more than 50% correct in such a game. Check the video for an explanation on why this is possible.

0➔W:0➔T:0➔A Lbl 0 50➔G T⇒(0.5+Ran# )x(A÷T)➔G "THINK OF 2 NUMS"◢ If RanInt#(0,1):Then "WHAT IS THE 2ND"?➔N Else "WHAT IS THE 1ST"?➔N IfEnd "IS THIS THE" If N<G:Then "SMALLEST ONE?" Else "BIGGEST ONE?" IfEnd "1=YES 0=NO"?➔R R=1⇒W+1➔W T+1➔T A+N➔A "WIN RATIO:" W÷T◢ Goto 0]]>

?M ?N N→B N<M⇒M→B For 1→F To B Cls Locate 1,1,BxF If Frac(BxF÷N)=0 And Frac(BxF÷M)=0 Then Break IfEnd Next Cls "LCM":BxF]]>

?M ?N M→S N<M N<M⇒N→S For 1→F To S If Frac(S÷F)=0 Then Cls Locate 1,1,S÷F If Frac(N÷(S÷F))=0 And Frac(M÷(S÷F))=0 Then Break IfEnd IfEnd Next Cls "GCD":S÷F]]>

how to enter the semicolon symbol ( ; ) on a casio fx5800p;

or also another operation separator different from ( : ) and colon ( , )

]]>I checked my calculator requirements, downloaded some upgrade .bin files, processed them with PolyOS software and tried to flash the one i selected to the calculator using FX-Remote 2.03, it got the file, the calc recieved some data and a pop appeared saying that it detected a GII model and i had to wait for it to display "waiting" and then continue but the device gets stuck at the unknown BIOS (serial numbers i guess) and press restart button but it doesn't display what it should causing the failure of the process so i have to go through it all over again with no result so, can somebody help me solving this problem please, if possible please reply.

Thanks in advance.

PS: the upgrading tutorial link is the following:

https://tiplanet.org/forum/viewtopic.php?f=96&t=19592]]>

I want to know this for some experimental purposes so, if anyone knows any way to do this or a software that isn't FA-124 please tell me.

Thanks in advance.]]>

I jut got a fx-9860G slim with OS 1.10 and downloaded fx-9860G Slim OS Ver.2.00 Update program.

I tried to run this update program on my PC, but always ended up with "The wizard was interrupted before fx-9860 OS Update could be completely installed" error.

My PC OS is Windows 7 64bit, I'm just wondering that is this normal?

Cheers

]]>Any comment the forum regarding the new Frech version of the calculator Casio GRAPH 35+E II with Python?

Anybody has one?

https://www.casio-education.fr/products/graph-35-e

Looks awesome. I suppose C.Basic can also be installed.

]]>Help please. ]]>

A little theory:

When you multiply two integers if the result is larger than 10 digits the calculator will convert it to floating point and display it in scientific notation. As a result you lose the least significant digits. This algorithm uses the method we learn in elementary school (called "long" multiplication) to get the result. This algorithm has a running time of O(n^{2}) where n is the number of digits.

If you want more info on how the algorithm is implemented in computers read this: https://en.wikipedia.org/wiki/Multiplication_algorithm

To enter the 2 numbers you want multiplied change the first two lines where they are assigned to matrices A and B. Start entering from the least to the most significant digit.

Say you want to multiply 23456 by 45678. You should enter this:

[[6,5,4,3,2]] -> Mat A

[[8,7,6,5,4]] -> Mat B

If one number has fewer digits than the other pad it with 0's until they have the same length. Example:

1234567 x 456

should be entered as

[[7,6,5,4,3,2,1]] -> Mat A

[[6,5,4,0,0,0,0]] -> Mat B

Then run the algorithm and the result will be displayed. I didn't bother with a fancier data entry since this is just a test.

MEMORY LIMITS ON A CASIO fx-9860 GII

In Casio Basic it seems the max numbers that can be multiplied is around 47 digits each. In C.Basic the limits are much higher. Your limits might vary depending on your calculator.

SPEED TESTS

I'm testing the algorithm with two 47-digit numbers.

CasioBasic: ~39sec

C.Basic: ~0.5sec

Huge difference. Such differences can be observed between interpreted and compiled languages for example between Python vs C++.

So here's the program to try for yourselves.

'ProgramMode:RUN '=== Large number '=== multiplication '=== least_->_most sgnf [[4,5,6,7,8,9,3,3,3,7,8,9,6,6,6,4,4,4,4,2,2,1,1,0,0,6,6,6,0,0,1,6,7,8,9,4,3,1,2,8,8,8,8,2,4,6,8]]->Mat A [[3,2,1,2,2,8,8,8,8,1,6,6,6,1,0,4,4,4,4,0,0,0,3,3,3,6,6,6,0,0,0,1,7,8,9,2,7,8,9,4,3,2,1,2,4,6,8]]->Mat B Trn Mat A*Mat B->Mat C Mat C ClrList 1 Dim Mat C List Ans[1]->D 1->L 0->C For 1->I To D C->S:0->C For 1->J To I S+Mat C[J,I-J+1]->S '"J,I-J+1" 'J_Disps_ 'I-J+1_Disps_ Next S Rmdr 10->List 1[L] S Int/ 10->C 1+L->L Next For 2->I To D C->S:0->C For D->J To I Step -1 S+Mat C[I+D-J,J]->S '"I+D-J" 'I+D-J_Disps_ '"J" 'J_Disps_ Next S Rmdr 10->List 1[L] S Int/ 10->C 1+L->L Next '"C=" 'C_Disps_ '===ADD LAST CARRIER C>0=>C->List 1[L] '=== List 1 to str ""->Str 1 "0123456789"->Str 2 For 1->I To Dim List 1 StrMid(Str 2,List 1[I]+1,1)+Str 1->Str 1 Next Locate 1,2,StrMid(Str 1,1,20) Locate 1,3,StrMid(Str 1,21,20) Locate 1,4,StrMid(Str 1,41,20) Locate 1,5,StrMid(Str 1,61,20) Locate 1,6,StrMid(Str 1,81,20) Locate 1,7,StrMid(Str 1,101,20)

In case you're bored to copy/paste download the .g1m file from here:

https://1drv.ms/u/s!An0LL5AV9kQjhtpDW4_7yDuo56KD8w?e=wJCmfb

Congrats to sentario21 for the amazing C.Basic language.

]]>

These two contact methods are ended of support in 2014, 2017 and 2018 respectively, thus they are useless now.

I don't know if the IP.Board software doesn't allow to do that. But can you remove/disable them?

Thanks.

]]>