<commit_before>Approximations
-----------
Write a program that approximates x to the nearest the 4th decimal place (nearest .0001) if x^3 - 2x^2 + 27x - 52 = 0.  Submit source code below in C/C++, Python, or Java.<commit_msg>Update description.md<commit_after># Wordlists

## Background
A local bank has asked us to do some pen tests for them.  We got a dump of debit card numbers in use by customers, but we couldn't find the PIN codes.  At this bank, debit card PIN codes are assigned and cannot be changed by a user (its not a very good bank).  A guy on the team was able to social engineer some information about what constitutes a valid PIN code.  The victim bragged that they figured out a way to make the number of valid PIN codes exactly 1000.  He thought that having less PIN codes for attackers to guess was a good thing.  We want to generate a wordlist of all possible PIN codes for this bank’s debit cards.

## Known PIN Code Requirements
- PIN codes are 4 digits ranging from 0000 to 9999
- For security reasons they do not allow any 4 digit codes that match years between (inclusive) 1900 and 2020
- The first digit cannot be a 3, 5, or 7
- The last digit is a sort of parity check; it must be the sum of the first 3 digits modulus 3

## Submission Instructions
Submit the generated wordlist along with any source code or list of tools used to generate the wordlist.
{'fraction_non_alphanumeric': 0.0463768115942029, 'fraction_numerical': 0.028985507246376812, 'mean_word_length': 3.7133105802047783, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4654759', 'n_tokens_mistral': 401, 'n_tokens_neox': 341, 'n_words': 243}