"ICT_SOURCES" — @ict_sources_viper Telegram-kanali

ICT_SOURCES

26 Sep, 11:29

import matplotlib.pyplot as plt
import numpy as np

# Data
x = np.arange(0, 10, 0.1)
y1 = 3 x
y2 = 2 x

# Plotting the graph
plt.figure(figsize=(10, 6))
plt.plot(x, y1, label='3^x', color='b')
plt.plot(x, y2, label='2^x', color='r')

# Adding title and labels
plt.title('Exponential Growth of Powers of 3 and 2')
plt.xlabel('x')
plt.ylabel('y')
plt.yscale('log') # Setting logarithmic scale for y-axis
plt.legend()

# Displaying the graph
plt.grid(True)
plt.show()

1.2k 1 33

ICT_SOURCES

23 Sep, 00:30

// Function to check if a number is a power of 2 or 3
isPowerOf2Or3(inputNumber) =>
isPowerOf2 = false
isPowerOf3 = false
powerOf2 = 0
powerOf3 = 0
decimalPowerOf2 = 0.0
decimalPowerOf3 = 0.0

// Check if the number is a power of 2
if (math.log(inputNumber) / math.log(2)) % 1 == 0
isPowerOf2 := true
powerOf2 := int(math.log(inputNumber) / math.log(2))
decimalPowerOf2 := math.pow(2, powerOf2)

// Check if the number is a power of 3
if (math.log(inputNumber) / math.log(3)) % 1 == 0
isPowerOf3 := true
powerOf3 := int(math.log(inputNumber) / math.log(3))
decimalPowerOf3 := math.pow(3, powerOf3)

[isPowerOf2, isPowerOf3, powerOf2, powerOf3, decimalPowerOf2, decimalPowerOf3]

1.7k 1 60

ICT_SOURCES

23 Sep, 00:29

// Function to check if a number is divisible by 2 or 3
isDivisibleBy2Or3(inputNumber) =>
isDivisibleBy2 = false
isDivisibleBy3 = false

// Check if the number is divisible by 2
if (inputNumber % 2 == 0 and barstate.islast)
isDivisibleBy2 := true

// Check if the number is divisible by 3
if (inputNumber % 3 == 0 and barstate.islast)
isDivisibleBy3 := true

[isDivisibleBy2, isDivisibleBy3]

1.3k 1 58

ICT_SOURCES

23 Sep, 00:29

// Function to check if a number is odd or even
isOddOrEven(inputNumber) =>
isOdd = false
isEven = false

// Check if the number is odd
if (inputNumber % 2 != 0 and barstate.islast)
isOdd := true
else
isEven := true

[isOdd, isEven]

1.3k 1 57

ICT_SOURCES

23 Sep, 00:28

// Function to check if a number is a prime number
isPrimeNumber(inputNumber) =>
isPrime = false

// Check if the number is an integer
if inputNumber % 1 == 0
// Check if the number is prime
if (inputNumber > 1 and barstate.islast)
isPrime := true
for i = 2 to int(math.sqrt(inputNumber))
if inputNumber % i == 0
isPrime := false
break

[isPrime]

1.3k 1 56