Question

Напишите,пожалуйста, программу для Turbo паскаля,где вводится натуральное число и нужно определить является ли оно простым. вот блок-схема: начало ввод a f:=0 for i:=2 to a-1 ; →f=0→да→'Простое'→нет→'не простое ' a mod i:=0 да→ f:=1 конец

Answer 1

В такой блок-схеме трудно разобраться))
Написал, как понял. Турбо Паскаля у меня нет, не проверял, но должно работать.

program zad1;
uses crt;
var a,i,f:integer;
begin
readln(a);
f:=0;
for i:=2 to a-1 do
  if a mod i=0 then f:=1;
if f=0 then writeln('простое') else writeln('не простое')
end.

Answer 2

Program for Determining Prime Numbers in Turbo Pascal

Here's a program in Turbo Pascal that takes a natural number as input and determines whether it is a prime number:

program PrimeNumberCheck;
var
   num, i, flag: integer;
begin
   flag := 0;
   write('Enter a number: ');
   readln(num);
   for i := 2 to num - 1 do
   begin
      if (num mod i) = 0 then
      begin
         flag := 1;
         break;
      end;
   end;
   if flag = 0 then
      writeln(num, ' is a prime number')
   else
      writeln(num, ' is not a prime number');
end.

This program initializes a flag variable to 0 and then takes a natural number as input. It then iterates through the numbers from 2 to the input number minus 1. If the input number is divisible by any of these numbers, the flag is set to 1, indicating that the number is not prime. If the flag remains 0 after the loop, the program outputs that the number is prime.

This program uses a simple algorithm to check for prime numbers by iterating through the numbers and checking for divisibility.

Note: The program assumes that the input number is a positive integer.

I hope this helps! Let me know if you have further questions or need additional assistance.