### Propositional logic with itertools

Nov 18, 2022AustinLeath

## More Python Posts

`# Deleting all even numbers from a lista = [1,2,3,4,5]del a[1::2]print(a)`

#### check prop lambda

Nov 19, 2022CodeCatch

0 likes • 0 views

`def check_prop(fn, prop):  return lambda obj: fn(obj[prop])  check_age = check_prop(lambda x: x >= 18, 'age')user = {'name': 'Mark', 'age': 18}check_age(user) # True`

#### Dictionary Sort

Nov 18, 2022AustinLeath

0 likes • 4 views

```mydict = {'carl':40, 'alan':2, 'bob':1, 'danny':0}
# How to sort a dict by value Python 3>sort = {key:value for key, value in sorted(mydict.items(), key=lambda kv: (kv[1], kv[0]))}print(sort)
# How to sort a dict by key Python 3>sort = {key:mydict[key] for key in sorted(mydict.keys())}print(sort)```

#### Print "X" pattern

Nov 19, 2022CodeCatch

0 likes • 0 views

```def print_x_pattern(size):    i,j = 0,size - 1
while j >= 0 and i < size:
initial_spaces = ' '*min(i,j)        middle_spaces = ' '*(abs(i - j) - 1)        final_spaces = ' '*(size - 1 - max(i,j))
if j == i:            print(initial_spaces + '*' + final_spaces)        else:            print(initial_spaces + '*' + middle_spaces + '*' + final_spaces)
i += 1        j -= 1
print_x_pattern(7)```

#### primes numbers finder

Mar 12, 2021mo_ak

0 likes • 1 view

```prime_lists=[] # a list to store the prime numbers
def prime(n): # define prime numbers    if n <= 1:        return False    # divide n by 2... up to n-1    for i in range(2, n):        if n % i == 0:  # the remainder should'nt be a 0            return False    else:        prime_lists.append(n)        return True

for n in range(30,1000):  # calling function and passing starting point =30 coz we need primes >30    prime(n)
check=0 # a var to limit the output  to 10 onlyfor n in prime_lists:    for x in prime_lists:        val=  n *x        if (val > 1000 ):            check=check +1        if (check <10) :            print("the num is:", val , "=",n , "* ", x )        break```
```def generate_pascals_triangle(num_rows):    triangle = []    for row in range(num_rows):        # Initialize the row with 1        current_row = [1]
# Calculate the values for the current row        if row > 0:            previous_row = triangle[row - 1]            for i in range(len(previous_row) - 1):                current_row.append(previous_row[i] + previous_row[i + 1])
# Append 1 at the end of the row        current_row.append(1)
# Add the current row to the triangle        triangle.append(current_row)
return triangle

def display_pascals_triangle(triangle):    for row in triangle:        for number in row:            print(number, end=" ")        print()

# Prompt the user for the number of rowsnum_rows = int(input("Enter the number of rows for Pascal's Triangle: "))
# Generate Pascal's Trianglepascals_triangle = generate_pascals_triangle(num_rows)
# Display Pascal's Triangledisplay_pascals_triangle(pascals_triangle)```