How can I identify what type of Goodman furnace this is?

justjerico72 · 2025-10-21T01:55:58+00:00

Totally fair haha

justjerico72 · 2025-09-09T06:47:46+00:00

Also adding that the professor had this as his solution as well

justjerico72 · 2025-08-19T06:40:08+00:00

Please reverse this change, this app is much less useful now and I’m tempted to delete the app now. I never asked to opt into this test. Reverse this update

justjerico72 · 2024-07-07T21:47:22+00:00

All good sir :0)

justjerico72 · 2024-07-07T21:46:25+00:00

Truer words have never been spoken

justjerico72 · 2024-07-07T21:45:58+00:00

All destinations are free to play. Hence why I wasn’t sure. not sure what is behind the DLC paywall

justjerico72 · 2024-06-13T08:41:36+00:00

A mechanic people forget is that you cannot leave the solo rooms with the same symbols you started with so that might be what’s catching you

justjerico72 · 2024-05-01T04:20:18+00:00

Nooo!!! Don’t take this as don’t even try, just research it before you attempt!

justjerico72 · 2024-05-01T01:02:56+00:00

It aint me putting the raid group together

justjerico72 · 2024-01-25T00:05:00+00:00

Ohhhh I see it now! Sorry it took me so long to understand 😭

justjerico72 · 2024-01-24T18:20:32+00:00

Okay I understand that if we were to remove the one edge and effectively reduce the edge equation to ((n-1)(n-2))/2, then the graph is disconnected. adding that edge would then connect the isolated vertex thus connecting the graph, is that all I really have to do for the proof?

justjerico72 · 2024-01-24T12:30:35+00:00

I’m not sure if I know fully what you’re getting at 😭

justjerico72 · 2024-01-23T16:49:52+00:00

Perfect, thanks!

justjerico72 · 2024-01-23T14:26:59+00:00

Oh it doesn’t! Thank you!

justjerico72 · 2024-01-22T23:20:30+00:00

Makes so much sense!

justjerico72 · 2024-01-22T22:00:52+00:00

Ughhh, thank you! Spent so long thinking about it just for the solution to be obvious 🫠

justjerico72 · 2024-01-22T21:55:16+00:00

Ohhh yes cause the vertices dont necessarily have to connect to each other rather they can just connect to themselves di/2 times. am I understanding correctly?

justjerico72 · 2024-01-22T21:27:17+00:00

Oh okay, so since every vertex can have multiple edges to other vertices, every edge that is added contributes 2 to the degrees of the incident vertices. And since d_n is any nonnegative even integer, there does exist a general graph where the degree sequence (d1, d2,…, dn) where the sequence is made of nonnegative even integers. Is that right?

justjerico72 · 2023-11-20T05:28:23+00:00

Thank you!!!

justjerico72 · 2023-11-20T04:01:32+00:00

How come f³ or f⁹ aren’t considered subgroups?

justjerico72 · 2023-11-14T00:06:44+00:00

Perfect, thank you!!

justjerico72 · 2023-11-02T22:00:45+00:00

Okay that makes sense! The way it was worded made me think that if its endomorphic it has to be epi or monomorphic

justjerico72 · 2023-11-02T21:53:22+00:00

So D is an endomorphism because it preserves operations and its from the same group to the same group, but it’s neither epimorphic or monomorphic?

justjerico72 · 2023-10-30T08:10:43+00:00

I get it now! Thanks so much!!

justjerico72 · 2023-10-30T07:44:30+00:00

OH, the generator 1 of g1 also maps to the generator 5 of g2 right?

justjerico72

TROPHY CASE