Skip to content

Fix description of answer of prime number #482

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
chvmvd merged 1 commit into from
Oct 18, 2023
Merged

Fix description of answer of prime number #482

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/1-trial-session/08-loop/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -225,7 +225,7 @@ document.write(product);

### 素数判定問題

ある整数の変数 `n` が与えられたとき、その値が素数であるかどうか判定して表示する`for`文を書いてみましょう。
ある整数の変数 `n` が与えられたとき、その値が素数であるかどうか判定するプログラムを作成してください。

そして、`n` に 6、11、57、89 を入れてテストしてみましょう。

Expand Down