Math, asked by Anonymous, 1 year ago

Prove that a positive integer "n" is a prime number , if no prime "p" less than or equal to √n divides n

Answers

Answered by manjumariasaijo

0

Answer:

Step-by-step explanation:

Previous Question

Next Question

Similar questions

Chemistry, 8 months ago

Which of the following notations, describing a subshell with the quantum numbers n and l ,is not correct...

English, 8 months ago

Write a notice for recollection of lost purse in market...

Computer Science, 8 months ago

what is the desktop publishing software? (a) to design reports (b) to design celender (c) to design magazines (d) all of above ...

Math, 1 year ago

plz answer this question...

Geography, 1 year ago

classify the states into five groups each having common frontiers with Pakistan, China, Myanmar and Nepal...

Computer Science, 1 year ago

who invented the turing machine and on what principle it works...

Chemistry, 1 year ago

what do we mean by oxidition and reduction in detail...

Science, 1 year ago

How much is 37 degree celsius in terms of farenheit?