𝗧𝘄𝗶𝗻 𝗣𝗿𝗶𝗺𝗲𝘀 𝗮𝗻𝗱 𝗗𝗶𝘃𝗶𝘀𝗶𝗯𝗹𝗲 𝗯𝘆 𝟭𝟭

𝗧𝘄𝗶𝗻 𝗣𝗿𝗶𝗺𝗲𝘀 𝗮𝗻𝗱 𝗗𝗶𝘃𝗶𝘀𝗶𝗯𝗹𝗲 𝗯𝘆 𝟭𝟭

I practiced using functions today. Learn the logic behind these two coding tasks.

Task 1: Twin Primes

• Check if a number is prime.
• Add 2 to the number.
• Check if the result is also prime.

Task 2: Divisible by 11

• Sum the alternating digits.
• Subtract the two sums.
• The result must be 0 or divisible by 11.

I learned modulo and float logic. I used trial and error to fix my syntax. I will keep learning.

Source: https://dev.to/buddingdeveloper/twin-primes-and-divisible-by-11-5hjg