Okay, so I know that this whole lesson is very buggy but I did decide to continue and research any new terms I did not understand and also try to understand why the code ran the way it did and why it was done the way it was done BUT I do want to make sure that I have the following lines understood:

Just to clarify, prime.next and Prime.new are both OBSOLETE and no longer used in Ruby, which is why the lesson is being so buggy.

Right?

The next thing is trying to make sure I completely understand what is going on with

require ‘prime’

and

Prime.first(n)

require ‘prime’:

This is receiving a module called Prime and giving us access its algorithm, which only picks prime numbers. We are able to call this module as many times as we want since ‘require’ receives an object and makes it so it doesn’t have to keep doing it.

Can ‘require’ be simplified down to this?: once in, always in until the program stops running.

Prime.first(n):

In combo with ‘Prime’, the method ‘.first()’ just displays the first (n) elements of the ‘Prime’ array.

So overall, these are what I’m trying to get clarified.

I’m just trying to make the best of a messy situation so I hope I, somewhat, got it down lol