latex

@Jonathan Eshetu – Is that good?

@Jonathan Eshetu – overal nice. some improvements: a = int(input())

i = min(a,b)
while a%i !=0 or b%i !=0:
    i -= 1
cd = i
print(cd)

@Jonathan Eshetu – what is the difference between the condition that i used and your condition?
there is an algorithm from euklid for gcd.
can you implement it as recursive function?

@Jonathan Eshetu – i did the free course on this page: coursera.org
it is in russian, but i translated the pages (i ignored the videos)

@Jonathan Eshetu – we used different conditions. can you explain what the difference between those conditions is?

@Jonathan Eshetu – nice solution for the first problem.
for the second: its a nice example to show that it might cause problems if a function is used as argument for the function itself.
the return value is 3 + something. so i checked what happened if n=3.
_ = 4 will result in return 0 -> no problem
_ = 3 will result in return 0 -> no problem
_ = 2 will result in return 3+something -> might cause a problem
but you can also use a loop and call the function with different values to check the results. i do this sometimes to figure out if there might be an error.
have u checked the russian course?

@Jonathan Eshetu – you can just try this ;-) :

def rec(n):
    print(n)
    if n <= 0:
        return 0
    return 3 + rec(rec(n - 2))

N = 5
for i in range(1, N):
    print(i, rec(i))

the recursion depth is limited, so big input values will cause a problem even with _=3 and _=4.

task: create a short code to find the max recursion depth.

@Jonathan Eshetu – sure. schoolwork first.
this is a proposal for a coding environment: repl.it
this is for learning: realpython.com
(the 2nd seems to be similar to your edabit.com)

@Jonathan Eshetu – i have to think about the logic to understand why the powers of 2 occure here.
but there is a missunderstanding. my intention was not to check the depth of this particular function. (50 is much too low to test this one).
its more easy to use a simple function that just increases the given value.

@Jonathan Eshetu – cool trick. ty

@Jonathan Eshetu – i would have used:
engText = ""
and then:
engText += key

but good to know how to convert an array into a string.

@Jonathan Eshetu – yeah thats where i struggled with the online course: i had no experience with python dictionaries.

@Num Ic – Thank you! I appreciate it :)

@Num Ic – Hey Num Ic, could you please give me a coding challenge? It can be on brilliant, or anything really. Thanks!

@Jonathan Eshetu – i have no exp in creating a rpg, but i m glad when i can contribute some help

@Num Ic – Yeah, I realized how it works by myself. Now, I am taking notes from your post. I hope to post a solution for tomorrows problem, if I get it right, of course!!!

@Jonathan Eshetu – $a_{b_{c_{d_{e_{f_{g_{h_{i_{j}}}}}}}}}$

@A Former Brilliant Member – Hahaha, I got that wrong actually. I took the second point literally, when I should be doing 60 x 2 / 3 = 40.

@A Former Brilliant Member – that was a nice problem. ty for showing it.

@Saya Suka – I think the space was up to the encoder or maybe has something to do with ASCII values but not required

In true encryption, alphabets are completely jumbled and the position of the alphabet matters and what lies next to the alphabet matters… u get the point I think, but Broekhuis had to make one which was crackable

The key is what is required to decrypt the sequence, without it becomes too hard to decrypt, in this example my post down below has a key which is the dictionary and the key can be sent with the message, but only knowing how to use the key can decrypt the message

U can do anything in encryption until it is possible to decrypt to a single message back again, if that can’t happen, that’s not an encryption, that’s data loss scheme

@Saya Suka – I used to use ternary for encryption when I was small A-001 B-002 C-010… Z-222 (used to confuse my friends a lot) so hexadecimal isn’t the only thing u can use for encryption but it’s nice to have the decrypted data and encrypted data to have the same size, mine was way too inefficient in that way

@Saya Suka – yeah there are different ways to encrypt something.
the sample was easy bcs he said: here is the text and this is the encryption.
but without the original text or other hints it can be very difficult to decode something.

@Jonathan Eshetu – Hi Jonathan, It sounds great, I just snapped a quick glance and I can say I got a good dose of stimulitions.

Thanks a lot!

@Num Ic – This is very kind of you :))

Yes you are right and nothing strange if I start with "Hello world", i am not just interested in learning some codes and how to enter it, but I tend for Intense understanding and i need understand how these codes and programming fundamentally work

i have read the free introduction of brillant python programming courses and i find it great, now i would like to go more deeper i think i want to read the "Python Crash Course: A Hands-On, Project-Based Introduction to Programming" by Eric Matthes which I found in the link that Jonathan recommend

I don't face problems till now, i am still in the beginning and before diving but i will provide with your pinwheels so i am not afraid of drowning! I really feel grateful for your interest and your encouragement

thank you all

@Num Ic – Oh wow so you found out what Broekhuis did

@Num Ic – It’s possible I know but python always comes up with these shortcuts, I didn’t want to use a loop because I wanted everyone to see the contents of the dictionary easily ( includes me I will be using this or something similar on a cryptogram daily challenge soon )

@Num Ic – Yes one-one mapping is a must or some values will be lost I understand

@Jason Gomez – I think your idea is good. How about rephrasing to "during a specific one hour window of time" and "during any one hour window of time" and "during any consecutive 2 hour window of time"?

@Jason Gomez – Forget about this I calculated the wrong probability

@Jason Gomez – Or you have to mention if u want the average probability for a specific one hour period

@Jason Gomez – Is it?

@Num Ic – Saya's probably done for the day given that she's in Malaysia. You're in Germany right?

@Num Ic – The granularity is one hour

@Num Ic – Granularity sounds like food, but I believe you're talking about the smallest time division that's taken into account. I've only seen the solutions using hour, half or quarter blocks of time, so I guess they use one minute granularity? For the day part, I would guess p(same day) = 1 - (1 - 2/7)(1 - 3/7) = 1 - (5/7)(4/7) = 29/49. I'll go look for the similar ones later.

@A Former Brilliant Member – Hi, Family A b/c they have the shortest window of time. 2 times on average per week or 7 days/ 3 times on average per week or 7 days. Not 35 weeks, the number of combinations if you averaged 3 times per week would result in 35 combinations or ways that 3 days may occur, thus, 3/35 and 2/21. Relativity, the clock on the wall is the measure of time - it's objective - standard. Their watches are synched or they have GPS on their phones. They meet, having watches/phones in hand they agree on the time. They spend an hour of time. If Family A is there at 5PM they are also there on a specific day. P=1. What is the probability that Family B will visit the restaurant given that Family A is there. If Family B were to go there at 7PM, there would be no chance of meeting Family A because Family A leaves at 7PM. One hour of time is reasonable to order food, eat, drink coffee. The longer you stay, the greater the chances you will meet. Your English is hard to understand, seems you put very little thought into the matter. I can hardly take you seriously given your proposal.

@A Former Brilliant Member – regarding the weeks: you are right: if we check 1000 weeks then the chance is 1000 times the chance of one week.
so the question is just about the chance to meet in one week, not in x weeks.

regarding the time: i had the same question.
i learned that the idea is that they can only arrive at 5:00, 6:00 or 7:00,
(they cannot arrive at 5:15)

@A Former Brilliant Member – Probabilities don’t change no matter whose point of view you take, it’s a basic approach always taken in calculating probability(classically speaking)

@A Former Brilliant Member – For the specific one hour period of time, since the granularity is one hour and it’s obvious that A can’t come after 7, he means that the specific one hour period of time is 5-6 or 6-7 , and they both have equal probabilities, so need to consider the average

@Jason Gomez – Posted it because I did want to see if there was any mistake on my part (I waited for a whole day for Saya Suka to post an explanation but she (if the gender is wrong, I am sorry, I am really bad at figuring out gender from names most of the time) didn’t post one, so if this influenced her thinking I am sorry.