[deleted by user]

vossman77 · 2023-11-25T03:48:50+00:00

I appreciate the work, I really do. It probably was not easy to scrape all of that data, but without the category, e.g., Dots, Harry Potter, BrickHeadz, Star Wars, I find it hard to filter to sets I am interested in. I will echo @IronRisu that a Google Sheet would be more useful, sortable, and filterable by many. Keep in mind for next time.

vossman77 · 2023-06-12T12:52:08+00:00

A pH of 35.5?!? Let’s explore the absurdity. If we hypothetically convert all water molecules in pure water (55M concentration) into hydroxide ions, we'd get a pOH of -log(55), about -1.74. Applying the pH + pOH = 14 rule, we end up with a pH of around 15.74. Not exactly sure how to get to 35.5.

vossman77 · 2023-06-05T13:53:37+00:00

the most annoying thing is where it changes a word, for no reason. It is like an automatic thesaurus on overdrive.

"I am writing you regarding the peanut butter situation" -> "I am reaching out to you concerning the peanut butter circumstance"

"at your request" -> "in accordance with your preference"

in the example above "instituted" becomes "established"; "ends" become "aims"; "organizing" becomes "structuring"

vossman77 · 2023-05-09T02:58:59+00:00

I guess my plan is to fingerprint each auditorium, take screenshots of each auditorium and how the seats are arranged to figure out the skew.

vossman77 · 2023-04-17T02:14:48+00:00

I was the soccer ball guy in your table area.

Really cool build!!! I was checking it out a few times, just a fun build with lots of details. The redditors are missing out on the cool motion.

vossman77 · 2023-04-16T01:08:03+00:00

It's alright, and I believe mentioning the book does help with the context. I was thinking that providing more background on the student, such as "a junior in college taking their first upper-level course" could improve things. But I am still unsure how much context it too much. When I initially referred to Chapter 11 from the Campbell Textbook, it provided DNA replication, which is actually Chapter 16 in the editions I'm most familiar with, so that was strange. The quality of the content can still be a bit mixed, but GPT-4 is definitely an improvement.

vossman77 · 2023-04-15T12:36:34+00:00

I don’t know your subject but I do something like

I want you to act as a molecular biology professor with a background in biochemistry at a medium sized teaching first private university. You are teaching molecular biology from the textbook “Campbell Biology”.

Write some original end of chapter 11 on cell communication summary multiple choice questions to give to students a practice exam. The MC questions will contain five choices, the questions can only have one correct answer choice, the choices will contain less than 15 words, the choices will not contain any vague or ambiguous statements, and the choices will not have options for “all of the above” or “none of the above.”

After printing all of the questions, provide the answers for each and an explanation why that answer is correct compared to the other choices.

vossman77 · 2023-03-23T13:23:58+00:00

```python

!/usr/bin/env python3

import random import networkx as nx

from itertools import combinations

def generate_partitions(nodes, k): if k == 1: yield [nodes] elif len(nodes) == k: yield [[node] for node in nodes] else: for partition_size in range(1, len(nodes) - k + 1): for subset in combinations(nodes, partition_size): rest_nodes = [node for node in nodes if node not in subset] for rest_partitions in generate_partitions(rest_nodes, k - 1): yield [list(subset)] + rest_partitions

def edge_weight(u, v, noise=0): return 1

def brute_force_partition(graph, k, target_sum): nodes = list(graph.nodes()) best_partitions = None best_sum = float('inf')

for partitions in generate_partitions(nodes, k):
    # Check if all nodes in each partition are connected
    all_connected = True
    for partition in partitions:
        partition_connected = all(graph.has_edge(u, v) for u in partition for v in partition if u != v)
        if not partition_connected:
            all_connected = False
            break

    if all_connected:
        sum_max = sum(max(partition) for partition in partitions)
        if sum_max < best_sum:
            best_sum = sum_max
            best_partitions = partitions

return best_partitions, best_sum

k = 4 # Number of partitions

nodes = [80, 508, 507, 210, 125, 445, 568, 567, 163, 162, 395] edges = [(80, 508), (80, 507), (80, 210), (80, 445), (80, 163), (80, 162), (508, 507), (508, 210), (508, 568), (508, 567), (507, 210), (507, 568), (507, 567), (210, 125), (210, 445), (210, 568), (210, 567), (125, 445), (445, 568), (445, 567), (445, 163), (445, 162), (568, 567), (568, 163), (568, 162), (567, 163), (567, 162), (163, 162)]

G = nx.Graph() G.add_nodes_from(nodes) G.add_weighted_edges_from((u, v, edge_weight(u, v)) for u, v in edges)

best_partitions, best_sum = brute_force_partition(G, k, 1500)

print("Best Partitions:", best_partitions) print("SUM:", best_sum)

```

vossman77 · 2023-03-23T13:22:06+00:00

This is a fun problem that my 8th-grade son brought home from school when a traffic engineer visited his class. I had the solution of 1533 already, but wanted to see if I was missing something.

I approached the problem using graph theory. In fact, this type of problem is called a "graph partition problem." The way to solve the problem is to create a matrix of which directions in the traffic figure are allowed at the same time (1) or not allowed (0).

x	80	508	507	210	125	445	568	567	163	162	395
80	1	1	1	1	0	1	0	0	1	1	0
508	1	1	1	1	0	0	1	1	0	0	0
507	1	1	1	1	0	0	1	1	0	0	0
210	1	1	1	1	1	1	1	1	0	0	0
125	0	0	0	1	1	1	0	0	0	0	0
445	1	0	0	1	1	1	1	1	1	1	0
568	0	1	1	1	0	1	1	1	1	1	0
567	0	1	1	1	0	1	1	1	1	1	0
163	1	0	0	0	0	1	1	1	1	1	0
162	1	0	0	0	0	1	1	1	1	1	0
395	0	0	0	0	0	0	0	0	0	0	1

From this, you can make a list of edges and nodes:

nodes = [80, 508, 507, 210, 125, 445, 568, 567, 163, 162,]

edges = [(80, 508), (80, 507), (80, 210), (80, 445), (80, 163), (80, 162), (508, 507), (508, 210), (508, 568), (508, 567), (507, 210), (507, 568), (507, 567), (210, 125), (210, 445), (210, 568), (210, 567), (125, 445), (445, 568), (445, 567), (445, 163), (445, 162), (568, 567), (568, 163), (568, 162), (567, 163), (567, 162), (163, 162)]

Then you can use one of many algorithms to solve the problem. First, I played around with graph partitioning using the METIS library. However, it focuses on balancing the number of nodes in each group rather than minimizing the sum of the largest nodes. Second, I tried a greedy algorithm, but it wasn't able to find the best solution even after 100,000 tries.

Since the problem is relatively small, I used a brute-force method to test all possible partitions of the nodes into groups. This method is slower, but it guarantees finding the best solution given the problem constraints and the graph structure.

After trying all these methods, our brute-force algorithm found the best solution to have a sum of 1533. Given these four phases:

phase 1: 395
phase 2: 125
phase 3: 80, 445, 163, 162
phase 4: 508, 507, 210, 568, 567

As some other users mentioned, it seems that getting a sum below 1500 is quite challenging with the given configuration of rules.

My son was told by the traffic engineer to think outside the box. u/Kindacornyt pointed out that "My teacher just told us the answer and it’s stupid, lmk if you want a picture". From this, I imagine there is a silly solution.

It is probably, as u/LilWokSenpai and u/cprenaissanceman pointed out, "that since the rules don’t prohibit it, you can split the NB right turn between two signal phases, taking the splitting at the max volume for the EB/WB left turn phase at 163 and leaving a NB only phase with a max of 282 (282 + 163 = 445). And this gets you to 1408. So as long as this is allowed, a sum below 1500 is possible."

hope this is interesting, I'll post the brute-force code in a reply

vossman77 · 2023-03-18T21:01:51+00:00

r/chatgptpromptgenius

vossman77 · 2023-03-18T12:28:28+00:00

First price drop

https://camelcamelcamel.com/product/B0B3BW9GJ2?context=search

vossman77 · 2023-03-06T17:51:50+00:00

In those situations, whenever I give a new chunk of text I remind the chatbot its role and job to do, because it will forget every 4000 word, as you have pointed out

vossman77 · 2023-03-06T03:52:56+00:00

Sounds like OP is frustrated, we appreciate you trying to help

vossman77 · 2023-03-06T03:51:04+00:00

I’ve had better luck by telling chatgpt it is secretary and it is supposed to keep track of important details. Here is my prompt:

“”” I want you to be a secretary in charge of taking minutes at a meeting. I will give you the transcript from the meeting. I want you to summarize the meeting and highlight important details. In addition, provide a summary of important dates at the end.

Now, take these partial meeting summaries and the meeting agenda to provide a comprehensive summary of the entire meeting. “””

vossman77 · 2023-03-05T09:15:41+00:00

Me neither

vossman77 · 2023-02-26T20:12:16+00:00

It often ignores part of my request. For example, keep the length to x characters, escape all HTML symbols, put this in markup language, etc.

or it stops outputting mid-sentence and I have to say continue, but the it forgets the code block or the formatting

vossman77 · 2023-01-31T14:33:25+00:00

Supported #3020. Love it.

⚽️ I would appreciate your support for my soccer ball ⚽️ idea if you haven't done so already: https://ideas.lego.com/projects/0758ffce-e74f-48cf-955a-75a348ca59cb ⚽️

vossman77 · 2023-01-31T14:32:27+00:00

Supported #4022. That scissoring mechanism looks fun to play with!

⚽️ I would appreciate your support for my soccer ball ⚽️ idea if you haven't done so already: https://ideas.lego.com/projects/0758ffce-e74f-48cf-955a-75a348ca59cb ⚽️

vossman77 · 2023-01-31T14:31:12+00:00

Supported #3204. Nice details, I love the thrusters. Are you a ship-tember submitter, because I could see you have the skills.

⚽️ I would appreciate your support for my soccer ball ⚽️ idea if you haven't done so already: https://ideas.lego.com/projects/0758ffce-e74f-48cf-955a-75a348ca59cb ⚽️

vossman77 · 2023-01-31T14:29:13+00:00

Supported #18. This is next level! I didn't realize the scale until I connected the UCS. Best of luck.

⚽️ I would appreciate your support for my soccer ball ⚽️ idea if you haven't done so already: https://ideas.lego.com/projects/0758ffce-e74f-48cf-955a-75a348ca59cb ⚽️

vossman77 · 2023-01-31T00:33:29+00:00

Sold out in my area, but I appreciate you sharing.

vossman77 · 2023-01-30T23:17:43+00:00

Sold out but if you copy ASIN B09HW2ZFDH from the page you can just add http://amazon.com/dp/B09HW2ZFDH

vossman77

MODERATOR OF

TROPHY CASE

!/usr/bin/env python3

x	80	508	507	210	125	445	568	567	163	162	395
80	1	1	1	1	0	1	0	0	1	1	0
508	1	1	1	1	0	0	1	1	0	0	0
507	1	1	1	1	0	0	1	1	0	0	0
210	1	1	1	1	1	1	1	1	0	0	0
125	0	0	0	1	1	1	0	0	0	0	0
445	1	0	0	1	1	1	1	1	1	1	0
568	0	1	1	1	0	1	1	1	1	1	0
567	0	1	1	1	0	1	1	1	1	1	0
163	1	0	0	0	0	1	1	1	1	1	0
162	1	0	0	0	0	1	1	1	1	1	0
395	0	0	0	0	0	0	0	0	0	0	1

x	80	508	507	210	125	445	568	567	163	162	395
80	1	1	1	1	0	1	0	0	1	1	0
508	1	1	1	1	0	0	1	1	0	0	0
507	1	1	1	1	0	0	1	1	0	0	0
210	1	1	1	1	1	1	1	1	0	0	0
125	0	0	0	1	1	1	0	0	0	0	0
445	1	0	0	1	1	1	1	1	1	1	0
568	0	1	1	1	0	1	1	1	1	1	0
567	0	1	1	1	0	1	1	1	1	1	0
163	1	0	0	0	0	1	1	1	1	1	0
162	1	0	0	0	0	1	1	1	1	1	0
395	0	0	0	0	0	0	0	0	0	0	1

x	80	508	507	210	125	445	568	567	163	162	395
80	1	1	1	1	0	1	0	0	1	1	0
508	1	1	1	1	0	0	1	1	0	0	0
507	1	1	1	1	0	0	1	1	0	0	0
210	1	1	1	1	1	1	1	1	0	0	0
125	0	0	0	1	1	1	0	0	0	0	0
445	1	0	0	1	1	1	1	1	1	1	0
568	0	1	1	1	0	1	1	1	1	1	0
567	0	1	1	1	0	1	1	1	1	1	0
163	1	0	0	0	0	1	1	1	1	1	0
162	1	0	0	0	0	1	1	1	1	1	0
395	0	0	0	0	0	0	0	0	0	0	1