Python regular expression count challenge seemingly incorrectly recognizes an incomplete answer to me as being correct?

In the Python RegEx course, a challenge that wants challenge takers to create a function that takes an integer and return words that are as long or longer as the passed in integer seems to accept an incomplete answer:

Ideally--assuming the parameters are n, and s-- the RegEx would be the following

r'\w{n, }'

However, the challenge takers are not yet taught (frankly I don't even know it's possible) how to pass in a variable value inside a regular expression; the format() method (and its shortcut) of course is invalid.

Instead I attempted a faux answer that doesn't meet the requirements of the function asked.

I used rs = "\w * n" andr'+'(the latter of course changes the entire string to a raw string) withinre.findall` and the challenge marked it as correct.

This is seemingly an error unless I'm mistaken to believe an implicit group was made by regular expression; I continuously attempt to frame it as expressing "find a string with n amount of characters one or more times instead of having at least n characters.

I may perhaps be more rusty with Regular Expressions more than I thought (or picked a horrible evening to understand them within Python, hehe).

Perhaps, Kenneth Love can provide an explanation?

import re

# EXAMPLE:
# >>> find_words(4, "dog, cat, baby, balloon, me")
# ['baby', 'balloon']

def find_words(n, s):
  rs = "\w" * n
  return re.findall(rs+r'+', s)

import re

def find_words(n, s):
  rs = "\w" * n
  return re.findall(rs+r'+', s)