## Modular Number Tiles perfectly match Fib and Fib-like sequences (Fibonacci, Lucas etc)

https://i.redd.it/7cjgwzboh5q11.jpg

This will take some massive explaining……….. but I’m hoping someone will know what this is. I’m a non-math person but I have been playing with patterns/geometry alot….I’ll be using a lot of my own terminology as I am much more a geometry/pattern guy than a math guy, but I can explain any terms that aren’t understood.

It’s all quite simple.

These are “modular skins” that are tiled with diamonds (because they pinch around to create tori…;))

MODs are made into tiled “skins. Each skin is fractal and creates new versions of the skin (orientations…) (“FRAC-EXP…”)
The fib-seq is displayed in mod9 etc and is folded up on its self forming columns and rows that read out the same “circuits” (sequences running ‘long-ways’ diagonally ) (I’m sure there is correct jargon for all of these things…lol)

Can anyone see what this is? I am being brief because I’d have to write a small book to explain everything here and how it was derived etc… Is this all known and understood under names I am not aware of?
MOD9 creates the sequence 1,2,4,8,7,5 which is doubling (1,2,4,8,16,32,64 etc) and going backwards is halving, 0.5, 0.25(7), 0.125(8), 0.0625(4), 0.03125(2), 0.015625(1).

submitted by /u/Barbitone396

## An interesting variation of the Monty Hall Problem

Only two doors. Monty hides a random real number (by some random distribution only Monty knows) behind each of the doors. You can choose one door and Monty shows you the number behind it. Now Monty asks you if you want to take that number or if you want to switch and take the other number that’s still hidden behind the other door. If you pick the bigger number, you win. Otherwise you lose.

Question: Is there any strategy you can play such that your odds of winning are bigger than 50%?

Edit: One very important thing I forgot. The numbers Monty chooses are always two different numbers! Otherwise he could just always choose the same number twice and obviously my chance of choosing the bigger one is zero.

submitted by /u/whatkindofred

## Is it possible to find average of the sequence of data(integer) without knowing the total length of the sequence.

I only know the previous value and the current value, example:

I only get a new random value each time and i store it. Need to calculate the average of the whole sequence but i have no idea about the length of the sequence just the last value and current new value.

20 -> 15 -> 5 : AVG=13.33

BUT when i get 5 , i only know that the last value was 15 and current value is 5.

Length of sequence 3 and total sum is unknown.

submitted by /u/Ashpro96