Given a series of plaintext blocks represented as an int array (see the apcsaEncryptStringToBlocks problem in this sequence), a public key int and a modulus, encrypt the blocks into a new int array of encrypted information.

This problem is based on, and helps to construct, the simplified public key encryption algorithm found at https://en.wikibooks.org/wiki/Cryptography/A_Basic_Public_Key_Example

Something you will discover with this problem is that, even with relatively small parameter values, the calculations will exceed the limits of primitive data types. Java has a very useful class called BigInteger in the math package (must be referenced as java.math.BigInteger because CodingBat does not allow import statements), which even has a wonderful method designed explicitly for this sort of problem. So, this challenge is suddenly more about managing the BigInteger objects than it is about the math.

https://docs.oracle.com/javase/8/docs/api/java/math/BigInteger.html

HINT

Seriously, go look at the BigInteger documentation if you are stuck.

Primes and public keys used, if you are interested (these will also be used in the decryption algorithm in a future problem):

12973,15913 --> 200344741
29989,43691 --> 150774251