diff --git a/Task_2_1_1/.gitignore b/Task_2_1_1/.gitignore
new file mode 100644
index 00000000..1ddeda80
--- /dev/null
+++ b/Task_2_1_1/.gitignore
@@ -0,0 +1,44 @@
+.gradle
+build/
+!gradle/wrapper/gradle-wrapper.jar
+!**/src/main/**/build/
+!**/src/test/**/build/
+
+### IntelliJ IDEA ###
+.idea/modules.xml
+.idea/jarRepositories.xml
+.idea/compiler.xml
+.idea/libraries/
+*.iws
+*.iml
+*.ipr
+out/
+!**/src/main/**/out/
+!**/src/test/**/out/
+
+### Eclipse ###
+.apt_generated
+.classpath
+.factorypath
+.project
+.settings
+.springBeans
+.sts4-cache
+bin/
+!**/src/main/**/bin/
+!**/src/test/**/bin/
+
+### NetBeans ###
+/nbproject/private/
+/nbbuild/
+/dist/
+/nbdist/
+/.nb-gradle/
+
+### VS Code ###
+.vscode/
+
+### Mac OS ###
+.DS_Store
+# Ignore Gradle build output directory
+build
diff --git a/Task_2_1_1/build.gradle b/Task_2_1_1/build.gradle
new file mode 100644
index 00000000..3e64d75b
--- /dev/null
+++ b/Task_2_1_1/build.gradle
@@ -0,0 +1,31 @@
+plugins {
+    id 'idea'
+    id 'java'
+    id 'jacoco'
+}
+
+group = 'org.example'
+version = '1.0-SNAPSHOT'
+
+repositories {
+    mavenCentral()
+}
+
+dependencies {
+    testImplementation platform('org.junit:junit-bom:5.10.0')
+    testImplementation 'org.junit.jupiter:junit-jupiter'
+    testImplementation 'org.junit.jupiter:junit-jupiter-engine'
+
+
+}
+
+test {
+    useJUnitPlatform()
+
+}
+
+jacocoTestReport {
+    reports {
+        xml.required = true
+    }
+}
\ No newline at end of file
diff --git a/Task_2_1_1/diagram.png b/Task_2_1_1/diagram.png
new file mode 100644
index 00000000..71446712
Binary files /dev/null and b/Task_2_1_1/diagram.png differ
diff --git a/Task_2_1_1/gradle/libs.versions.toml b/Task_2_1_1/gradle/libs.versions.toml
new file mode 100644
index 00000000..f5172b8e
--- /dev/null
+++ b/Task_2_1_1/gradle/libs.versions.toml
@@ -0,0 +1,10 @@
+# This file was generated by the Gradle 'init' task.
+# https://docs.gradle.org/current/userguide/platforms.html#sub::toml-dependencies-format
+
+[versions]
+guava = "33.4.5-jre"
+junit-jupiter = "5.12.1"
+
+[libraries]
+guava = { module = "com.google.guava:guava", version.ref = "guava" }
+junit-jupiter = { module = "org.junit.jupiter:junit-jupiter", version.ref = "junit-jupiter" }
diff --git a/Task_2_1_1/gradle/wrapper/gradle-wrapper.jar b/Task_2_1_1/gradle/wrapper/gradle-wrapper.jar
new file mode 100644
index 00000000..1b33c55b
Binary files /dev/null and b/Task_2_1_1/gradle/wrapper/gradle-wrapper.jar differ
diff --git a/Task_2_1_1/gradle/wrapper/gradle-wrapper.properties b/Task_2_1_1/gradle/wrapper/gradle-wrapper.properties
new file mode 100644
index 00000000..d4081da4
--- /dev/null
+++ b/Task_2_1_1/gradle/wrapper/gradle-wrapper.properties
@@ -0,0 +1,7 @@
+distributionBase=GRADLE_USER_HOME
+distributionPath=wrapper/dists
+distributionUrl=https\://services.gradle.org/distributions/gradle-8.14.3-bin.zip
+networkTimeout=10000
+validateDistributionUrl=true
+zipStoreBase=GRADLE_USER_HOME
+zipStorePath=wrapper/dists
diff --git a/Task_2_1_1/gradlew b/Task_2_1_1/gradlew
new file mode 100644
index 00000000..23d15a93
--- /dev/null
+++ b/Task_2_1_1/gradlew
@@ -0,0 +1,251 @@
+#!/bin/sh
+
+#
+# Copyright © 2015-2021 the original authors.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#      https://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+# SPDX-License-Identifier: Apache-2.0
+#
+
+##############################################################################
+#
+#   Gradle start up script for POSIX generated by Gradle.
+#
+#   Important for running:
+#
+#   (1) You need a POSIX-compliant shell to run this script. If your /bin/sh is
+#       noncompliant, but you have some other compliant shell such as ksh or
+#       bash, then to run this script, type that shell name before the whole
+#       command line, like:
+#
+#           ksh Gradle
+#
+#       Busybox and similar reduced shells will NOT work, because this script
+#       requires all of these POSIX shell features:
+#         * functions;
+#         * expansions «$var», «${var}», «${var:-default}», «${var+SET}»,
+#           «${var#prefix}», «${var%suffix}», and «$( cmd )»;
+#         * compound commands having a testable exit status, especially «case»;
+#         * various built-in commands including «command», «set», and «ulimit».
+#
+#   Important for patching:
+#
+#   (2) This script targets any POSIX shell, so it avoids extensions provided
+#       by Bash, Ksh, etc; in particular arrays are avoided.
+#
+#       The "traditional" practice of packing multiple parameters into a
+#       space-separated string is a well documented source of bugs and security
+#       problems, so this is (mostly) avoided, by progressively accumulating
+#       options in "$@", and eventually passing that to Java.
+#
+#       Where the inherited environment variables (DEFAULT_JVM_OPTS, JAVA_OPTS,
+#       and GRADLE_OPTS) rely on word-splitting, this is performed explicitly;
+#       see the in-line comments for details.
+#
+#       There are tweaks for specific operating systems such as AIX, CygWin,
+#       Darwin, MinGW, and NonStop.
+#
+#   (3) This script is generated from the Groovy template
+#       https://github.com/gradle/gradle/blob/HEAD/platforms/jvm/plugins-application/src/main/resources/org/gradle/api/internal/plugins/unixStartScript.txt
+#       within the Gradle project.
+#
+#       You can find Gradle at https://github.com/gradle/gradle/.
+#
+##############################################################################
+
+# Attempt to set APP_HOME
+
+# Resolve links: $0 may be a link
+app_path=$0
+
+# Need this for daisy-chained symlinks.
+while
+    APP_HOME=${app_path%"${app_path##*/}"}  # leaves a trailing /; empty if no leading path
+    [ -h "$app_path" ]
+do
+    ls=$( ls -ld "$app_path" )
+    link=${ls#*' -> '}
+    case $link in             #(
+      /*)   app_path=$link ;; #(
+      *)    app_path=$APP_HOME$link ;;
+    esac
+done
+
+# This is normally unused
+# shellcheck disable=SC2034
+APP_BASE_NAME=${0##*/}
+# Discard cd standard output in case $CDPATH is set (https://github.com/gradle/gradle/issues/25036)
+APP_HOME=$( cd -P "${APP_HOME:-./}" > /dev/null && printf '%s\n' "$PWD" ) || exit
+
+# Use the maximum available, or set MAX_FD != -1 to use that value.
+MAX_FD=maximum
+
+warn () {
+    echo "$*"
+} >&2
+
+die () {
+    echo
+    echo "$*"
+    echo
+    exit 1
+} >&2
+
+# OS specific support (must be 'true' or 'false').
+cygwin=false
+msys=false
+darwin=false
+nonstop=false
+case "$( uname )" in                #(
+  CYGWIN* )         cygwin=true  ;; #(
+  Darwin* )         darwin=true  ;; #(
+  MSYS* | MINGW* )  msys=true    ;; #(
+  NONSTOP* )        nonstop=true ;;
+esac
+
+CLASSPATH="\\\"\\\""
+
+
+# Determine the Java command to use to start the JVM.
+if [ -n "$JAVA_HOME" ] ; then
+    if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
+        # IBM's JDK on AIX uses strange locations for the executables
+        JAVACMD=$JAVA_HOME/jre/sh/java
+    else
+        JAVACMD=$JAVA_HOME/bin/java
+    fi
+    if [ ! -x "$JAVACMD" ] ; then
+        die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME
+
+Please set the JAVA_HOME variable in your environment to match the
+location of your Java installation."
+    fi
+else
+    JAVACMD=java
+    if ! command -v java >/dev/null 2>&1
+    then
+        die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
+
+Please set the JAVA_HOME variable in your environment to match the
+location of your Java installation."
+    fi
+fi
+
+# Increase the maximum file descriptors if we can.
+if ! "$cygwin" && ! "$darwin" && ! "$nonstop" ; then
+    case $MAX_FD in #(
+      max*)
+        # In POSIX sh, ulimit -H is undefined. That's why the result is checked to see if it worked.
+        # shellcheck disable=SC2039,SC3045
+        MAX_FD=$( ulimit -H -n ) ||
+            warn "Could not query maximum file descriptor limit"
+    esac
+    case $MAX_FD in  #(
+      '' | soft) :;; #(
+      *)
+        # In POSIX sh, ulimit -n is undefined. That's why the result is checked to see if it worked.
+        # shellcheck disable=SC2039,SC3045
+        ulimit -n "$MAX_FD" ||
+            warn "Could not set maximum file descriptor limit to $MAX_FD"
+    esac
+fi
+
+# Collect all arguments for the java command, stacking in reverse order:
+#   * args from the command line
+#   * the main class name
+#   * -classpath
+#   * -D...appname settings
+#   * --module-path (only if needed)
+#   * DEFAULT_JVM_OPTS, JAVA_OPTS, and GRADLE_OPTS environment variables.
+
+# For Cygwin or MSYS, switch paths to Windows format before running java
+if "$cygwin" || "$msys" ; then
+    APP_HOME=$( cygpath --path --mixed "$APP_HOME" )
+    CLASSPATH=$( cygpath --path --mixed "$CLASSPATH" )
+
+    JAVACMD=$( cygpath --unix "$JAVACMD" )
+
+    # Now convert the arguments - kludge to limit ourselves to /bin/sh
+    for arg do
+        if
+            case $arg in                                #(
+              -*)   false ;;                            # don't mess with options #(
+              /?*)  t=${arg#/} t=/${t%%/*}              # looks like a POSIX filepath
+                    [ -e "$t" ] ;;                      #(
+              *)    false ;;
+            esac
+        then
+            arg=$( cygpath --path --ignore --mixed "$arg" )
+        fi
+        # Roll the args list around exactly as many times as the number of
+        # args, so each arg winds up back in the position where it started, but
+        # possibly modified.
+        #
+        # NB: a `for` loop captures its iteration list before it begins, so
+        # changing the positional parameters here affects neither the number of
+        # iterations, nor the values presented in `arg`.
+        shift                   # remove old arg
+        set -- "$@" "$arg"      # push replacement arg
+    done
+fi
+
+
+# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
+DEFAULT_JVM_OPTS='"-Xmx64m" "-Xms64m"'
+
+# Collect all arguments for the java command:
+#   * DEFAULT_JVM_OPTS, JAVA_OPTS, and optsEnvironmentVar are not allowed to contain shell fragments,
+#     and any embedded shellness will be escaped.
+#   * For example: A user cannot expect ${Hostname} to be expanded, as it is an environment variable and will be
+#     treated as '${Hostname}' itself on the command line.
+
+set -- \
+        "-Dorg.gradle.appname=$APP_BASE_NAME" \
+        -classpath "$CLASSPATH" \
+        -jar "$APP_HOME/gradle/wrapper/gradle-wrapper.jar" \
+        "$@"
+
+# Stop when "xargs" is not available.
+if ! command -v xargs >/dev/null 2>&1
+then
+    die "xargs is not available"
+fi
+
+# Use "xargs" to parse quoted args.
+#
+# With -n1 it outputs one arg per line, with the quotes and backslashes removed.
+#
+# In Bash we could simply go:
+#
+#   readarray ARGS < <( xargs -n1 <<<"$var" ) &&
+#   set -- "${ARGS[@]}" "$@"
+#
+# but POSIX shell has neither arrays nor command substitution, so instead we
+# post-process each arg (as a line of input to sed) to backslash-escape any
+# character that might be a shell metacharacter, then use eval to reverse
+# that process (while maintaining the separation between arguments), and wrap
+# the whole thing up as a single "set" statement.
+#
+# This will of course break if any of these variables contains a newline or
+# an unmatched quote.
+#
+
+eval "set -- $(
+        printf '%s\n' "$DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS" |
+        xargs -n1 |
+        sed ' s~[^-[:alnum:]+,./:=@_]~\\&~g; ' |
+        tr '\n' ' '
+    )" '"$@"'
+
+exec "$JAVACMD" "$@"
diff --git a/Task_2_1_1/gradlew.bat b/Task_2_1_1/gradlew.bat
new file mode 100644
index 00000000..db3a6ac2
--- /dev/null
+++ b/Task_2_1_1/gradlew.bat
@@ -0,0 +1,94 @@
+@rem
+@rem Copyright 2015 the original author or authors.
+@rem
+@rem Licensed under the Apache License, Version 2.0 (the "License");
+@rem you may not use this file except in compliance with the License.
+@rem You may obtain a copy of the License at
+@rem
+@rem      https://www.apache.org/licenses/LICENSE-2.0
+@rem
+@rem Unless required by applicable law or agreed to in writing, software
+@rem distributed under the License is distributed on an "AS IS" BASIS,
+@rem WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+@rem See the License for the specific language governing permissions and
+@rem limitations under the License.
+@rem
+@rem SPDX-License-Identifier: Apache-2.0
+@rem
+
+@if "%DEBUG%"=="" @echo off
+@rem ##########################################################################
+@rem
+@rem  Gradle startup script for Windows
+@rem
+@rem ##########################################################################
+
+@rem Set local scope for the variables with windows NT shell
+if "%OS%"=="Windows_NT" setlocal
+
+set DIRNAME=%~dp0
+if "%DIRNAME%"=="" set DIRNAME=.
+@rem This is normally unused
+set APP_BASE_NAME=%~n0
+set APP_HOME=%DIRNAME%
+
+@rem Resolve any "." and ".." in APP_HOME to make it shorter.
+for %%i in ("%APP_HOME%") do set APP_HOME=%%~fi
+
+@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
+set DEFAULT_JVM_OPTS="-Xmx64m" "-Xms64m"
+
+@rem Find java.exe
+if defined JAVA_HOME goto findJavaFromJavaHome
+
+set JAVA_EXE=java.exe
+%JAVA_EXE% -version >NUL 2>&1
+if %ERRORLEVEL% equ 0 goto execute
+
+echo. 1>&2
+echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. 1>&2
+echo. 1>&2
+echo Please set the JAVA_HOME variable in your environment to match the 1>&2
+echo location of your Java installation. 1>&2
+
+goto fail
+
+:findJavaFromJavaHome
+set JAVA_HOME=%JAVA_HOME:"=%
+set JAVA_EXE=%JAVA_HOME%/bin/java.exe
+
+if exist "%JAVA_EXE%" goto execute
+
+echo. 1>&2
+echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME% 1>&2
+echo. 1>&2
+echo Please set the JAVA_HOME variable in your environment to match the 1>&2
+echo location of your Java installation. 1>&2
+
+goto fail
+
+:execute
+@rem Setup the command line
+
+set CLASSPATH=
+
+
+@rem Execute Gradle
+"%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" -jar "%APP_HOME%\gradle\wrapper\gradle-wrapper.jar" %*
+
+:end
+@rem End local scope for the variables with windows NT shell
+if %ERRORLEVEL% equ 0 goto mainEnd
+
+:fail
+rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of
+rem the _cmd.exe /c_ return code!
+set EXIT_CODE=%ERRORLEVEL%
+if %EXIT_CODE% equ 0 set EXIT_CODE=1
+if not ""=="%GRADLE_EXIT_CONSOLE%" exit %EXIT_CODE%
+exit /b %EXIT_CODE%
+
+:mainEnd
+if "%OS%"=="Windows_NT" endlocal
+
+:omega
diff --git a/Task_2_1_1/settings.gradle b/Task_2_1_1/settings.gradle
new file mode 100644
index 00000000..16de4b1a
--- /dev/null
+++ b/Task_2_1_1/settings.gradle
@@ -0,0 +1 @@
+rootProject.name = 'Task_2_1_1'
\ No newline at end of file
diff --git a/Task_2_1_1/src/main/java/org/example/ParallelDetector.java b/Task_2_1_1/src/main/java/org/example/ParallelDetector.java
new file mode 100644
index 00000000..8f1dda88
--- /dev/null
+++ b/Task_2_1_1/src/main/java/org/example/ParallelDetector.java
@@ -0,0 +1,24 @@
+package org.example;
+
+import java.util.Arrays;
+import java.util.List;
+
+/**
+ * Класс, реализующий параллельное решение.
+ */
+public class ParallelDetector implements PrimeNumbersDetector {
+
+    /**
+     * Функция для проверки присутствия непростых чисел в массиве.
+     *
+     * @param numbers is checking numbers.
+     * @return true if numbers are not all prime.
+     */
+    @Override
+    public boolean isNotPrimeNumbers(Integer[] numbers) {
+        List<Integer> numList = Arrays.asList(numbers);
+        return !numList.parallelStream().noneMatch(
+                num -> !PrimeNumbersDetectorUtils.isPrimeNumber(num)
+        );
+    }
+}
diff --git a/Task_2_1_1/src/main/java/org/example/PrimeNumbersDetector.java b/Task_2_1_1/src/main/java/org/example/PrimeNumbersDetector.java
new file mode 100644
index 00000000..a7ed1564
--- /dev/null
+++ b/Task_2_1_1/src/main/java/org/example/PrimeNumbersDetector.java
@@ -0,0 +1,9 @@
+package org.example;
+
+/**
+ * Интерфейс для решений по поиску непростых чисел в массиве.
+ */
+public interface PrimeNumbersDetector {
+    // функция принимает массив Integer-ов и, если там есть НЕпростое число, вернет true
+    boolean isNotPrimeNumbers(Integer[] numbers);
+}
diff --git a/Task_2_1_1/src/main/java/org/example/PrimeNumbersDetectorUtils.java b/Task_2_1_1/src/main/java/org/example/PrimeNumbersDetectorUtils.java
new file mode 100644
index 00000000..8ba941f2
--- /dev/null
+++ b/Task_2_1_1/src/main/java/org/example/PrimeNumbersDetectorUtils.java
@@ -0,0 +1,26 @@
+package org.example;
+
+/**
+ * Полезные функции, которые нужны и в последовательном, и в параллельном решении.
+ */
+public class PrimeNumbersDetectorUtils {
+
+    /**
+     * Функция для проверки поданного числа на простоту.
+     *
+     * @param number is checking number.
+     * @return true if number is prime.
+     */
+    static boolean isPrimeNumber(int number) {
+        if (number < 2) {
+            return false;
+        } else {
+            for (int divider = 2; divider * divider <= number; divider++) {
+                if (number % divider == 0) {
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+}
diff --git a/Task_2_1_1/src/main/java/org/example/SequentialDetector.java b/Task_2_1_1/src/main/java/org/example/SequentialDetector.java
new file mode 100644
index 00000000..85faaf4e
--- /dev/null
+++ b/Task_2_1_1/src/main/java/org/example/SequentialDetector.java
@@ -0,0 +1,24 @@
+package org.example;
+
+import java.util.Arrays;
+import java.util.List;
+
+/**
+ * Класс реализующий последовательное решение.
+ * Просто идём по всему массиву и проверяем встретившееся число.
+ */
+public class SequentialDetector implements PrimeNumbersDetector {
+
+    /**
+     * Функция для проверки присутствия непростых чисел в массиве.
+     *
+     * @param numbers is checking numbers.
+     * @return true if numbers are not all prime.
+     */
+    @Override
+    public boolean isNotPrimeNumbers(Integer[] numbers) {
+        List<Integer> numList = Arrays.asList(numbers);
+        return numList.stream().anyMatch(num -> !PrimeNumbersDetectorUtils.isPrimeNumber(num));
+
+    }
+}
diff --git a/Task_2_1_1/src/main/java/org/example/TaskDelimiter.java b/Task_2_1_1/src/main/java/org/example/TaskDelimiter.java
new file mode 100644
index 00000000..298a68a0
--- /dev/null
+++ b/Task_2_1_1/src/main/java/org/example/TaskDelimiter.java
@@ -0,0 +1,57 @@
+package org.example;
+
+/**
+ * Класс для разделения задач между потоками.
+ */
+public class TaskDelimiter {
+
+    /**
+     * Функция для получения количества проверяемых чисел.
+     *
+     * @param threadIdx номер текущего потока.
+     * @param threadQnt сколько всего потоков.
+     * @param taskQnt   сколько всего чисел в массиве.
+     * @return количество проверяемых чисел.
+     * @throws IllegalArgumentException если номер нити больше их количества или
+     *                                  нитей много.
+     */
+    public static int lenThreadPart(int threadIdx, int threadQnt, int taskQnt)
+            throws IllegalArgumentException {
+        checkArguments(threadIdx, threadQnt, taskQnt);
+        int baseLenPart = taskQnt / threadQnt;
+        return threadIdx < taskQnt % threadQnt ? baseLenPart + 1 : baseLenPart;
+    }
+
+    /**
+     * Функция для получения начального индекса в массиве для проверки.
+     *
+     * @param threadIdx номер текущего потока.
+     * @param threadQnt сколько всего потоков.
+     * @param taskQnt   сколько всего чисел в массиве.
+     * @return количество проверяемых чисел.
+     * @throws IllegalArgumentException если номер нити больше их количества или
+     *                                  нитей много.
+     */
+    public static int offsetThreadPart(int threadIdx, int threadQnt, int taskQnt)
+            throws IllegalArgumentException {
+        checkArguments(threadIdx, threadQnt, taskQnt);
+        int baseOffsetPart = taskQnt / threadQnt * threadIdx;
+        int choosenThreads = taskQnt % threadQnt;
+
+        if (threadIdx < choosenThreads) {
+            return baseOffsetPart + threadIdx;
+        }
+        return baseOffsetPart + choosenThreads;
+    }
+
+    private static void checkArguments(int threadIdx, int threadQnt, int taskQnt)
+            throws IllegalArgumentException {
+        if (threadIdx >= threadQnt || threadIdx < 0) {
+            var message = String.format("Your threadIdx can be in [0, %d)", threadQnt);
+            throw new IllegalArgumentException(message);
+        } else if (threadQnt > taskQnt) {
+            var message = String.format("You want to create too many threads");
+            throw new IllegalArgumentException(message);
+        }
+    }
+}
\ No newline at end of file
diff --git a/Task_2_1_1/src/main/java/org/example/ThreadedDetector.java b/Task_2_1_1/src/main/java/org/example/ThreadedDetector.java
new file mode 100644
index 00000000..d259fc76
--- /dev/null
+++ b/Task_2_1_1/src/main/java/org/example/ThreadedDetector.java
@@ -0,0 +1,91 @@
+package org.example;
+
+import java.lang.Thread;
+import java.util.concurrent.atomic.AtomicBoolean;
+
+/**
+ * Класс, реализующий многопоточное решение.
+ */
+public class ThreadedDetector implements PrimeNumbersDetector {
+
+    private final int threadQuantity;
+
+    /**
+     * Метод инициализатор многопоточного решения.
+     *
+     * @param threadQuantity количество желаемых потоков.
+     */
+    public ThreadedDetector(int threadQuantity) {
+        if (threadQuantity <= 0) {
+            throw new IllegalArgumentException(
+                    "It's stupid to create zero and less number of threads!"
+            );
+        }
+        this.threadQuantity = threadQuantity;
+    }
+
+    /**
+     * Функция создаёт новый поток.
+     *
+     * @param offset с какого индекса поток будет проверять массив.
+     * @param len    сколько элементов проверит поток.
+     * @param result есть ли НЕпростое число.
+     * @return новый поток.
+     */
+    private Thread createThread(int offset, int len, Integer[] numbers, AtomicBoolean result) {
+        var newThread = new Thread(
+                () -> {
+                    for (int idx = offset; idx < offset + len; idx++) {
+                        if (result.get()) {
+                            break;
+                        }
+                        if (!PrimeNumbersDetectorUtils.isPrimeNumber(numbers[idx])) {
+                            result.set(true);
+                            break;
+                        }
+                    }
+                });
+
+        newThread.setUncaughtExceptionHandler(
+                (thread, exception) -> {
+                    synchronized (System.err) {
+                        System.err.println("Thread with offset - " + offset + ":");
+                        exception.printStackTrace(System.err);
+                    }
+                });
+        return newThread;
+    }
+
+    /**
+     * Функция для проверки присутствия непростых чисел в массиве.
+     *
+     * @param numbers is checking numbers.
+     * @return true if numbers are not all prime.
+     */
+    @Override
+    public boolean isNotPrimeNumbers(Integer[] numbers) {
+        if (numbers.length == 0) {
+            return false;
+        }
+
+        AtomicBoolean result = new AtomicBoolean(false);
+        final Thread[] threads = new Thread[threadQuantity];
+        for (int threadIdx = 0; threadIdx < threadQuantity; threadIdx++) {
+            int offset = TaskDelimiter.offsetThreadPart(threadIdx, threadQuantity, numbers.length);
+            int len = TaskDelimiter.lenThreadPart(threadIdx, threadQuantity, numbers.length);
+            threads[threadIdx] = createThread(offset, len, numbers, result);
+
+            threads[threadIdx].start();
+        }
+
+        try {
+            for (int threadIdx = 0; threadIdx < threadQuantity; threadIdx++) {
+                threads[threadIdx].join();
+            }
+        } catch (InterruptedException e) {
+            throw new RuntimeException("It is impossible situation!");
+        }
+
+        return result.get();
+    }
+}
\ No newline at end of file
diff --git a/Task_2_1_1/src/test/java/org/example/TestPrimeNumbersDetector.java b/Task_2_1_1/src/test/java/org/example/TestPrimeNumbersDetector.java
new file mode 100644
index 00000000..ad7bc41a
--- /dev/null
+++ b/Task_2_1_1/src/test/java/org/example/TestPrimeNumbersDetector.java
@@ -0,0 +1,63 @@
+package org.example;
+
+
+
+import java.util.stream.Stream;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.extension.ExtensionContext;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.ArgumentsProvider;
+import org.junit.jupiter.params.provider.ArgumentsSource;
+
+
+/**
+ * Класс для тестирования работы Детектеров.
+ */
+public class TestPrimeNumbersDetector {
+
+    @ParameterizedTest()
+    @ArgumentsSource(PrimeDetectorProvider.class)
+    void primeCornerCase(PrimeNumbersDetector primeDetector) {
+        Assertions.assertFalse(primeDetector.isNotPrimeNumbers(new Integer[]{}));
+    }
+
+    @ParameterizedTest()
+    @ArgumentsSource(PrimeDetectorProvider.class)
+    void nonPrimeSimpleTest(PrimeNumbersDetector primeDetector) {
+        Assertions.assertTrue(primeDetector.isNotPrimeNumbers(new Integer[]{
+                0, 1, 2, 3, 4, 5, 6, 7, 8, 9
+        }));
+    }
+
+    @ParameterizedTest()
+    @ArgumentsSource(PrimeDetectorProvider.class)
+    void primeHardTest(PrimeNumbersDetector primeDetector) {
+        Assertions.assertFalse(primeDetector.isNotPrimeNumbers(new Integer[]{
+                6998009, 6998029, 6998039, 20165149, 6998051, 6998053, 20319251, 6997901
+        }));
+    }
+
+    @ParameterizedTest()
+    @ArgumentsSource(PrimeDetectorProvider.class)
+    void nonPrimeHardTest(PrimeNumbersDetector primeDetector) {
+        Assertions.assertTrue(primeDetector.isNotPrimeNumbers(new Integer[]{
+                2, 13, 6997927, 6997937, 17858849, 6997967, 10000000, 999999999
+        }));
+    }
+
+
+    static class PrimeDetectorProvider implements ArgumentsProvider {
+        @Override
+        public Stream<? extends Arguments> provideArguments(ExtensionContext context) {
+            return Stream.of(
+                    Arguments.of(new SequentialDetector()),
+                    Arguments.of(new ThreadedDetector(1)),
+                    Arguments.of(new ThreadedDetector(2)),
+                    Arguments.of(new ThreadedDetector(4)),
+                    Arguments.of(new ThreadedDetector(8)),
+                    Arguments.of(new ParallelDetector())
+            );
+        }
+    }
+}
\ No newline at end of file
diff --git a/Task_2_1_1/src/test/java/org/example/TestPrimeNumbersDetectorUtils.java b/Task_2_1_1/src/test/java/org/example/TestPrimeNumbersDetectorUtils.java
new file mode 100644
index 00000000..8b0ac5ad
--- /dev/null
+++ b/Task_2_1_1/src/test/java/org/example/TestPrimeNumbersDetectorUtils.java
@@ -0,0 +1,46 @@
+package org.example;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+import org.junit.jupiter.api.Test;
+
+
+/**
+ * Класс для тестирования вспомогательных функций для Детектеров.
+ */
+class TestPrimeNumbersDetectorUtils {
+
+    @Test
+    void isPrimeNegativeNumbers() {
+        assertFalse(PrimeNumbersDetectorUtils.isPrimeNumber(-1));
+        assertFalse(PrimeNumbersDetectorUtils.isPrimeNumber(-10));
+    }
+
+    @Test
+    void isPrimeZeroAndOne() {
+        assertFalse(PrimeNumbersDetectorUtils.isPrimeNumber(0));
+        assertFalse(PrimeNumbersDetectorUtils.isPrimeNumber(1));
+    }
+
+    @Test
+    void isPrimeForPrimeNumbers() {
+        assertTrue(PrimeNumbersDetectorUtils.isPrimeNumber(2));
+        assertTrue(PrimeNumbersDetectorUtils.isPrimeNumber(7));
+        assertTrue(PrimeNumbersDetectorUtils.isPrimeNumber(11));
+    }
+
+    @Test
+    void isPrimeNonPrimeNumbers() {
+        assertFalse(PrimeNumbersDetectorUtils.isPrimeNumber(4));
+        assertFalse(PrimeNumbersDetectorUtils.isPrimeNumber(9));
+        assertFalse(PrimeNumbersDetectorUtils.isPrimeNumber(10));
+    }
+
+    @Test
+    void isPrimeLargePrimeNumbers() {
+        assertTrue(PrimeNumbersDetectorUtils.isPrimeNumber(7919));
+        assertTrue(PrimeNumbersDetectorUtils.isPrimeNumber(7907));
+        assertTrue(PrimeNumbersDetectorUtils.isPrimeNumber(7879));
+    }
+}
diff --git a/Task_2_1_1/src/test/java/org/example/TestTaskDelimiter.java b/Task_2_1_1/src/test/java/org/example/TestTaskDelimiter.java
new file mode 100644
index 00000000..48db08d0
--- /dev/null
+++ b/Task_2_1_1/src/test/java/org/example/TestTaskDelimiter.java
@@ -0,0 +1,37 @@
+package org.example;
+
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+import org.junit.jupiter.api.Test;
+
+/**
+ * Класс для тестирования Делителя задач между потоками.
+ */
+class TestTaskDelimiter {
+
+    @Test
+    void lenThreadCorrectLength() {
+        assertEquals(4, TaskDelimiter.lenThreadPart(0, 3, 10));
+        assertEquals(2, TaskDelimiter.lenThreadPart(1, 3, 7));
+        assertEquals(3, TaskDelimiter.lenThreadPart(2, 3, 10));
+    }
+
+    @Test
+    void offsetThreadCorrectOffset() {
+        assertEquals(4, TaskDelimiter.offsetThreadPart(1, 3, 10));
+        assertEquals(7, TaskDelimiter.offsetThreadPart(2, 3, 10));
+        assertEquals(0, TaskDelimiter.offsetThreadPart(0, 3, 7));
+    }
+
+    @Test
+    void checkArgumentsThrowException() {
+        assertThrows(IllegalArgumentException.class, () -> {
+            TaskDelimiter.offsetThreadPart(3, 11, 10);
+        });
+        assertThrows(IllegalArgumentException.class, () -> {
+            TaskDelimiter.lenThreadPart(-1, 3, 10);
+        });
+    }
+}